BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Supersingular Isogenies in cryptography
DTSTART:20190903T130000
DTEND:20190903T150000
DTSTAMP:20260408T105400Z
UID:21e33b21ff0233ba5b4c0b6ee3cf6bf283b0d6e9ed8572cf455a0d78
CATEGORIES:Conferences - Seminars
DESCRIPTION:Khashayar  Barooti \nEDIC candidacy exam\nExam president: Pr
 of. Arjen Lenstra\nThesis advisor: Prof. Serge Vaudenay\nCo-examiner: Prof
 . Michael Kapralov\n\nAbstract\nAs classical problems such as factorizatio
 n\, and discrete logarithm are falling short with the threat of quantum co
 mputers\, some new hard problems are attracting more interest in the crypt
 ographic community. One of these problems is computing isogenies between t
 wo supersingular elliptic curves. Supersingular curves have some interesti
 ng properties which make them useful for various cryptographic constructio
 ns\, such as hash functions\, signature schemes and key exchange protocols
 . In this report\, we provide some theoretical background on this subject\
 , introduce some schemes based on the hardness of isogeny computation\, an
 d finally discuss the difference in the supersingular case and the ordinar
 y curve case.\n\nBackground papers\nConstructing elliptic curve isogenies 
 in quantum subexponential time\, by Andrew M. Childs\, David Jao\, Vladimi
 r Soukharev.\nCryptographic Hash Functions from Expander Graphs\, by Denis
  X. CharlesKristin E. Lauter\, Eyal Z. Goren.\nTowards Quantum-Resistant 
 Cryptosystems from Supersingular Elliptic Curve Isogenies\, by David JaoLu
 ca De Feo.
LOCATION:INF 216 https://plan.epfl.ch/?room==INF%20216
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR