Searching for "Factorization of a 512-Bit RSA Modulus." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

7 documents found, showing 1 through 7.

Factorization of a 512-bit RSA modulus
by S. Cavallar, W. M. Lioen, H. J. J. Te Riele, B. Dodson, A. K. Lenstra, P. L. Montgomery, B. Murphy Et Al, Mathematisch Centrum (smc, The Dutch Foundation, Stefania Cavallar, Walter Lioen, Herman Te Riele, Bruce Dodson, Arjen K. Lenstra, Peter L. Montgomery, Brian Murphy, Karen Aardal, Je Gilchrist, Gerard Guillerm — 2000 — Proceedings of Eurocrypt '2000
…Factorization of a 512--bit RSA Modulus Centrum voor Wiskunde en Informatica REPORTRAPPORT S…
Cited by 16 (3 self) – Add To MetaCart

Security Estimates for $12-bit
by Robshaw Rsa Laboratories, M. J. B. Robshaw
… of MIPS-years (abbreviated to MY) required to factor a 512-bit RSA modulus is roughly 3 x 104 [3…
Add To MetaCart

Factorization of RSA-140 Using the Number Field Sieve
by S. Cavallar, B. Dodson, A. K. Lenstra, P. Leyl, W. M. Lioen, P. L. Montgomery, B. Murphy, H. J. J. Te Riele, P. Zimmermann, Stefania Cavallar, Walter Lioen, Herman Te Riele, Bruce Dodson, Arjen Lenstra, Paul Leyland, Peter L. Montgomery, Brian Murphy, Paul Zimmermann — 1999 — In Advances in Cryptology, Asiacrypt’99
… Challenge list [23]. In Sect. 2 we estimate how far we are now from factoring a 512–bit RSA modulus. In Sect…
Cited by 7 (1 self) – Add To MetaCart

A kilobit special number field sieve factorization
by Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik — 2007 — In Advances in Cryptology – ASIACRYPT 2007 (2007), LNCS
…, and quantify this remark, note that the first published factorization of a 512-bit RSA modulus is less than a…
Cited by 2 (0 self) – Add To MetaCart

The Magic Words Are Squeamish Ossifrage (Extended Abstract)
by Derek Atkins, Michael Graff, Arjen K. Lenstra, Paul C. Leyland
… that factoring a 512-bit RSA modulus using our current QS-implementation can probably not be done in less than…
Cited by 1 (0 self) – Add To MetaCart

Unbelievable Security: Matching AES security using public key systems
by Arjen K. Lenstra — 2001 — Proceedings Asiacrypt 2001, LNCS 2248, Springer-Verlag 2001, 67–86
… is the fact that the computational effort required to factor a 512-bit RSA modulus is about 50 times smaller…
Cited by 17 (1 self) – Add To MetaCart

A practical architecture for reliable quantum computers
by Mark Oskin, Frederic T, Isaac L — 2002 — IEEE Computer
…, Los Alamitos, Calif., 1994, p. 124. 2. B. Preneel, ed., Factorization of a 512-Bit RSA Modulus, vol…
Cited by 15 (5 self) – Add To MetaCart

Showing 1 through 7.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB