Finding Small Roots of Bivariate Integer Polynomial Equations Revisited (2004)

Cached

Download Links

by Jean-sébastien Coron
Venue:PROC. ADVANCES IN CRYPTOLOGY- EUROCRYPT’04, LNCS 3027
Citations:17 - 0 self

Documents Related by Co-Citation

178 Small solutions to polynomial equations, and low exponent RSA vulnerabilities – - 1997
114 Cryptanalysis of RSA with Private Key d Less Than N^0.292 – - 2000
700 Factoring polynomials with rational coefficients – - 1982
67 Finding a small root of a bivariate integer equation; factoring with high bits known – - 1996
66 Finding small roots of univariate modular equations revisited – - 1997
30 Finding small solutions to small degree polynomials
2928 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – - 1978
12 New Partial Key Exposure Attacks on – - 2003
9 NTL: A Library for doing Number Theory, online available at http:// www.shoup.net/ntl/index.html
40 Factoring N = p r q for large r – - 1999
89 Finding a small root of a univariate modular equation – - 1996
231 On Lovasz’ lattice reduction and the nearest lattice point problem – - 1986
22 Exposing an RSA Private Key Given a Small Fraction of its Bits – - 1998
16 Partial key exposure attacks on RSA up to full size exponents – - 2005
10 Number Theory C++ Library (NTL) version 5.4.1. Available at http://www.shoup.net/ntl
14 Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring – - 2004
16 A strategy for finding roots of multivariate polynomials with new applications in attacking rsa variants – - 2006
207 Riemann’s hypothesis and tests for primality – - 1976
42 An attack on RSA given a small fraction of the private key bits – - 1998