On choice of connection-polynomials for LFSR-based stream ciphers.

DOI10.1007/3-540-44495-5_2MaRDI QIDQ2707587zbMATH OpenFDO

Authors K. Jambunathan

Publication date 26 June 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44495-5_2

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Exploiting multiples of the connection polynomial in word-oriented stream ciphers
• On Guess and Determine Cryptanalysis of LFSR-Based Stream Ciphers
• Stream ciphers, a perspective. (Abstract)
• scientific article; zbMATH DE number 1955779
• scientific article; zbMATH DE number 30328
• Improved Distinguishers on Stream Ciphers With Certain Weak Feedback Polynomials
• Differential power analysis of stream ciphers with LFSRs
• Some remarks on FCSRs and implications for stream ciphers
• Revisiting LFSRs for Cryptographic Applications
• Tight security bounds for generic stream cipher constructions

Cited in

(7)

• Results on multiples of primitive polynomials and their products over GF(2)
• Divisibility of polynomials over finite fields and combinatorial applications
• scientific article; zbMATH DE number 1951614 (Why is no real title available?)
• scientific article; zbMATH DE number 1980963 (Why is no real title available?)
• scientific article; zbMATH DE number 2080672 (Why is no real title available?)
• Multiples of primitive polynomials over GF(2)
• Division of tetranomials by type II pentanomials and orthogonal arrays

This page was built for publication: On choice of connection-polynomials for LFSR-based stream ciphers.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707587)