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

  • Jambunathan K 
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1977)


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”.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    W. Meier and O. Staffelbach, Fast Correlation Attacks on Certain Stream-Ciphers, Journal of cryptology(1989) 1:159–176 10zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Jambunathan K 
    • 1
  1. 1.Indian Statistical InstituteCalcuttaIndia

Personalised recommendations