DocumentCode
1604928
Title
Pseudo-random sequence generation using the CNN universal machine with applications to cryptography
Author
Crounse, Kenneth R. ; Yang, Tao ; Chua, Leon O.
Author_Institution
Electron. Res. Lab., California Univ., Berkeley, CA, USA
fYear
1996
Firstpage
433
Lastpage
438
Abstract
A good source of reproducible random-looking data is important in many applications ranging from simulation of physical systems, communications, and cryptography. It is demonstrated that the cellular neural network (CNN) universal machine (or the discrete-time CNN) is capable of producing a two-dimensional pseudo-random bit stream at high speeds by means of cellular automata (CA). First, the random properties of some irreversible two-dimensional CA rules, selected by applying mean-field theory, are analyzed by a battery of statistical tests. Second, a special class of reversible CA are considered for random number generation and are shown to have some of the desirable properties of physics-like models. Finally, as an example application for random number generation on the CNNUM, some cryptographic schemes are proposed
Keywords
cellular automata; cellular neural nets; cryptography; random number generation; 2D pseudo-random bit stream; CNN universal machine; CNNUM; cellular automata; cellular neural network; cryptography; mean-field theory; pseudo-random sequence generation; random number generation; Automata; Batteries; Boolean functions; Cellular neural networks; Cryptography; Image processing; Laboratories; Random number generation; Testing; Turing machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Cellular Neural Networks and their Applications, 1996. CNNA-96. Proceedings., 1996 Fourth IEEE International Workshop on
Conference_Location
Seville
Print_ISBN
0-7803-3261-X
Type
conf
DOI
10.1109/CNNA.1996.566613
Filename
566613
Link To Document