Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods

DOI10.1007/978-3-642-30057-8_36zbMath1291.11137OpenAlexW187982259MaRDI QIDQ2900247

Damien Vergnaud, Aurélie Bauer, 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

LLL algorithmEuclidean latticenonlinear pseudorandom number generatorsCoppersmith's techniquesunravelled linearization

Mathematics Subject Classification ID

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

Related Items (9)

Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator ⋮ Inferring sequences produced by elliptic curve generators using Coppersmith's methods ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ Inferring sequences produced by the quadratic generator ⋮ Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited ⋮ Cryptanalysis of elliptic curve hidden number problem from PKC 2017 ⋮ Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods

This page was built for publication: Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods