YoVDO

Faster Algorithms for Solving LPN

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Algorithm Optimization Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Faster Algorithms for Solving LPN


Taught by

TheIACR

Related Courses

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera