Revisiting LFSRs for Cryptographic Applications

DOI10.1109/TIT.2011.2164234MaRDI QIDQ5272226zbMATH OpenOpenAlexFDO

Authors François Arnault, Marine Minier, Benjamin Pousse, Thierry P. Berger

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2011.2164234

Mathematics Subject Classification ID

Feedback control (93B52) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Cited in

(7)

• Flatness and structural analysis as a constructive framework for private communication
• Fast construction of binary ring FCSRs for hardware stream ciphers
• scientific article; zbMATH DE number 1583930 (Why is no real title available?)
• An Equivalence-Preserving Transformation of Shift Registers
• Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences
• New application methods for word-oriented cryptographic primitives
• Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications

This page was built for publication: Revisiting LFSRs for Cryptographic Applications

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