scientific article; zbMATH DE number 4050837
From MaRDI portal
Publication:3787343
Recommendations
Cited in
(14)- Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
- Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
- Computation of edit probabilities and edit distances for the A5-type keystream generator
- Shrinking generators and statistical leakage
- New classes of perfect maps. I
- Shrinking generators based on \(\sigma \)-LFSRs
- Modified alternating step generators with non-linear scrambler
- Applied Cryptography and Network Security
- On black-box optimization in divide-and-conquer SAT solving
- Finding Effective SAT Partitionings Via Black-Box Optimization
- The main-controlled generator
- Reduced Complexity Attacks on the Alternating Step Generator
- Developments in secure random number generators
- A simple attack on some clock-controlled generators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787343)