Multiples of primitive polynomials over GF(2)

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

Volumn 2247, Issue , 2001, Pages 62-72

  Gupta, Kishan Chand ^a   Maitra, Subhamoy ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Cryptanalysis; Galois field; Polynomial multiples; Primitive polynomials; Stream cipher

Indexed keywords

CRYPTOGRAPHY; POLYNOMIALS;

AVERAGE DEGREE; CRYPTANALYSIS; GALOIS FIELDS; INITIAL CONDITIONS; LINEAR FEEDBACK SHIFT REGISTERS; PRIMITIVE POLYNOMIALS; SPARSE MULTIPLES; STREAM CIPHERS;

SHIFT REGISTERS;

EID: 33645191450     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45311-3_6     Document Type: Conference Paper

References (12)

1. A. Canteaut and M. Trabbia. Improved fast correlation attacks using paritycheck equations of weight 4 and 5. In Advances in Cryptology - EUROCRYPT 2000, number 1807 in Lecture Notes in Computer Science, pages 573-588. Springer Verlag, 2000.
2. C. Ding, G. Xiao, and W. Shan. The Stability Theory of StreamCiphers. 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, Lecture Notes in Computer Science, Springer Verlag (to appear), 2001.
5. K. Huber. Some comments on Zech’s logarithms. IEEE Transactions on Information Theory, IT-36(4): 946-950, July 1990.
6. K. Jambunathan. On choice of connection polynomials for LFSR based stream ciphers. In Progress in Cryptology - INDOCRYPT 2000, number 1977 in Lecture Notes in Computer Science, pages 9-18. Springer Verlag, 2000.
7. 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.
8. n). IEEE Transactions on Computers, volume 49(5): 519-524, May 2000.
9. R. Lidl and H. Niederreiter. Finite Fields. Addison Wesley, 1983.
10. F. J. MacWillams and N. J. A. Sloane. The Theory of Error Correcting Codes. North Holland, 1977.
11. W. Meier and O. Staffelbach. Fast correlation attacks on certain stream ciphers. Journal of Cryptology, 1: 159-176, 1989.
12. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, IT-30(5): 776-780, September 1984.