Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods

DOI10.1007/978-3-642-30057-8_36MaRDI QIDQ2900247zbMATH OpenOpenAlexFDO

Authors Aurélie Bauer, Damien Vergnaud, Jean-Christophe Zapalowicz

Publication date 20 July 2012

Published in Public Key Cryptography – PKC 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30057-8_36

zbMATH Keywords

Coppersmith's techniquesEuclidean latticeLLL algorithmnonlinear pseudorandom number generatorsunravelled linearization

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Inferring sequences produced by elliptic curve generators using Coppersmith's methods
• Inferring sequences produced by pseudo-random number generators
• Inferring sequences produced by the quadratic generator
• Predicting nonlinear pseudorandom number generators
• Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods

Cited in

(14)

• Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
• Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
• Small CRT-exponent RSA revisited
• Attacks on pseudo random number generators hiding a linear structure
• Inferring sequences produced by elliptic curve generators using Coppersmith's methods
• Cryptanalysis of elliptic curve hidden number problem from PKC 2017
• Easing Coppersmith methods using analytic combinatorics: applications to public-key cryptography with weak pseudorandomness
• Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods
• Attacking power generators using unravelled linearization: when do we output too much?
• Inferring sequences produced by pseudo-random number generators
• Small CRT-Exponent RSA Revisited
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
• Inferring sequences produced by the quadratic generator
• Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves

This page was built for publication: Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods

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