On the public citation graph

Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers

0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/ffta.1995.1009openalex-snapshot
The Period Lengths of Inversive Pseudorandom Vector Generations
inferredcites →https://doi.org/10.1006/ffta.1999.0257openalex-snapshot
On the Distribution and Lattice Structure of Nonlinear Congruential Pseudorandom Numbers
inferredcites →https://doi.org/10.1006/jcta.1996.0088openalex-snapshot
Permutation Polynomials, de Bruijn Sequences, and Linear Complexity
inferredcites →https://doi.org/10.1007/978-1-4612-1690-2_4openalex-snapshot
A survey of quadratic and inversive congruential pseudorandom numbers
inferredcites →https://doi.org/10.1007/978-1-4612-2552-2_10openalex-snapshot
On the lattice test for inversive congruential pseudorandom numbers
inferredcites →https://doi.org/10.1007/978-1-4612-2552-2_5openalex-snapshot
New Developments in Uniform Pseudorandom Number and Vector Generation
inferredcites →https://doi.org/10.1007/978-3-0348-8664-2openalex-snapshot
Number theoretic methods in cryptography : complexity lower bounds
inferredcites →https://doi.org/10.1007/978-3-642-56046-0_6openalex-snapshot
Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators
inferredcites →https://doi.org/10.1007/978-3-642-59435-9_18openalex-snapshot
Linear Complexity and Polynomial Degree of a Function Over a Finite Field
inferredcites →https://doi.org/10.1007/bf02613312openalex-snapshot
Marsaglia’s lattice test and non-linear congruential pseudo random number generators
inferredcites →https://doi.org/10.1007/s00200-002-0104-2openalex-snapshot
A Polynomial Representation of the Diffie-Hellman Mapping
inferredcites →https://doi.org/10.1007/s002000100074openalex-snapshot
On the Lattice Structure of Pseudorandom Numbers Generated over Arbitrary Finite Fields
inferredcites →https://doi.org/10.1007/s006050050004openalex-snapshot
On the Multidimensional Distribution of Inversive Congruential Pseudorandom Numbers in Parts of the Period
inferredcites →https://doi.org/10.1016/b978-0-12-775950-0.50013-3openalex-snapshot
The Structure of Linear Congruential Sequences
inferredcites →https://doi.org/10.1016/s0924-6509(98)x8001-3openalex-snapshot
Stream Ciphers and Number Theory
inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1109/18.959261openalex-snapshot
Lower bounds on the linear complexity of the discrete logarithm in finite fields
inferredcites →https://doi.org/10.1145/175007.175015openalex-snapshot
Pseudorandom vector generation by the inversive method
inferredcites →https://doi.org/10.1145/200883.200896openalex-snapshot
Digital inversive pseudorandom numbers
inferredcites →https://doi.org/10.2307/2290359openalex-snapshot
Random Number Generation and Quasi-Monte Carlo Methods.
inferredcites →https://doi.org/10.4064/aa-47-3-255-261openalex-snapshot
A polynomial representation for logarithms in GF(q)
inferredcites →https://doi.org/10.4064/aa-93-4-387-399openalex-snapshot
Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11423461_19openalex-snapshot
On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-55357-3_15openalex-snapshot
Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure
inferred← citeshttps://doi.org/10.1007/978-3-540-24582-7_1openalex-snapshot
Linear Complexity and Related Complexity Measures for Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_6openalex-snapshot
Lattice Profile and Linear Complexity Profile of Pseudorandom Number Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-77224-8_25openalex-snapshot
On the Structure of Inversive Pseudorandom Number Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-13797-6_6openalex-snapshot
Structure of Pseudorandom Numbers Derived from Fermat Quotients
inferred← citeshttps://doi.org/10.1007/978-3-642-15874-2_9openalex-snapshot
Recent Results on Recursive Nonlinear Pseudorandom Number Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-18743-8_11openalex-snapshot
Lattice Structure of Nonlinear Pseudorandom Number Generators in Parts of the Period
inferred← citeshttps://doi.org/10.1007/978-3-642-38519-3_20openalex-snapshot
New Sequences of Period p n and p n + 1 via Projective Linear Groups
inferred← citeshttps://doi.org/10.1007/s00200-003-0116-6openalex-snapshot
Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number Generators
inferred← citeshttps://doi.org/10.1007/s00200-005-0181-0openalex-snapshot
On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
inferred← citeshttps://doi.org/10.1007/s00200-006-0195-2openalex-snapshot
Continued fraction for formal laurent series and the lattice structure of sequences
inferred← citeshttps://doi.org/10.1007/s10998-014-0021-8openalex-snapshot
On lattice profile of the elliptic curve linear congruential generators
inferred← citeshttps://doi.org/10.1007/s11767-005-0049-2openalex-snapshot
Generators by the quadratic exponential method
inferred← citeshttps://doi.org/10.1007/s11859-008-0513-6openalex-snapshot
On k-error linear complexity of some explicit nonlinear pseudorandom sequences
inferred← citeshttps://doi.org/10.1007/s12095-007-0001-4openalex-snapshot
Joint linear complexity of multisequences consisting of linear recurring sequences
inferred← citeshttps://doi.org/10.1016/j.ffa.2004.01.004openalex-snapshot
Counting functions and expected values for the lattice profile at n
inferred← citeshttps://doi.org/10.1016/j.ffa.2007.08.002openalex-snapshot
Finite binary sequences constructed by explicit inversive methods
inferred← citeshttps://doi.org/10.1016/j.jco.2003.08.017openalex-snapshot
On the linear complexity profile of some new explicit inversive pseudorandom numbers
inferred← citeshttps://doi.org/10.1016/j.jco.2005.09.002openalex-snapshot
Enumeration results on linear complexity profiles and lattice profiles
inferred← citeshttps://doi.org/10.1016/j.jco.2006.05.006openalex-snapshot
On the counting function of the lattice profile of periodic sequences
inferred← citeshttps://doi.org/10.1016/j.jco.2007.07.001openalex-snapshot
Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
inferred← citeshttps://doi.org/10.1016/j.jco.2009.07.001openalex-snapshot
On the structure of digital explicit nonlinear and inversive pseudorandom number generators
inferred← citeshttps://doi.org/10.1017/cbo9781139696456.006openalex-snapshot
On the linear complexity and lattice test of nonlinear pseudorandom number generators
inferred← citeshttps://doi.org/10.1109/tit.2002.806144openalex-snapshot
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.