Linearity properties of binary FCSR sequences
From MaRDI portal
Publication:735027
DOI10.1007/S10623-009-9280-4zbMath1173.94005OpenAlexW2017604775MaRDI QIDQ735027
Publication date: 14 October 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9280-4
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)
Related Items (3)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feedback shift registers, 2-adic span, and combiners with memory
- Breaking the F-FCSR-H Stream Cipher in Real Time
- Arithmetic crosscorrelations of feedback with carry shift register sequences
- 2-Adic shift registers
- A lower bound on the linear span of an FCSR
- Fibonacci and Galois representations of feedback-with-carry shift registers
- Partial period distribution of FCSR sequences
- Fast Software Encryption
- Autocorrelations of Maximum Period FCSR Sequences
This page was built for publication: Linearity properties of binary FCSR sequences