Approximate Integer Common Divisors
暂无分享,去创建一个
[1] Dan Boneh,et al. TWENTY YEARS OF ATTACKS ON THE RSA CRYPTOSYSTEM , 1999 .
[2] Tatsuaki Okamoto. Fast public-key cryptosystem using congruent polynomial equations , 1986 .
[3] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[4] Dan Boneh,et al. Cryptanalysis of RSA with private key d less than N0.292 , 2000, IEEE Trans. Inf. Theory.
[5] Dan Boneh,et al. An Attack on RSA Given a Small Fraction of the Private Key Bits , 1998, ASIACRYPT.
[6] Jeffrey Shallit,et al. Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.
[7] Don Coppersmith,et al. Finding a Small Root of a Univariate Modular Equation , 1996, EUROCRYPT.
[8] D. Boneh,et al. Factoring N = pr q for large r , 1999 .
[9] Nicholas A. Howgrave-Graham. Computational mathematics inspired by RSA , 1998 .
[10] Dan Boneh,et al. Factoring N = prq for Large r , 1999, CRYPTO.
[11] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .
[12] Michael J. Wiener,et al. Cryptanalysis of Short RSA Secret Exponents (Abstract) , 1990, EUROCRYPT.
[13] Leonard M. Adleman,et al. NP-Complete Decision Problems for Binary Quadratics , 1978, J. Comput. Syst. Sci..
[14] Jacques Stern,et al. Lattice Reduction in Cryptology: An Update , 2000, ANTS.
[15] A. K. Lenstra,et al. Factoring polynomials with integer coefficients , 1982 .
[16] Brigitte Vallée,et al. How to Break Okamoto's Cryptosystem by Reducing Lattice Bases , 1988, EUROCRYPT.
[17] C. P. Schnorr,et al. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..
[18] D. Boneh. Cryptanalysis of RSA with Private Key d Less Than N 0 , 1999 .