Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1255, Issue , 1997, Pages 250-262

  Mihaljević, Miodrag J ^a  

^a MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CELLULAR AUTOMATA; ERROR CORRECTION; ERRORS; ITERATIVE METHODS;

CIPHERTEXT-ONLY ATTACKS; FAST ALGORITHMS; ITERATIVE ERROR; KEY STREAM GENERATOR; KNOWN-PLAINTEXT ATTACKS; PROGRAMMABLE CELLULAR AUTOMATA; PSEUDORANDOM BIT GENERATOR; SECRET KEY;

ALGEBRA;

EID: 0012279808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63163-1_20     Document Type: Conference Paper

References (13)

1. S. Wolfram, “Random sequence generation by cellular automata”, Advances in Applied Mathematics 7, pp. 123-169, 1986.
2. S. Wolfram, “Cryptography with cellular automata”, Lecture Notes in Computer Science, vol. 218, pp. 429-432, 1986.
3. W. Meier and O. Staffelbach, “Analysis of pseudo random sequences generated by cellular automata”, Lecture Notes in Computer Science, vol. 547, pp. 186-199, 1992.
4. W. Diffie, “The first ten years of public-key cryptography”, Proc. IEEE, pp. 560-577, 1988.
5. A.K. Das, A. Gonguly, A. Dasgupta, S. Bhawmik, and P. Pal Chaudhuri, ‘‘Efficient characterization of cellular automata”, IEE Proc., Pt. E, vol. 137, no. 1, pp. 81-87, Jan. 1990.
6. A.K. Das and P. Pal Chaudhuri, “Vector space theoretic analysis of additive cellular automata and its applications for pseudo-exhaustive test pattern generation”, IEEE Trans. Comput., vol. 42, no. 3 pp. 340-352, Mar. 1993.
7. S. Nandi, B.K. Kar, and P. Pal Chaudhuri, “Theory and applications of cellular automata in cryptography”, IEEE Trans. Comput., vol. 43, no. 12, pp. 1346-1357, Dec. 1994.
8. T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”, IEEE Trans. Comput, vol. C-34, no. 1, pp. 81-85, Jan. 1985.
9. M. Mihaljević, “A Correlation Attack on the Binary Sequence Generators with Time-Varying Output Function”, Advances in Cryptology – ASIACRYPT ‘94, Lecture Notes in Computer Science, vol. 917, pp. 67-79, 1995.
10. J. Golić and M. Mihaljević, “ A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance”, Journal of Cryptology, vol. 3, pp. 201-212, 1991.
11. M. Mihaljević and J. Golić, “A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence”, Advances in Cryptology – AUSCRYPT ‘90, Lecture Notes in Computer Science, vol. 453, pp. 165-175, 1990.
12. M. Mihaljević and J. Golić, “A comparison of cryptanalytic principles based on iterative error-correction”, Advances in Cryptology – EUROCRYPT ‘91, Lecture Notes in Computer Science, vol. 547, pp. 527-531, 1992.
13. M. Mihaljević and J. Golić, “Convergence of a Bayesian iterative error-correction procedure on a noisy shift register sequence”, Advances in Cryptology – EUROCRYPT ‘92, Lecture Notes in Computer Science, vol. 658, pp. 124-137, 1993.