BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Lattice Problems and Lattice Sieving
DTSTART:20260202T140000
DTEND:20260202T150000
DTSTAMP:20260403T223528Z
UID:b7655173296e90b936d6391d01ce03129eb29290975e189820b88d3a
CATEGORIES:Conferences - Seminars
DESCRIPTION:Ziyu Zhao (Tsinghua University)\nThis talk provides an introdu
 ction to lattice reduction\, with an emphasis on the recent\, rapidly impr
 oving exponential-space sieving algorithms. The lattice problem of interes
 t is closely related to integer programming: both involve finding integer 
 points\, but in ellipsoids for lattices and in polytopes for integer progr
 amming. The demand for cryptographic applications has driven remarkable pr
 ogress in lattice sieving over the last decade. We will present the best p
 ublicly known lattice sieving algorithms\, their performance\, and record-
 breaking computations. We will also discuss how to resolve the issues caus
 ed by exponential-space complexity when developing practical lattice solve
 rs. For the largest practically solvable lattice problems\, sieving algori
 thms can be roughly $2^{15}$ to $2^{20}$ times faster than classical enume
 ration algorithms with $n^{cn}$ time complexity\, while memory consumption
  remains a minor part of the overall cost.
LOCATION:CM 1 517 https://plan.epfl.ch/?room==CM%201%20517
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR