Factorization of a 768-bit RSA modulus

Abstract : This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.
Document type :
Conference papers
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/inria-00444693
Contributor : Pierrick Gaudry <>
Submitted on : Wednesday, August 25, 2010 - 2:51:12 PM
Last modification on : Thursday, February 7, 2019 - 4:19:29 PM
Long-term archiving on : Thursday, December 1, 2016 - 1:59:58 PM

File

rsa768.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen Lenstra, Emmanuel Thomé, et al.. Factorization of a 768-bit RSA modulus. CRYPTO 2010, Aug 2010, Santa Barbara, United States. pp.333-350, ⟨10.1007/978-3-642-14623-7_18⟩. ⟨inria-00444693v2⟩

Share

Metrics

Record views

849

Files downloads

1005