The use of linear hybrid cellular automata as pseudorandom bit generators in cryptography

Neural, Parallel and Scientific Computations

Volumn 12, Issue 2, 2004, Pages 175-192

  Rubio, C Fraile ^a   Encinas, Luis Hernández ^b   White, Sarah Hoya ^a   del Rey, A Martín ^a   Sánchez, Gerardo Rodríguez ^a  

^a UNIVERSITY OF SALAMANCA   (Spain)

^b Consejo Superior de Investigaciones Científicas   (Spain)

Author keywords

Cryptography; Linear hybrid cellular automata; Pseudorandom number generators

Indexed keywords

BOUNDARY CONDITIONS; COMPUTER SIMULATION; CORRELATION METHODS; CRYPTOGRAPHY; RANDOM NUMBER GENERATION; SECURITY OF DATA; SET THEORY; STATISTICAL TESTS;

AUTOCORRELATION TEST; LINEAR HYBRID CELLULAR AUTOMATA; PSEUDORANDOM NUMBER GENERATORS;

FINITE AUTOMATA;

EID: 18944400731     PISSN: 10615369     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Alvarez Marañón, G., Hernández Encinas A., Hernández Encinas, L., Martín del Rey, A. & Rodríguez Sánchez, G. (2003). Graphics cryptography with pseudorandom bit generators and cellular automata, Lecture Notes in Artificial Intelligence v. 2773, pp. 1207-1214.
2. Bardell, P. H. (1990). Analysis of cellular automata used as pseudorandom pattern generators, Proc. of 1990 International Test Conference. pp. 762-768.
3. Cattell, K. & Muzio, J.C. (1998). An explicit similarity transform between cellular automata and LFSR matrices, Finite Fields and Applications v. 4, pp. 239-251.
4. Díaz, D., Hernández, A., Hernández, L., Hoya, S., Martín. A., Rodríguez, G. & Visus, I. (2003). Wolfram cellular automata and their cryptography use as pseudorandom bit generators, International Journal of Pure and Applied Mathematics v. 4, pp. 87-103.
5. Golomb, S.W. (1967). Shift register sequences. San Francisco, Holden-Day.
6. Guan, P. (1987). Cellular automaton public-key cryptosystem, Complex Systems v. 1, pp. 51-57.
7. Gutowitz, H. A. (1993). Cryptography with dynamical systems, Proc. of the NATO Advanced Study Institute, pp. 237-274.
8. Hernández Encinas, L., Martín del Rey, M. & Hernández Encinas, A. (2002). Encryption of images with 2-dimensional cellular automata, Proc. of 6-th Multiconference on Systemics, Cybernetics and Informatics. pp. 471-476.
9. Knuth, D.E. (1998). The art of computer programming, Vol. 2. Seminumerical algorithms. Reading, MA, 3rd ed., Addison-Wesley.
10. Massey, J.L. (1969). Shift-regiser synthesis and BCH decoding, IEEE Transactions on Information Theory v. 15, pp. 122-127.
11. Meier, W. & Staffelbach, O. (1992). Analysis of pseudorandom sequences generated by cellular automata, Lecture Notes in Computer Science v. 547, pp. 186-189.
12. Menezes, A., van Oorschot, P. & Vanstone, S. (1997). Handbook of applied cryptography. Boca Raton, FL., CRC Press.
13. Nandi, S., Kar, B. K. & Chaudhuri, P. P. (1994). Theory and applications of cellular automata in cryptography, IEEE Transactions on Computers v. 43, pp. 1346-1357.
14. Niederreiter, N. (1992). Random number generation and quasi-Monte Carlo methods. Philadelphia, SIAM.
15. Stinson, D. R. (2002). Cryptography Theory and Practice, Second Edition, Boca Raton, FL, CRC Press.
16. Tomassini, M. & Perrenoud, M. (2001). Cryptography with cellular automata, Applied Software and Computing v. 1, pp. 151-160.
17. Tomassini, M., Sipper, M., Zolla, M. & Perrenoud, M. (1999). Generating high-quality random numbers in parallel by cellular automata, Future Generation Computer Systems v. 16, pp. 291-305.
18. Wolfram, S. (1983). Cellular automata, Los Alamos Science v. 9, pp. 2-21.
19. Wolfram, S. (1984). Computation theory of cellular automata, Communications in Mathematical Physics v. 96, pp. 15-57.
20. Wolfram, S. (1986). Random sequence generation by cellular automata, Advances in Applied Mathematics vol. 7, pp. 123-169.