Factorization of RSA-140 Using the Number Field Sieve (1999)
by
S. Cavallar
,
B. Dodson
,
A. K. Lenstra
,
P. Leyland
,
W. M. Lioen
,
P. L. Montgomery
,
B. Murphy
,
H. J. J. Te Riele
,
P. Zimmermann
| Venue: | IN ADVANCES IN CRYPTOLOGY, ASIACRYPT’99 |
| Citations: | 7 - 1 self |
BibTeX
@INPROCEEDINGS{Cavallar99factorizationof,
author = {S. Cavallar and B. Dodson and A. K. Lenstra and P. Leyland and W. M. Lioen and P. L. Montgomery and B. Murphy and H. J. J. Te Riele and P. Zimmermann},
title = {Factorization of RSA-140 Using the Number Field Sieve},
booktitle = {IN ADVANCES IN CRYPTOLOGY, ASIACRYPT’99},
year = {1999},
pages = {195--207},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 51 | Factoring Integers With The Number Field Sieve - Buhler, Lenstra, et al. - 1993 |
| 26 | Implementation of a new primality test - Cohen, Lenstra - 1987 |
| 11 | Strategies in filtering in the number field sieve - Cavallar - 2000 |
| 7 | Primality proving with cyclotomy - Bosma, Hulst - 1990 |
| 5 | Jörg Zayer. A world wide number field sieve factoring record: on to 512 bits - Cowie, Dodson, et al. - 1996 |
| 1 | On the factorization of RSA - Denny, Dodson, et al. |
