Fibonacci and Galois representations of feedback-with-carry shift registers
From MaRDI portal
Publication:4677606
DOI10.1109/TIT.2002.804048zbMath1062.94028OpenAlexW2103352188MaRDI QIDQ4677606
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2002.804048
Related Items (14)
Statistical properties of half-\(\ell\)-sequences ⋮ An Equivalence-Preserving Transformation of Shift Registers ⋮ Matrix parametrized shift registers ⋮ Entropy of the Internal State of an FCSR in Galois Representation ⋮ A matrix approach for FCSR automata ⋮ A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences ⋮ 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 ⋮ Expected π-Adic Security Measures of Sequences ⋮ Parallel Generation of ℓ-Sequences ⋮ Extended BDD-Based Cryptanalysis of Keystream Generators ⋮ Linearity properties of binary FCSR sequences ⋮ Some remarks on FCSRs and implications for stream ciphers ⋮ Fast control for reversible processors
This page was built for publication: Fibonacci and Galois representations of feedback-with-carry shift registers
