Abstract
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false comfort if the amount of entropy in the key is small. Unfortunately the amount of entropy driving a cryptographic function is usually overestimated, as entropy is confused with much weaker correlation properties and the entropy source is difficult to analyze. Reliable, high speed, and low cost generation of non-deterministic, highly entropic bits is quite difficult with many pitfalls. Natural analog processes can provide non-deterministic sources, but practical implementations introduce various biases. Convenient wide-band natural signals are typically 5 to 6 orders of magnitude less in voltage than other co-resident digital signals such as clock signals that rob those noise sources of their entropy. To address these problems, we have developed new theory and we have invented and implemented some new techniques. Of particular interest are our applications of signal theory, digital filtering, and chaotic processes to the design of random number generators. Our goal has been to develop a theory that will allow us to evaluate the effectiveness of our entropy sources. To that end, we develop a Nyquist theory for entropy sources, and we prove a lower bound for the entropy produced by certain chaotic sources. We also demonstrate how chaotic sources can allow spurious narrow band sources to add entropy to a signal rather than subtract it. Armed with this theory, it is possible to build practical, low cost random number generators and use them with confidence.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. F. Murry, “A General Approach for Generating Natural Random Variables,” IEEE Trans. Computers, Vol. C-19, pp. 1210–1213, December 1970.
J. S. Bendat, Principles and Applications of Random Noise Theory, John Wiley and Sons, Inc., 1958.
J. D. Boyes, “Binary Noise Sources Incorporating Modulo-N Dividers,” IEEE Trans. Computers, Vol. C-23, pp. 550–552, May 1974.
F. Castanie, “Generation of Random Bits with Accurate and Reproducible Statistical Properties,” Proc. IEEE, Vol. 66, pp. 807–809, July 1978.
D. R. Morgan, “Analysis of Digital Random Numbers Generated from Serial Samples of Correlated Gaussian Noise”, IEEE Trans. on Info. Theory, Vol. IT-27, No. 2, March 1981, pp. 235–239.
R. Price, “A Useful Theorem for Non-linear Devices Having Gaussian Inputs,” IRE PGIT, Vol. IT-4, 1958.
H. G. Schuster, Deterministic Chaos, VCH, 1989.
G. M. Bernstein, M. A. Lieberman, “Secure Random Number Generation Using Chaotic Circuits”, IEEE Trans. on Circuits and Systems, Vol. 37,No. 9, September 1990, pp. 1157–1164.
S. Espejo-Meana, J. D. Martin-Gomez, A. Rodriguez-Vazquez, J. Huertas, “Application of Piecewise-Linear Switched Capacitor Circuits for Random Number Generation”, Proc. Midwest Symp. Circuits and Systems, August 1989, pp. 960–963.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maher, D.P., Rance, R.J. (1999). Random Number Generators Founded on Signal and Information Theory. In: Koç, Ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems. CHES 1999. Lecture Notes in Computer Science, vol 1717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48059-5_19
Download citation
DOI: https://doi.org/10.1007/3-540-48059-5_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66646-2
Online ISBN: 978-3-540-48059-4
eBook Packages: Springer Book Archive