Enumeration results on linear complexity profiles and lattice profiles

DOI10.1016/j.jco.2005.09.002zbMath1140.94318OpenAlexW2042513007MaRDI QIDQ2489145

Wilfried Meidl

Publication date: 16 May 2006

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2005.09.002

zbMATH Keywords

Linear complexity profileMarsaglia's lattice testSequences over finite fieldsLattice profile

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Data encryption (aspects in computer science) (68P25) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (1)

Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear complexity profiles and jump complexity
• On distribution properties of sequences with perfect linear complexity profile
• Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles
• Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
• Lattice structure and linear complexity of nonlinear pseudorandom numbers
• Counting functions and expected values for the lattice profile at \(n\)
• Linear Complexity and Random Sequences
• The Probabilistic Theory of Linear Complexity
• Progress in Cryptology - INDOCRYPT 2003

This page was built for publication: Enumeration results on linear complexity profiles and lattice profiles