Explore advanced cryptographic techniques in this 25-minute conference talk from Eurocrypt 2016, presented by Bin Zhang, Lin Jiao, and Mingsheng Wang. Delve into the latest research on faster algorithms for solving the Learning Parity with Noise (LPN) problem, a fundamental challenge in cryptography. Gain insights into innovative approaches that improve upon existing methods, potentially impacting the security of LPN-based cryptosystems and advancing the field of cryptanalysis.
Overview
Syllabus
Faster Algorithms for Solving LPN
Taught by
TheIACR
Related Courses
-
Optimization of LPN Solving Algorithms
-
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
-
LPN Decoded
-
Correlated Pseudorandom Functions from Variable-Density LPN
-
Faster Algorithms for Isogeny Problems Using Torsion Point Images
-
Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
