An Equivalence-Preserving Transformation of Shift Registers

DOI10.1007/978-3-319-12325-7_16zbMath1337.94013OpenAlexW641446768MaRDI QIDQ2945083

Elena Dubrova

Publication date: 9 September 2015

Published in: Sequences and Their Applications - SETA 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12325-7_16

Mathematics Subject Classification ID

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

Related Items (4)

Cryptanalysis of the class of maximum period Galois NLFSR-based stream ciphers ⋮ Improved transformation algorithms for generalized Galois NLFSRs ⋮ On Galois NFSRs equivalent to Fibonacci ones ⋮ Improved transformation between Fibonacci FSRs and Galois FSRs based on semi-tensor product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A matrix approach for FCSR automata
• Quark: a lightweight hash
• A similarity transform for linear finite state machines
• Trivium
• An Algorithm for Constructing a Fastest Galois NLFSR Generating a Given Sequence
• Fibonacci and Galois representations of feedback-with-carry shift registers
• A Transformation From the Fibonacci to the Galois NLFSRs
• Revisiting LFSRs for Cryptographic Applications
• Finding Matching Initial States for Equivalent NLFSRs in the Fibonacci and the Galois Configurations
• Equivalence of nonlinear shift-registers

This page was built for publication: An Equivalence-Preserving Transformation of Shift Registers