Linearity properties of binary FCSR sequences
From MaRDI portal
Recommendations
- On the linear complexity of FCSR sequences
- Periods of termwise exclusive ors of maximal length FCSR sequences
- scientific article; zbMATH DE number 5529045
- On the linear complexity of nonlinearly filtered pn-sequences
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
Cites work
- scientific article; zbMATH DE number 3565926 (Why is no real title available?)
- scientific article; zbMATH DE number 1030997 (Why is no real title available?)
- scientific article; zbMATH DE number 1942441 (Why is no real title available?)
- 2-Adic shift registers
- A lower bound on the linear span of an FCSR
- Arithmetic crosscorrelations of feedback with carry shift register sequences
- Autocorrelations of Maximum Period FCSR Sequences
- Breaking the F-FCSR-H Stream Cipher in Real Time
- Fast Software Encryption
- Feedback shift registers, 2-adic span, and combiners with memory
- Fibonacci and Galois representations of feedback-with-carry shift registers
- Improved fast correlation attacts using parity-check equations of weight 4 and 5
- Partial period distribution of FCSR sequences
Cited in
(7)- On the linear complexity of FCSR sequences
- Investigating some special sequence lengths generated in an external exclusive-NOR type LFSR
- Distribution properties of half-\(\ell \)-sequence
- Fast construction of binary ring FCSRs for hardware stream ciphers
- Clock-Controlled FCSR Sequence with Large Linear Complexity
- Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications
- A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences
This page was built for publication: Linearity properties of binary FCSR sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735027)
