On the existence of secure feedback registers

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

Volumn 1070, Issue , 1996, Pages 256-267

  Klapper, Andrew ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

Binary sequences; Cryptography; Nonlinear feedback registers; Security; Stream ciphers

Indexed keywords

BINARY SEQUENCES; CRYPTOGRAPHY;

BERLEKAMP; BUILD SYSTEMS; KEYSTREAM; KEYSTREAM GENERATORS; PERIODIC SEQUENCE; SECURITY; STREAM CIPHERS;

NONLINEAR FEEDBACK;

EID: 0345946916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_23     Document Type: Conference Paper

References (18)

1. J. Balcázar, J. Diaz, and J. Gabarró: Structural Complexity I. Berlin: Springer 1988.
2. M. Blum and S. Micali: How to generate crvptographically strong sequences of pseudorandom bits. SIAM Journal on Computing 13, 850-864 (1984).
3. G. Cohen and S. Litsyn: On the covering radius of Reed-Muller codes. Discrete Mathematics 106-107, 147-155 (1992).
4. A.H. Chan and R.A. Games: On the linear span of binary sequences from finite geometries,q odd. IEEE Transactions on Information Theory 36, 548-552 (1990).
5. C. Ding: The differential cryptanalysis and design of natural stream ciphers. In: R. Anderson (ed.): Fast Software Encryption: Proceedings of 1993 Cambridge Security Workshop. Lecture Notes in Computer Science 809. Berlin: Springer 1994, pp. 101-120.
6. J. Golić: Linear cryptanalyis of stream ciphers. In: B. Preneel (ed.): Fast Software Encryption: Proceedings of 1994 Leuven Security Workshop. Lecture Notes in Computer Science 1008. Berlin: Springer 1995, pp. 154-169.
7. E.J. Groth: Generation of binary sequences with controllable complexity. IEEE Transactions on Information Theory IT-17, 288-296 (1971).
8. E.L. Key: An Analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Transactions on Information Theory IT-22, 732-736 (1976).
9. A. Klapper: The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic. Journal of Cryptology 7, 33-51 (1994).
10. A. Klapper and M. Goresky: 2-Adic Shift Registers. In: R. Anderson (ed.): Fast Software Encryption: Proceedings of 1993 Cambridge Security Workshop. Lecture Notes in Computer Science 809. Berlin: Springer 1994, pp. 174-178.
11. A. Klapper and M. Goresky: Feedback Shift Registers, Combiners with Memory, and 2-Adic Span, University of Kentucky, Deptartment of Computer Science Technical Report, 1995.
12. A. Klapper and M. Goresky: Cryptanalysis Based on 2-Adic Rational Approximation. In: D. Coppersmith (ed.) Advances in Cryptology - CRYPTO'95. Lecture Notes in Computer Science 963. Berlin: Springer 1994, pp. 262-273.
13. J.L. Massey: Shift register sequences and BCH decoding. IEEE Transactions on Information Theory IT-15, 122-127 (1969).
14. U. M. Maurer: A Provably-Secure Strongly-Randomized Cipher. In: S. Vanstone (ed.) Advances in Cryptology - CRYPTO'90. Lecture Notes in Computer Science 473. Berlin: Springer 1991, pp. 361-73.
15. R. Rueppel: Analysis and Design of Stream Ciphers. New York Springer, 1986.
16. R.A. Rueppel and O.J. Staffelbach: Products of linear recurring sequences sith maximum complexity, IEEE Transactions on Information Theory IT-33, 124-129 (1987).
17. T. Siegenthaler: Decrypting a class of stream ciphers using cipertext only. IEEE Transactions on Computing 34, 81-85 (1985).
18. A. Yao: Theory and applications of trapdoor functions. In: Proceedings, 23rd IEEE Symposium on Foundations of Computer Science, 1982, pp. 80-91.