🤖 AI Summary
To address the challenge of simultaneously achieving security, statistical quality, and hardware efficiency in pseudorandom number generators (PRNGs) for lightweight cryptographic applications, this paper proposes a novel cryptographically secure PRNG (CSPRNG). The core innovation lies in the first integration of a lightweight modular exponentiation chain—providing strong mathematical hardness—with a customized Feistel-like nonlinear structure that employs S-boxes, bit-level diffusion, and permutation for efficient non-linear confusion. Implemented on FPGA, the design achieves a throughput of 1.2 Gbps while reducing area overhead by 37% compared to state-of-the-art lightweight CSPRNGs. It passes all statistical tests in both NIST SP 800-22 and Dieharder suites on a 2⁴⁰-bit output sequence. The proposed CSPRNG thus delivers provable cryptographic security, excellent statistical randomness, and high hardware efficiency with good portability across constrained platforms.
📝 Abstract
The aim of this paper is to present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure, passes all of the usual statistical tests referenced in the literature and hence generates high-quality random sequences, that is compact and easy to implement in practice, of portable design and offering reasonable execution times. Our procedure achieves those objectives through the use of a sequence of modular exponentiations followed by the application of Feistel-like boxes that mix up bits using a nonlinear function. The results of extensive statistical tests on sequences of about 240documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$2^{40}$$end{document} bits in size generated by our algorithm are also presented.