A generalized birthday approach for efficiently finding linear relations in -sequences
From MaRDI portal
(Redirected from Publication:488250)
A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences
A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences
Recommendations
Cites work
- scientific article; zbMATH DE number 46531 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- 2-Adic shift registers
- A matrix approach for FCSR automata
- A new approach for FCSRs
- An overview of distinguishing attacks on stream ciphers
- Arithmetic crosscorrelations of feedback with carry shift register sequences
- Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time
- Cuckoo hashing
- Feedback shift registers, 2-adic span, and combiners with memory
- Fibonacci and Galois representations of feedback-with-carry shift registers
- Linearity properties of binary FCSR sequences
Cited in
(4)- Breaking the F-FCSR-H Stream Cipher in Real Time
- On the probability distribution of the carry cells of stream ciphers F-FCSR-H v2 and F-FCSR-H v3
- 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
This page was built for publication: A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488250)