Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods
From MaRDI portal
Publication:2817871
DOI10.1007/978-3-319-42634-1_24zbMath1394.94937OpenAlexW2501021435MaRDI QIDQ2817871
Publication date: 2 September 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01381658/file/inferring%20LCG%20final%20version%20cocoon.pdf
Related Items (2)
Inferring sequences produced by elliptic curve generators using Coppersmith's methods ⋮ Attacking the linear congruential generator on elliptic curves via lattice techniques
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
- Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness
- Finding a Small Root of a Univariate Modular Equation
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
This page was built for publication: Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods