On Choice of Connection-Polynominals for LFSR-Based Stream Ciphers

Authors:
Jambunathan K
Affiliations:
-
Venue:
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Year:
2000

Citing 1
Cited 5

Fast correlation attacks on certain stream ciphers

Journal of Cryptology

Primitive Polynomials over GF(2) - A Cryptologic Approach

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Further Results on Multiples of Primitive Polynomials and Their Products over GF(2)

ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Multiples of Primitive Polynomials and Their Products over GF(2)

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Multiples of Primitive Polynomials over GF(2)

INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Divisibility of polynomials over finite fields and combinatorial applications

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Here I suggest a design criterion for the choice of connection-polynomials in LFSR-based stream-cipher systems. I give estimates of orders of magnitude of the sparse-multiples of primitive-polynomials. I show that even for reasonable degrees (degrees of the order of 100) of primitive connection-polynomials the degrees of their sparse-multiples are "considerably higher".