A note on the bivariate Coppersmith theorem

DOI10.1007/s00145-012-9121-xzbMath1330.11078OpenAlexW2093762739MaRDI QIDQ2377067

Jean-Sébastien Coron, Mehdi Tibouchi, Alexey Kirichenko

Publication date: 27 June 2013

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-012-9121-x

zbMATH Keywords

bivariate polynomialssmall rootsCopppersmith's theorem

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (3)

Toward RSA-OAEP Without Random Oracles ⋮ Trapdoor DDH groups from pairings and isogenies ⋮ Instantiability of classical random-oracle-model encryption transforms

Cites Work

• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• Advances in Cryptology - EUROCRYPT 2004

This page was built for publication: A note on the bivariate Coppersmith theorem