Further results on multiples of primitive polynomials and their products over GF(2)

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

Volumn 2513, Issue , 2002, Pages 231-242

  Venkateswarlu, Ayineedi ^a   Maitra, Subhamoy ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Cryptanalysis; Galois field; Nonlinear combiner model; Polynomial multiples; Primitive polynomials their products; Stream cipher

Indexed keywords

CRYPTOGRAPHY; ECONOMIC AND SOCIAL EFFECTS; SHIFT REGISTERS;

CRYPTANALYSIS; GALOIS FIELDS; LINEAR FEEDBACK SHIFT REGISTERS; PRIMITIVE POLYNOMIALS; PRODUCT OF PRIMITIVE POLYNOMIALS; STREAM CIPHER SYSTEMS; STREAM CIPHERS; TIME-MEMORY TRADE-OFFS;

POLYNOMIALS;

EID: 33645205435     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. A. Canteaut and M. Trabbia. Improved fast correlation attacks using parity-check equations of weight 4 and 5. In Advances in Cryptology - EUROCRYPT 2000, number 1807 in LNCS, pages 573–588. Springer Verlag, 2000.
2. C. Ding, G. Xiao, and W. Shan. The Stability Theory of Stream Ciphers. Number 561 in Lecture Notes in Computer Science. Springer-Verlag, 1991.
3. S. W. Golomb. Shift Register Sequences. Aegean Park Press, 1982.
4. K. C. Gupta and S. Maitra. Primitive polynomials over GF(2) – A cryptologic approach. In ICICS 2001, number 2229 in LNCS, Pages 23–34, November 2001.
5. K. C. Gupta and S. Maitra. Multiples of primitive polynomials over GF(2). INDOCRYPT 2001, number 2247 in LNCS, Pages 62–72, December 2001.
6. K. Jambunathan. On choice of connection polynomials for LFSR based stream ciphers. INDOCRYPT 2000, number 1977 in LNCS, Pages 9–18, 2000.
7. G. A. Jones and J. M. Jones. Elementary Number Theory. Springer Verlag London Limited, 1998.
8. T. Johansson and F. Jonsson. Fast correlation attacks through reconstruction of linear polynomials. In Advances in Cryptology - CRYPTO 2000, number 1880 in Lecture Notes in Computer Science, pages 300–315. Springer Verlag, 2000.
9. R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, 1994.
10. F. J. MacWillams and N. J. A. Sloane. The Theory of Error Correcting Codes. North Holland, 1977.
11. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
12. S. Maitra, K. C. Gupta and A. Venkateswarlu. Multiples of Primitive Polynomials and Their Products over GF(2). In SAC 2002, August 2002, pages 218–234 in preproceedings, proceedings to be published in Lecture Notes in Computer Science.
13. W. Meier and O. Stafflebach. Fast correlation attacks on certain stream ciphers. Journal of Cryptology, 1:159–176, 1989.
14. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, IT-30(5):776–780, September 1984.
15. T. Siegenthaler. Decrypting a class of stream ciphers using ciphertext only. IEEE Transactions on Computers, C-34(1):81–85, January 1985