Proceedings Article10.1109/IMTC.2007.379465
Implementation-Efficient Maximum-Period Nonlinear Congruential Generators
Tommaso Addabbo,Massimo Alioto,Ada Fort,Marco Mugnaini,Santina Rocchi,Valerio Vignoli +5 more
- 01 May 2007
- pp 1-4
2
TL;DR: In this paper, a family of maximum-period nonlinear congruential generators based on the digitized Renyi map is considered for the definition of hardware (or software) efficient pseudo random number generators (PRNGs).
read more
Abstract: In this paper a family of maximum-period nonlinear congruential generators based on the digitized Renyi map is considered for the definition of hardware (or software) efficient pseudo random number generators (PRNGs). A list of such maximum period PRNGs for period lengths up to 231-1 is provided. Referring to the NIST800-22 statistical test suite, a PRNG example is presented and compared to well known PRNGs based on linear recurrences requiring a similar amount of resources for the implementation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Uniform random numbers : theory and practice
集 手塚
- 01 Jan 1995
TL;DR: This book discusses how to implement Long-Period LCGs using Polynomial Arithmetic, as well as tests using Non-Uniform Random Variate Generation and K-wise Independent Random Variables.
Embedded electronic circuits for cryptography, hardware security and true random number generation: an overview
TL;DR: An overview of selected crypto‐hardware devices, with a special reference to the lightweight electronic implementation of encryption/decryption schemes, hash functions, and true random number generators is provided.
References
•Book
Handbook of Applied Cryptography
Alfred Menezes,Scott A. Vanstone,Paul C. van Oorschot +2 more
- 01 Jan 1996
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
15K
A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications
Andrew L. Rukhin,Juan Soto,James R. Nechvatal,Miles E. Smid,Elaine B. Barker +4 more
- 20 Dec 2000
TL;DR: Some criteria for characterizing and selecting appropriate generators and some recommended statistical tests are provided, as a first step in determining whether or not a generator is suitable for a particular cryptographic application.
Uniform random number generation
TL;DR: In this article, the authors examine practical ways of generating (deterministic approximations to) such uniform variates on a computer and compare them in terms of ease of implementation, efficiency, theoretical support, and statistical robustness.
298
Random Number Generation and Monte Carlo Methods
TL;DR: This book presents recent developments in Bayesian nonlinear modeling and provides a complete treatment of regression and classi cation problems by emphasizing a data-driven approach in determining appropriate models.
140
Reconstructing truncated integer variables satisfying linear congruences
TL;DR: A general polynomial time algorithm is proposed to find small integer solutions to systems of linear congruences and will solve most problems when twice as much information as that necessary to uniquely determine the variables is available.
121