Enumeration results on linear complexity profiles and lattice profiles

DOI10.1016/J.JCO.2005.09.002zbMATH Open1140.94318OpenAlexW2042513007MaRDI QIDQ2489145FDOQ2489145

Authors: 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

Recommendations

• scientific article; zbMATH DE number 67080
• On the linear complexity of binary lattices
• scientific article; zbMATH DE number 1643917
• Enumeration results on the joint linear complexity of multisequences
• On linear complexity of binary lattices. II
• The complexity of functions on lattices
• Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
• A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences

zbMATH Keywords

Linear complexity profileMarsaglia's lattice testSequences over finite fieldsLattice profile

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Rational points on curves over finite fields. Theory and Applications
• Title not available (Why is that?)
• Linear complexity profiles and jump complexity
• Linear Complexity and Random Sequences
• Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles
• On distribution properties of sequences with perfect linear complexity profile
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Progress in Cryptology - INDOCRYPT 2003
• The Probabilistic Theory of Linear Complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lattice structure and linear complexity of nonlinear pseudorandom numbers
• Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
• Counting functions and expected values for the lattice profile at \(n\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• The Successive Minima Profile of Multisequences
• Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
• On the counting function of the lattice profile of periodic sequences
• Title not available (Why is that?)
• Counting functions and expected values for the lattice profile at \(n\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489145)