Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods

DOI10.1007/978-3-319-42634-1_24MaRDI QIDQ2817871zbMATHOpenAlexFDO

Authors Thierry Mefenza

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

zbMATH Keywords

elliptic curveslattice reductionCoppersmith's methodselliptic curve linear congruential generator

Mathematics Subject Classification ID

Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)

Recommendations

• Inferring sequences produced by elliptic curve generators using Coppersmith's methods
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• On the linear complexity profile of some sequences derived from elliptic curves
• On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
• On lattice profile of the elliptic curve linear congruential generators
• Sequences generated by elliptic curves
• On the linear complexity of the Naor-Reingold sequence with elliptic curves
• Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods
• Predicting the elliptic curve congruential generator
• Attacking the linear congruential generator on elliptic curves via lattice techniques

Cites work

• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 1972840 (Why is no real title available?)
• scientific article; zbMATH DE number 1972846 (Why is no real title available?)
• scientific article; zbMATH DE number 1866860 (Why is no real title available?)
• scientific article; zbMATH DE number 1440879 (Why is no real title available?)
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Analytic combinatorics
• Easing Coppersmith methods using analytic combinatorics: applications to public-key cryptography with weak pseudorandomness
• Finding a small root of a bivariate integer equation; factoring with high bits known
• Finding a small root of a univariate modular equation
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods
• On the linear complexity and multidimensional distribution of congruential generators over elliptic curves

Cited in

(5)

• Predicting the elliptic curve congruential generator
• Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods
• Inferring sequences produced by elliptic curve generators using Coppersmith's methods
• Attacking the linear congruential generator on elliptic curves via lattice techniques
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits

This page was built for publication: Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods

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