On lattice profile of the elliptic curve linear congruential generators
From MaRDI portal
Publication:2453814
Recently a new lattice test was introduced by \textit{H. Niederreiter} and \textit{A. Winterhof} [Appl. Algebra Eng. Commun. Comput. 13, No. 4, 319--326 (2002; Zbl 1033.11038)]. In the present paper the behavior of linear congruential generators on elliptic curves under this new test is analyzed. Furthermore, lower bounds for the linear complexity profile of related binary sequences are established.
Recommendations
- On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
- On the lattices from elliptic curves over finite fields
- On a Linnik problem for elliptic curves
- scientific article; zbMATH DE number 1972846
- Lattices from elliptic curves over finite fields
- scientific article; zbMATH DE number 6382357
- On some congruence properties of elliptic curves
- scientific article; zbMATH DE number 4177267
- The association of lattices and elliptic curves
- scientific article; zbMATH DE number 4183505
Cites work
- Algebraic Function Fields and Codes
- Construction of large families of pseudorandom binary sequences
- Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm
- Construction of pseudorandom binary lattices using elliptic curves
- Constructions of pseudorandom binary lattices
- Counting functions and expected values for the lattice profile at \(n\)
- Elliptic curve analogue of Legendre sequences
- Elliptic curves and their applications to cryptography. An introduction
- scientific article; zbMATH DE number 2127885 (Why is no real title available?)
- scientific article; zbMATH DE number 5529048 (Why is no real title available?)
- scientific article; zbMATH DE number 2051216 (Why is no real title available?)
- scientific article; zbMATH DE number 2124952 (Why is no real title available?)
- scientific article; zbMATH DE number 1440879 (Why is no real title available?)
- scientific article; zbMATH DE number 3420163 (Why is no real title available?)
- Lattice reduction: a toolbox for the cryptoanalyst
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- Linear complexity profile of binary sequences with small correlation measure
- O'NAN GROUP UNIQUELY DETERMINED BY THE CENTRALIZER OF A 2-CENTRAL INVOLUTION
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
- On the linear complexity of the Naor-Reingold sequence with elliptic curves
- On the Naor-Reingold pseudo-random function from elliptic curves
- On the structure of digital explicit nonlinear and inversive pseudorandom number generators
- On the Structure of Inversive Pseudorandom Number Generators
Cited in
(5)- Predicting the elliptic curve congruential generator
- Attacking the linear congruential generator on elliptic curves via lattice techniques
- Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods
- scientific article; zbMATH DE number 1972846 (Why is no real title available?)
- On the lattice structure of pseudorandom numbers generated over arbitrary finite fields
This page was built for publication: On lattice profile of the elliptic curve linear congruential generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453814)
