A Transformation From the Fibonacci to the Galois NLFSRs

DOI10.1109/TIT.2009.2030467zbMath1367.94287OpenAlexW2141060521MaRDI QIDQ4974076

Elena Dubrova

Publication date: 8 August 2017

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

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

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (16)

Cryptanalysis of the class of maximum period Galois NLFSR-based stream ciphers ⋮ Improved transformation algorithms for generalized Galois NLFSRs ⋮ A novel method for reconstructing period with single input in NFSR ⋮ Isomorphism and equivalence of Galois nonlinear feedback shift registers ⋮ An Equivalence-Preserving Transformation of Shift Registers ⋮ On a class of isomorphic NFSRs ⋮ A novel method for driven stability of NFSRs via STP ⋮ A note on determine the greatest common subfamily of two NFSRs by Gröbner basis ⋮ The transformation between the Galois NLFSRs and the Fibonacci NLFSRs via semi-tensor product of matrices ⋮ Espresso: a stream cipher for 5G wireless communication systems ⋮ A new linearization method for nonlinear feedback shift registers ⋮ Internal state recovery of espresso stream cipher using conditional sampling resistance and TMDTO attack ⋮ Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs ⋮ On Galois NFSRs equivalent to Fibonacci ones ⋮ Improved transformation between Fibonacci FSRs and Galois FSRs based on semi-tensor product ⋮ A generic method for investigating nonsingular Galois NFSRs

This page was built for publication: A Transformation From the Fibonacci to the Galois NLFSRs