A matrix approach for FCSR automata
From MaRDI portal
Publication:662175
DOI10.1007/s12095-010-0041-zzbMath1251.94019MaRDI QIDQ662175
Benjamin Pousse, Thierry P. Berger, François Arnault
Publication date: 21 February 2012
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-010-0041-z
68Q45: Formal languages and automata
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
Related Items
On the arithmetic Walsh coefficients of Boolean functions, A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences, Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications, Matrix parametrized shift registers, Fast construction of binary ring FCSRs for hardware stream ciphers, An Equivalence-Preserving Transformation of Shift Registers
Uses Software
Cites Work
- Unnamed Item
- Feedback shift registers, 2-adic span, and combiners with memory
- Algebraic feedback shift registers
- On binary signed digit representations of integers
- Algebraic Shift Register Sequences
- An Efficient State Recovery Attack on X-FCSR-256
- Periodicity and Distribution Properties of Combined FCSR Sequences
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
- Breaking the F-FCSR-H Stream Cipher in Real Time
- Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
- A New Approach for FCSRs
- Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode
- Windmill Generators A generalization and an observation of how many there are
- Arithmetic crosscorrelations of feedback with carry shift register sequences
- 2-Adic shift registers
- Fibonacci and Galois representations of feedback-with-carry shift registers
- X-FCSR – A New Software Oriented Stream Cipher Based Upon FCSRs
- Galois LFSR, Embedded Devices and Side Channel Weaknesses
- Fast Software Encryption
