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

DOI10.1016/J.JCO.2003.08.017MaRDI QIDQ1827574zbMATH OpenOpenAlexFDO

Authors 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

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
• On the distribution of some new explicit inverse pseudorandom numbers and vectors
• On the structure of digital explicit nonlinear and inversive pseudorandom number generators
• Explicit inversive congruential pseudorandom numbers: The compound approach
• On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
• On the Structure of Inversive Pseudorandom Number Generators
• scientific article; zbMATH DE number 1424198
• On the linear complexity and lattice test of nonlinear pseudorandom number generators
• scientific article; zbMATH DE number 5174819

Cites work

• scientific article; zbMATH DE number 3924676 (Why is no real title available?)
• scientific article; zbMATH DE number 53679 (Why is no real title available?)
• scientific article; zbMATH DE number 54007 (Why is no real title available?)
• scientific article; zbMATH DE number 1196713 (Why is no real title available?)
• scientific article; zbMATH DE number 1740058 (Why is no real title available?)
• scientific article; zbMATH DE number 1103061 (Why is no real title available?)
• scientific article; zbMATH DE number 1114507 (Why is no real title available?)
• scientific article; zbMATH DE number 1790427 (Why is no real title available?)
• scientific article; zbMATH DE number 204179 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 822306 (Why is no real title available?)
• A Generalization of a Congruential Property of Lucas
• Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
• Lattice structure and linear complexity of nonlinear pseudorandom numbers
• Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
• Linear Complexity and Random Sequences
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• Shift-register synthesis and BCH decoding
• Statistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers

Cited in

(15)

• On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\)
• Weil Sums over Small Subgroups
• Finite length sequences with large nonlinear complexity
• On the Structure of Inversive Pseudorandom Number Generators
• On the linear complexity of bounded integer sequences over different moduli
• scientific article; zbMATH DE number 2124952 (Why is no real title available?)
• On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
• Multisequences with high joint nonlinear complexity
• On the joint linear complexity profile of explicit inversive multisequences
• On \(k\)-error linear complexity of some explicit nonlinear pseudorandom sequences
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• On the \(k\)-error linear complexity of sequences from function fields
• On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
• Finite binary sequences constructed by explicit inversive methods
• Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration

This page was built for publication: On the linear complexity profile of some new explicit inversive pseudorandom numbers

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