A generalized birthday approach for efficiently finding linear relations in -sequences
From MaRDI portal
Publication:488250
DOI10.1007/S10623-013-9845-0zbMATH Open1351.94070OpenAlexW1984434872WikidataQ62041906 ScholiaQ62041906MaRDI QIDQ488250FDOQ488250
Authors: Paul Stankovski, Thomas Johansson, Hui Wang 
Publication date: 23 January 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9845-0
Recommendations
Cites Work
- Title not available (Why is that?)
- Feedback shift registers, 2-adic span, and combiners with memory
- Arithmetic crosscorrelations of feedback with carry shift register sequences
- Title not available (Why is that?)
- 2-Adic shift registers
- Fibonacci and Galois representations of feedback-with-carry shift registers
- Cuckoo hashing
- Title not available (Why is that?)
- Title not available (Why is that?)
- A matrix approach for FCSR automata
- Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time
- An overview of distinguishing attacks on stream ciphers
- A new approach for FCSRs
- 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
Uses Software
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)
