Revisiting LFSRs for Cryptographic Applications

DOI10.1109/TIT.2011.2164234zbMath1365.94369OpenAlexW2008254902MaRDI QIDQ5272226

Benjamin Pousse, François Arnault, Marine Minier, 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)

Related Items (6)

Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences ⋮ New application methods for word-oriented cryptographic primitives ⋮ An Equivalence-Preserving Transformation of Shift Registers ⋮ Flatness and structural analysis as a constructive framework for private communication ⋮ Fast construction of binary ring FCSRs for hardware stream ciphers ⋮ 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