BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LORIA
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Évènements pour LORIA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20200312T133000
DTEND;TZID=Europe/Paris:20200312T150000
DTSTAMP:20260405T173734
CREATED:20200306T154918Z
LAST-MODIFIED:20200306T154918Z
UID:9251-1584019800-1584025200@www.loria.fr
SUMMARY:Séminaire SSL par Emmanuel Thomé
DESCRIPTION:Le prochain séminaire SSL sera donné par Emmanuel Thomé\, de l’équipe CARAMBA le jeudi 12 mars\, à 13h30\, en salle A008. \nTitre : Large-scale computational records for public-key cryptography \nRésumé :\nJoint work with Fabrice Boudot\, Pierrick Gaudry\, Aurore Guillevic\, Nadia Heninger\, Paul Zimmermann. \nIn December 2019 and February 2020\, we completed several record computations related to hard problems in public-key cryptography: we factored a 240-digit RSA modulus\, we computed discrete logarithms modulo a 240-digit prime\, and while we were at it\, we also factored a 250-digit RSA modulus. Such records provide very important data points for the assessment of the computational hardness of the integer factorization (IF) and finite field discrete logarithm (DL) problems. These problems underpin the largest part of public-key cryptography that is currently in use. Previous records date back to 2016 (for DL) and 2009 (for IF). \nThis talk reports on how these computations were performed\, and on how we chose parameters for the Number Field Sieve algorithm in order to minimize the running time. We also give some data on the scalability of our approach\, and how it required harnessing a formidable computing power\, with thousands of CPU cores from several facilities\, working in parallel over several months. We also show that our work goes well beyond improving on previous records by using a lot of hardware: even if we had used identical hardware\, our larger computation would have been faster than the smaller\, previous record (for DL).
URL:https://www.loria.fr/event/seminaire-ssl-par-emmanuel-thome/
LOCATION:A008
CATEGORIES:Séminaire
END:VEVENT
END:VCALENDAR