Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits

DOI10.1007/s10623-007-9112-3zbMath1196.11172OpenAlexW2039611463MaRDI QIDQ1009176

Álvar Ibeas, Jaime Gutierrez

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-007-9112-3

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (13)

Predicting the elliptic curve congruential generator ⋮ Pseudorandom numbers and hash functions from iterations of multivariate polynomials ⋮ Recovering zeros of polynomials modulo a prime ⋮ Inferring sequences produced by elliptic curve generators using Coppersmith's methods ⋮ Attacking the linear congruential generator on elliptic curves via lattice techniques ⋮ Reconstructing points of superelliptic curves over a prime finite field ⋮ Fixed points of the subset sum pseudorandom number generators ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences ⋮ On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators ⋮ On pseudorandom numbers from multivariate polynomial systems ⋮ Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods ⋮ Pseudorandom vector generation using elliptic curves and applications to Wiener processes

Uses Software

• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inferring sequences produced by a linear congruential generator missing low-order bits
• Factoring polynomials with rational coefficients
• Lattice reduction: a toolbox for the cryptoanalyst
• Geometric algorithms and combinatorial optimization.
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• On the Naor-Reingold pseudo-random function from elliptic curves
• On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Reconstructing noisy polynomial evaluation in residue rings
• Attacking the Pollard Generator
• Deciphering a linear congruential encryption
• Minkowski's Convex Body Theorem and Integer Programming
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Inferring sequences produced by pseudo-random number generators
• How to predict congruential generators
• Predicting nonlinear pseudorandom number generators
• Certain Exponential Sums and Random Walks on Elliptic Curves
• A sieve algorithm for the shortest lattice vector problem
• Advances in Cryptology - EUROCRYPT 2004
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Cryptography and Coding
• Cryptanalysis of the Quadratic Generator
• On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.

This page was built for publication: Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits