Factorization of a 768-bit RSA modulus

Thorsten Kleinjung; Kazumaro Aoki; Jens Franke; Arjen K. Lenstra; Emmanuel Thomé; Joppe W. Bos; Pierrick Gaudry; Alexander Kruppa; Peter L. Montgomery; Dag Arne Osvik; Herman Te Riele; Andrey Timofeev; Paul Zimmermann

inria-00444693, version 2

Factorization of a 768-bit RSA modulus

Thorsten Kleinjung ¹, Kazumaro Aoki ², Jens Franke ³, Arjen K. Lenstra ¹, Emmanuel Thomé ⁴, Joppe W. Bos ¹, Pierrick Gaudry ⁴, Alexander Kruppa ⁴, Peter L. Montgomery ^5, 6, Dag Arne Osvik ¹, Herman Te Riele ⁶, Andrey Timofeev ⁶, Paul Zimmermann ⁴

CRYPTO 2010 6223 (2010) 333-350

Résumé : 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.

1 : Laboratory for Cryptologic Algorithms (LACAL)
École Polytechnique Fédérale de Lausanne
2 : NTT Information Sharing Platform Laboratories (ISL)
Nippon Telegraph & Telephone Corporation - NTT
3 : Department of Mathematics - University of Bonn
Bonn Universität - University of Bonn
4 : CARAMEL (INRIA Nancy - Grand Est / LORIA)
INRIA – CNRS : UMR7503 – Université de Lorraine
5 : Microsoft Research
Microsoft
6 : Scientific Computing and Control Theory (MAS2)
CWI

Collaboration : Grid'5000

inria-00444693, version 2
http://hal.inria.fr/inria-00444693
oai:hal.inria.fr:inria-00444693
Contributeur : Pierrick Gaudry <>
Soumis le : Mercredi 25 Août 2010, 14:51:12
Dernière modification le : Mardi 24 Avril 2012, 08:58:51

Voir la fiche détaillée

Documents associés

PDF :

DOI : 10.1007/978-3-642-14623-7_18

Exporter

Bibtex EndNote TEI RefWorks

<?xml version="1.0" encoding="UTF-8"?>
<listBibl xmlns="http://www.tei-c.org/ns/1.0" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML">
<listBibl type="inproceedings"><head>Communications avec actes</head>
<biblStruct type="inproceedings" xml:id="inria-00444693"><analytic>
<author><persName><forename>Thorsten</forename><surname>Kleinjung</surname></persName>
<affiliation>
<orgName type="laboratory">LACAL</orgName>
<orgName type="team">Laboratory for Cryptologic Algorithms</orgName>
<country>CH</country>
<orgName type="institution">École Polytechnique Fédérale de Lausanne</orgName>
</affiliation>
</author>
<author><persName><forename>Kazumaro</forename><surname>Aoki</surname></persName>
<affiliation>
<orgName type="laboratory">ISL</orgName>
<orgName type="team">NTT Information Sharing Platform Laboratories</orgName>
<country>JP</country>
<orgName type="institution">Nippon Telegraph & Telephone Corporation - NTT</orgName>
</affiliation>
</author>
<author><persName><forename>Jens</forename><surname>Franke</surname></persName>
<affiliation>
<orgName type="team">Department of Mathematics - University of Bonn</orgName>
<country>DE</country>
<orgName type="institution">Bonn Universität - University of Bonn</orgName>
</affiliation>
</author>
<author><persName><forename>Arjen</forename><surname>Lenstra</surname></persName>
<affiliation>
<orgName type="laboratory">LACAL</orgName>
<orgName type="team">Laboratory for Cryptologic Algorithms</orgName>
<country>CH</country>
<orgName type="institution">École Polytechnique Fédérale de Lausanne</orgName>
</affiliation>
</author>
<author><persName><forename>Emmanuel</forename><surname>Thomé</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Nancy - Grand Est / LORIA</orgName>
<orgName type="team">CARAMEL</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université de Lorraine</orgName>
</affiliation>
</author>
<author><persName><forename>Joppe</forename><surname>Bos</surname></persName>
<affiliation>
<orgName type="laboratory">LACAL</orgName>
<orgName type="team">Laboratory for Cryptologic Algorithms</orgName>
<country>CH</country>
<orgName type="institution">École Polytechnique Fédérale de Lausanne</orgName>
</affiliation>
</author>
<author><persName><forename>Pierrick</forename><surname>Gaudry</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Nancy - Grand Est / LORIA</orgName>
<orgName type="team">CARAMEL</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université de Lorraine</orgName>
</affiliation>
</author>
<author><persName><forename>Alexander</forename><surname>Kruppa</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Nancy - Grand Est / LORIA</orgName>
<orgName type="team">CARAMEL</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université de Lorraine</orgName>
</affiliation>
</author>
<author><persName><forename>Peter</forename><surname>Montgomery</surname></persName>
<affiliation>
<orgName type="team">Microsoft Research</orgName>
<country>US</country>
<orgName type="institution">Microsoft</orgName>
</affiliation>
<affiliation>
<orgName type="laboratory">MAS2</orgName>
<orgName type="team">Scientific Computing and Control Theory</orgName>
<country>NL</country>
<orgName type="institution">CWI</orgName>
</affiliation>
</author>
<author><persName><forename>Dag Arne</forename><surname>Osvik</surname></persName>
<affiliation>
<orgName type="laboratory">LACAL</orgName>
<orgName type="team">Laboratory for Cryptologic Algorithms</orgName>
<country>CH</country>
<orgName type="institution">École Polytechnique Fédérale de Lausanne</orgName>
</affiliation>
</author>
<author><persName><forename>Herman</forename><surname>Te Riele</surname></persName>
<affiliation>
<orgName type="laboratory">MAS2</orgName>
<orgName type="team">Scientific Computing and Control Theory</orgName>
<country>NL</country>
<orgName type="institution">CWI</orgName>
</affiliation>
</author>
<author><persName><forename>Andrey</forename><surname>Timofeev</surname></persName>
<affiliation>
<orgName type="laboratory">MAS2</orgName>
<orgName type="team">Scientific Computing and Control Theory</orgName>
<country>NL</country>
<orgName type="institution">CWI</orgName>
</affiliation>
</author>
<author><persName><forename>Paul</forename><surname>Zimmermann</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Nancy - Grand Est / LORIA</orgName>
<orgName type="team">CARAMEL</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université de Lorraine</orgName>
</affiliation>
</author>
<title type="main" level="a">Factorization of a 768-bit RSA modulus</title></analytic><monogr><meeting>CRYPTO 2010</meeting><imprint><publisher>Springer Verlag</publisher><pubPlace><settlement>Santa Barbara</settlement><country>États-Unis</country></pubPlace><biblScope type="publicationDate">2010-00-00</biblScope><biblScope type="vol">6223</biblScope><biblScope type="pp">333-350</biblScope></imprint></monogr><idno type="doi">10.1007/978-3-642-14623-7_18</idno><idno type="HALid">http://hal.inria.fr/inria-00444693</idno><idno type="HALFile">http://hal.inria.fr/inria-00444693/PDF/rsa768.pdf</idno></biblStruct>
</listBibl>
</listBibl>