On the linear complexity profile of some new explicit inversive pseudorandom numbers

DOI10.1016/j.jco.2003.08.017zbMath1045.94011OpenAlexW1978677317MaRDI QIDQ1827574

Wilfried Meidl, Arne Winterhof

Publication date: 6 August 2004

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

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

zbMATH Keywords

Linear complexity profileInversive generatorsNonlinear pseudorandom number generatorsSequences 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)

Related Items

On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\) ⋮ Multisequences with high joint nonlinear complexity ⋮ Weil Sums over Small Subgroups ⋮ ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS ⋮ On the Structure of Inversive Pseudorandom Number Generators ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ On the joint linear complexity profile of explicit inversive multisequences ⋮ Finite length sequences with large nonlinear complexity ⋮ On k-error linear complexity of some explicit nonlinear pseudorandom sequences ⋮ On the linear complexity of bounded integer sequences over different moduli ⋮ On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders ⋮ Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• Lattice structure and linear complexity of nonlinear pseudorandom numbers
• Linear Complexity and Random Sequences
• A Generalization of a Congruential Property of Lucas
• Statistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers
• Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
• Shift-register synthesis and BCH decoding