Counting functions and expected values for the lattice profile at \(n\)

DOI10.1016/j.ffa.2004.01.004zbMath1077.11056OpenAlexW2077163810MaRDI QIDQ2566959

Wilfried Meidl, Arne Winterhof, Gerhard Dorfer

Publication date: 29 September 2005

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2004.01.004

zbMATH Keywords

linear complexityMarsaglia's lattice testsequences over finite fields

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (12)

Pseudorandom sequences derived from automatic sequences ⋮ On the structure of digital explicit nonlinear and inversive pseudorandom number generators ⋮ On the pseudorandomness of automatic sequences ⋮ On the Structure of Inversive Pseudorandom Number Generators ⋮ On lattice profile of the elliptic curve linear congruential generators ⋮ On the counting function of the lattice profile of periodic sequences ⋮ On the \(N\)th linear complexity of automatic sequences ⋮ Perfect linear complexity profile and apwenian sequences ⋮ Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences ⋮ Enumeration results on linear complexity profiles and lattice profiles ⋮ Continued fraction for formal Laurent series and the lattice structure of sequences ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences

Cites Work

• Analysis and design of stream ciphers
• Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
• Counting functions and expected values for the \(k\)-error linear complexity
• Lattice structure and linear complexity of nonlinear pseudorandom numbers
• The Probabilistic Theory of Linear Complexity
• Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
• Shift-register synthesis and BCH decoding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting functions and expected values for the lattice profile at \(n\)