Abstract
Here I suggest a design criterion for the choice of connectionpolynomials 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”.
Cite
CITATION STYLE
Jambunathan, K. (2000). On choice of connection-polynomials for LFSR-based stream ciphers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1977, pp. 9–18). Springer Verlag. https://doi.org/10.1007/3-540-44495-5_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
