Cryptographically Strong de Bruijn Sequences with Large Periods
From MaRDI portal
Publication:3455491
DOI10.1007/978-3-642-35999-6_8zbMath1327.94022OpenAlexW127787461MaRDI QIDQ3455491
Publication date: 4 December 2015
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35999-6_8
compositionsde Bruijn sequencespseudorandom sequence generatorsnonlinear feedback shift registersspan n sequences
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items
On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators ⋮ Stretching de Bruijn sequences ⋮ A relation between sequences generated by Golomb's preference algorithm ⋮ On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators ⋮ An interleaved method for constructing de Bruijn sequences ⋮ On the \(k\)-error linear complexities of De Bruijn sequences
Cites Work
- Unnamed Item
- A class of nonlinear de Bruijn cycles
- On the cycle structure of a set of nonlinear shift registers with symmetric feedback functions
- Characterizations of generators for modified de Bruijn sequences
- On the complexities of de-Bruijn sequences
- An efficient algorithm for the generation of DeBruijn cycles
- On the quadratic spans of DeBruijn sequences
- Construction of de Bruijn sequences of minimal complexity
- On the cycle structure of some nonlinear shift register sequences
- On the classification of balanced binary sequences of period<tex>2^n-1</tex>(Corresp.)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Cryptographic properties of the Welch-Gong transformation sequence generators
- Randomness and Representation of Span n Sequences
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
