Constructing de Bruijn sequences based on a new necessary condition
From MaRDI portal
Publication:4983540
Recommendations
- An interleaved method for constructing de Bruijn sequences
- Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
- Cryptographically Strong de Bruijn Sequences with Large Periods
- Construction for de Bruijn sequences with large stage
Cites work
- A Class of de Bruijn Sequences
- A method for constructing decodable de Bruijn sequences
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Advances in Cryptology - CRYPTO 2003
- Algorithms for the generation of full-length shift- register sequences
- Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
- Fast correlation attacks on certain stream ciphers
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- Improved fast correlation attacts using parity-check equations of weight 4 and 5
- New stream cipher designs. The eSTREAM finalists
- On the nonlinearity of maximum-length NFSR feedbacks
- The combinatorics of N. G. de Bruijn
Cited in
(5)- Constructing de Bruijn sequences by concatenating smaller universal cycles
- An interleaved method for constructing de Bruijn sequences
- Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
- Possible values for the nonlinearity of de Bruijn feedback functions
- Distribution of linear and second-highest degree parts of maximum-length feedback functions
This page was built for publication: Constructing de Bruijn sequences based on a new necessary condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4983540)