BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260829T040249EDT-34356nVR1I@132.216.98.100
DTSTAMP:20260829T080249Z
DESCRIPTION:Quantum Resource Estimation for Quantum Cryptanalysis (or why d
 o constants in Ohs and Omegas matter)\n\nQuantum computers pose a serious 
 threat to modern cryptography: they weaken symmetric cryptography and tota
 lly break the public-key cryptography based on factoring and discrete-log.
  The most cryptographically relevant quantum algorithms are Grover’s sea
 rching algorithm (quadratically faster than any classical brute force sear
 ching scheme) and Shor’s factoring algorithm (exponentially faster than 
 the best known classical factoring algorithm - the number sieve). In this 
 talk I will describe how feasible is to run those algorithms (or variants 
 of them) on a realistic quantum architecture\, taking fault-tolerance into
  account\, and quantify the resources (time and number of qubits) required
  to run them. I will show that the overhead introduced by the need for qua
 ntum error correction is significant\, and has to be taken into account wh
 en analyzing the security of cryptographic schemes against quantum adversa
 ries.\n	\n	Café-biscuits à 15h\n
DTSTART:20171123T203000Z
DTEND:20171123T213000Z
LOCATION:Room 3195\, CA\, Pav. André-Aisenstadt
SUMMARY:Vlad Gheorghiu\, Institute for Quantum Computing\,University of Wat
 erloo
URL:https://www.mcgill.ca/mathstat/channels/event/vlad-gheorghiu-institute-
 quantum-computinguniversity-waterloo-282953
END:VEVENT
END:VCALENDAR