Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness

DOI10.1007/978-3-662-49387-8_3zbMath1353.94034OpenAlexW2293265114MaRDI QIDQ2798793

Adrian Thillard, Céline Chevalier, Fabrice Benhamouda, Damien Vergnaud

Publication date: 13 April 2016

Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49387-8_3

zbMATH Keywords

cryptanalysispseudorandom generatorsanalytic combinatoricsCoppersmith methodsRSA key generationencryption padding

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Attacks on pseudo random number generators hiding a linear structure ⋮ Inferring sequences produced by elliptic curve generators using Coppersmith's methods ⋮ Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods

This page was built for publication: Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness