How to Factor N1 and N2 When p1=p2 mod 2t
暂无分享,去创建一个
[1] Steven D. Galbraith,et al. Mathematics of Public Key Cryptography , 2012 .
[2] Santanu Sarkar,et al. Approximate Integer Common Divisor Problem Relates to Implicit Factorization , 2011, IEEE Transactions on Information Theory.
[3] Alexander May,et al. Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint , 2009, Public Key Cryptography.
[4] Claude Crépeau,et al. Simple Backdoors for RSA Key Generation , 2003, CT-RSA.
[5] Carl D. Meyer,et al. Matrix Analysis and Applied Linear Algebra , 2000 .
[6] Moti Yung,et al. The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems , 1997, CRYPTO.
[7] A. K. Lenstra,et al. The Development of the Number Field Sieve , 1993 .
[8] Ueli Maurer,et al. Factoring with an Oracle , 1992, EUROCRYPT.
[9] H. W. Lenstra,et al. Factoring integers with elliptic curves , 1987 .
[10] Adi Shamir,et al. Efficient Factoring Based on Partial Information , 1985, EUROCRYPT.
[11] Carl Pomerance,et al. The Quadratic Sieve Factoring Algorithm , 1985, EUROCRYPT.
[12] H. Minkowski,et al. Geometrie der Zahlen , 1896 .