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

Theoretical Computer Science

Volumn 341, Issue 1-3, 2005, Pages 311-343

  Maitra, Subhamoy ^a   Gupta, Kishan Chand ^b   Venkateswarlu, Ayineedi ^c  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b UNIVERSITY OF WATERLOO   (Canada)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Cryptology; Primitive polynomials; Product of primitive polynomials; Sparse multiples; Statistical distribution; Stream cipher

Indexed keywords

CRYPTOGRAPHY; MATHEMATICAL MODELS; STATISTICAL METHODS;

CRYPTOLOGY; PRIMITIVE POLYNOMIALS; PRODUCT OF PRIMITIVE POLYNOMIALS; SPARSE MULTIPLES; STATISTICAL DISTRIBUTION; STREAM CIPHER;

POLYNOMIALS;

EID: 23844532560     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.04.011     Document Type: Article

References (19)

1. A. Canteaut, M. Trabbia. Improved fast correlation attacks using parity-check equations of weight 4 and 5, in: Advances in Cryptology - EUROCRYPT 2000, Lecture Notes in Computer Science, vol. 1807, Springer, Berlin, 2000, pp. 573-588.
2. C. Ding, G. Xiao, W. Shan. The Stability Theory of Stream Ciphers, in: Lecture Notes in Computer Science, vol. 561, Springer, Berlin, 1991.
3. S.W. Golomb Shift Register Sequences 1982 Aegean Park Press
4. K.C. Gupta, S. Maitra. Primitive polynomials over GF (2 ) - a cryptologic approach, in: ICICS 2001, Lecture Notes in Computer Science, vol. 2229, Springer, Berlin, November 2001, pp. 23-34.
5. K.C. Gupta, S. Maitra. Multiples of primitive polynomials over GF (2 ), in: INDOCRYPT 2001, Lecture Notes in Computer Science, vol. 2247, Springer, Berlin, December 2001, pp. 62-72.
6. K. Jambunathan. On choice of connection polynomials for LFSR based stream ciphers, in: Progress in Cryptology - INDOCRYPT 2000, Lecture Notes in Computer Science, vol. 1977, Springer, Berlin, 2000, pp. 9-18.
7. G.A. Jones, and J.M. Jones Elementary Number Theory 1998 Springer London
8. D. Laksov Linear recurring sequences over finite fields Math. Scand. 16 1965 181 196
9. R. Lidl, and H. Niederreiter Encyclopedia of Mathematics 1983 Addison-Wesley Reading, MA
10. R. Lidl, and H. Niederreiter Introduction to Finite Fields and Their Applications 1994 Cambridge University Press Cambridge
11. F.J. MacWillams, and N.J.A. Sloane The Theory of Error Correcting Codes 1977 North-Holland Amsterdam
12. S. Maitra, K.C. Gupta, A. Venkateswarlu, Multiples of primitive polynomials and their products over GF (2 ), in: Selected Areas in Cryptography, SAC 2002, August 2002, Lecture Notes in Computer Science, vol. 2595, Springer, Berlin, 2003, pp. 214-231.
13. W. Meier, and O. Stafflebach Fast correlation attacks on certain stream ciphers J. Cryptology 1 1989 159 176
14. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone Handbook of Applied Cryptography 1997 CRC Press Boca Raton, FL
15. W.T. Penzhorn. Correlation attacks on stream ciphers: computing low weight parity checks based on error correcting codes, in: Fast Software Encryption, FSE 1996, Lecture Notes in Computer Science, vol. 1039, Springer, Berlin, 1996, pp. 159-172.
16. W.T. Penzhorn, G.J. Kuhn. Computation of low weight parity checks for correlation attacks on stream ciphers, in: Cryptography and Coding, 5th IMA Conf., Lecture Notes in Computer Science, vol. 1025, Springer, Berlin, 1995, pp. 74-83.
17. A. Venkateswarlu, S. Maitra. Further results on multiples of primitive polynomials and their products over GF (2 ), in: ICICS 2002, Lecture Notes in Computer Science, vol. 2513, Springer, Berlin, December 2002, pp. 231-242.
18. D. Wagner. A generalized birthday problem, in: CRYPTO 2002, Lecture Notes in Computer Science, vol. 2442, Springer, Berlin, 2002, pp. 288-303.
19. http://www.theory.csc.uvic.ca/ ∼ cos/inf/neck/den_prim.html.