References
- Information and Communications Security, Lecture Notes in Computer Science v.1334 A new and optimal chosenmessage attack on RSA-type cryptosystems D. Bleichenbacher;M. Joye;J.-J. Quisquater;Y. Han(ed.);T. Okamoto(ed.);S. Qing(ed.)
- Advances in Cryptology - Eurocrypt '96 , Lecture Notes in Computer Science v.1070 Finding a small root of a bivariate integer equation: factoring with high bits known D. Coppersmith;U. Maurer(ed.)
- Eurocypt'96 Lecture Notes in Computer Science v.1070 Finding a small root of a univariate modular equation. Advances in Cryptology D. Coppersmith;U. Maurer(ed.)
- Eurocypt'96 Lecture Notes in Computer Science v.1070 Low exponent RSA with related messages D. Coppersmith;M. Franklin;J. Patarin;M. Reiter;U. Maurer(ed.)
- Tech. Report TR-CS-82-2. Chosen signature cryptanalysis of the RSA (MIT) public key cryptosystem G. Davida
- Crypto '93 On the Factorization of RSA-120 T. Denny;B. Dodson;A.K. Lenstra;M.S. Manasse
- IEEE Transaction on Information Theory IT- v.26 no.6 New diractions in cryptography W. Diffie;M. E. Hellman
- Euro Crypt '93 Factoring Integers Using SIMD Sieves Brandon Dixon;Arjen K. Lenstra
- Advances in Cryptology - Eurocrypt '97, Lecture Notes in Computer Science v.1233 Selective forgery of RSA signatures using redundancy M. Girault;J.-F. Misarsky;W. Fumy(ed))
- Advances in Cryptology - Eurocrypt '85, Lecture Notes in Computer Science v.218 On using RSA with low exponent in a public key network, Advance in Cryptology J. Hastad;H. C. Williams(ed.)
- Euro Cypt '91 Some Considerations concerning the Selection of RSA Moduli Klaus Huber
- Advances in Cryptology - Eurocrypt '85, Lecture Notes in Computer Science v.218 Attacks on some RSA signatures W. de Jonge;D. Chaum;H. C. Williams(ed.)
- Advances in Cryptology - Eurocrypt '86, Lecture Notes in Computer Science v.263 Some variations on RSA signatures & their security W. de Jonge;D. Chaum
- Tech. Report CG-1996/10 Common modulus attack against Lucas-based sryptosystem M. Joye
- Proc. of the 4th ACM Conference on Computer and Communications Security On the importance of securing your bins: The garbage-man-in-the-middle attack M. Joye;T. Matsumoto(ed.)
- Tech. Report CG-1997/3 Takagi/Naito's algorithm revisited M. Joye
- Graduate Texts in Mathematics v.114 A course in number theory and cryptography(2nd ed.) N. Koblitz
- The art of computer programming: volume 2.seminumerical algorithms(2nd ed.) D. E. Knuth
- Euro Cypt '90 Factoring with two large primes Arjen K. Lenstra
- Euro Cypt '89 Factoring by electronic mail Arjen K. Lenstra;Mark S. Manasse
- Handbook of applioed cryptography A. Menezes;P. Oorschot;S. Vanstone
- Math.Comp. v.29 A method of factoring and factorization of F7 M. A. Morrison;J. Brillhart
- Proc of the 1985 Symposium on Security and Privacy A fast signature scheme based on quadratic inequalities T. Okamoto;A. Shiraishi
- BIT v.16 A Monte Carlo Method for Factorization J. M. Pollard
- Proceeding of the Cambridge Philosophical Society v.76 Theorems on factorizatin and primality testing J. M. Pollard
- Math. Centrum v.154 Analysis and comparison of some integer factoring algorithm, in Computational Method in Computational Methods in Number Theory C. Pomerance;H.W. Lenstra, Jr(ed.);R. Tijdeman(ed.)
- Euro Crypt '84. The Quadratic Sieve Factoring Algorithm C. Pomerance
- Comunications of the ACM v.21 no.2 A method for obtaining digital signatures and public-key cryptosystems L. Rivest;A. Shamir;L. Adleman
- Applied cryptography: protocols, algorithms, and source code in C(2nd ed.) B. Schneier
- Math.Comp v.84 The multiple polynomial quadratic sieve R.D. Silverman
- Cryptopogia v.1 Prelininary comments on the M.I.T. public-key cryptosystem G. J. Simmons;M. J. Norris
- Euro Crypt '89 Cryptanalysis of Short RSA Secret Exponents Michael J. Wiener