BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Hard mathematical problems used in Cryptography
DTSTART:20230406T133000
DTEND:20230406T143000
DTSTAMP:20260407T162244Z
UID:3c910ad9bf739a601dc525f128b5267b8fae16790e5d6cfff44a1acf
CATEGORIES:Conferences - Seminars
DESCRIPTION:Gabrielle De Micheli - University of California\, San Diego (U
 CSD)\nSeminar in Mathematics\nAbstract: The security of public key cryptog
 raphy relies on hardness assumptions coming from a variety of mathematical
  problems. One of the two main candidates originally considered to constru
 ct public-key cryptosystems is modular exponentiation with its hard invers
 e operation\, computing discrete logarithms. More recently\, with the emer
 gence of new technologies such as quantum computers\, cryptographers have 
 focused on new hard problems coming from different mathematical objects\, 
 euclidean lattices for example. The main goal of my research is to evaluat
 e the hardness of such mathematical problems in order to correctly assess 
 the security of cryptographic schemes widely deployed and used in the real
  world.\nMore precisely\, I have focused on the complexity of algorithms s
 olving the discrete logarithm problem and the use of RingLWE (Learning Wit
 h Errors) to construct fully homomorphic encryption schemes. I will cover 
 results from both these directions during this talk.\n 
LOCATION:MA B1 524 https://plan.epfl.ch/?room==MA%20B1%20524 https://epfl.
 zoom.us/j/66657362220
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR