Explore three award-winning papers presented at Asiacrypt 2021 in this conference talk series. Delve into the hardness of the NTRU problem with Alice Pellet-Mary, discover a geometric approach to linear cryptanalysis presented by Tim Beyne, and learn about lattice enumeration for Tower NFS in a 521-bit discrete logarithm computation from Gabrielle De Micheli. Gain insights into cutting-edge cryptographic research and advancements in the field through these expert presentations.
Overview
Syllabus
Award Papers (Asiacrypt 2021)
Taught by
TheIACR