The Magic Words Are Squeamish Ossifrage (Extended Abstract)

by Derek Atkins , Michael Graff , Arjen K. Lenstra , Paul C. Leyland
Citations:2 - 0 self

Active Bibliography

1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
2 Integer Factoring – Arjen K. Lenstra - 2000
41 Parallel Algorithms for Integer Factorisation – Richard P. Brent
Computational Number Theory at CWI in 1970-1994 – H.J.J. te Riele, J. Van De Lune - 1994
8 Factoring Integers with the Self-Initializing Quadratic Sieve – Scott Patrick Contini - 1997
15 On the factorization of RSA-120 – T. Denny, B. Dodson, A. K. Lenstra, M. S. Manasse - 1994
21 Factorization of a 768-bit RSA modulus РThorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thom̩, Pierrick Gaudry, Peter L. Montgomery, Dag Arne Osvik, Herman Te Riele, Andrey Timofeev, Paul Zimmermann, et al. - 2010
20 Recent progress and prospects for integer factorisation algorithms – Richard P. Brent - 2000
17 Factorization of the tenth and eleventh Fermat numbers – Richard P. Brent - 1996
14 Improvements to the general number field sieve for discrete logarithms in prime fields – Antoine Joux, Reynald Lercier - 2003
7 An Introduction to the General Number Field Sieve – Matthew E. Briggs - 1998
32 Factorization of a 512-bit RSA modulus – S. Cavallar, W. M. Lioen, H. J. J. Te Riele, B. Dodson, A. K. Lenstra, P. L. Montgomery, B. Murphy Et Al - 2000
Factoring Integers With Large Prime Variations of the Quadratic Sieve – Henk Boender, Herman J. J. te Riele - 1995
MODULE: Data Security – Antonia J. Jones, Antonia J. Jones, Lecturer Antonia, J. Jones - 1996
Data Security - CM 0321 – Antonia J. Jones, Antonia J. Jones, Lecturer Antonia, J. Jones - 2001
8 Answers To Frequently Asked Questions About Today's Cryptography – Paul Fahn - 1993
unknown title – Foreword Whitfield Diffie
1 Computation of discrete logarithms in F2607 РEmmanuel Thom̩
72 Solving Large Sparse Linear Systems Over Finite Fields – B. A. Lamacchia, A. M. Odlyzko - 1991