Parallel Generation of ℓ-Sequences
From MaRDI portal
Publication:3600451
DOI10.1007/978-3-540-85912-3_27zbMath1206.94039OpenAlexW1536576835MaRDI QIDQ3600451
Publication date: 10 February 2009
Published in: Sequences and Their Applications - SETA 2008 (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/1956/
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis and design of stream ciphers
- Feedback shift registers, 2-adic span, and combiners with memory
- Algebraic Shift Register Sequences
- Linear Recurring Sequences
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- Shift Register Sequences – A Retrospective Account
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
- Further Results on the Distinctness of Decimations of$l$-Sequences
- Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
- Linear Ciphers and Random Sequence Generators with Multiple Clocks
- When Shift Registers Clock Themselves
- Windmill Generators A generalization and an observation of how many there are
- Bounds to Complexities of Networks for Sorting and for Switching
- An analysis of the structure and complexity of nonlinear binary sequence generators
- Arithmetic crosscorrelations of feedback with carry shift register sequences
- 2-Adic shift registers
- On Decimations of $\ell$-Sequences
- Fibonacci and Galois representations of feedback-with-carry shift registers
- Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers
- Two Algebraic Attacks Against the F-FCSRs Using the IV Mode
- Fast Software Encryption
- Shift-register synthesis and BCH decoding
- High Speed Generation of Maximal Length Sequences
This page was built for publication: Parallel Generation of ℓ-Sequences
