Cryptanalysis of the class of maximum period Galois NLFSR-based stream ciphers

DOI10.1007/s12095-021-00511-0zbMath1485.94047OpenAlexW3184882279WikidataQ123286110 ScholiaQ123286110MaRDI QIDQ2121015

Ge Yao, Udaya Parampalli

Publication date: 1 April 2022

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-021-00511-0

zbMATH Keywords

algebraic attackLFSRespresso cipherFibonacci NLFSRGalois NLFSRtransformation algorithm

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Improved transformation algorithms for generalized Galois NLFSRs

Uses Software

• Espresso

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Espresso: a stream cipher for 5G wireless communication systems
• The transformation between the Galois NLFSRs and the Fibonacci NLFSRs via semi-tensor product of matrices
• Gaussian elimination is not optimal
• An Equivalence-Preserving Transformation of Shift Registers
• A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs
• A New Attack on the Filter Generator
• An analysis of the structure and complexity of nonlinear binary sequence generators
• Searching Short Recurrences of Nonlinear Shift Registers via Directed Acyclic Graphs
• A Transformation From the Fibonacci to the Galois NLFSRs
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Cryptanalysis of the class of maximum period Galois NLFSR-based stream ciphers