YoVDO

Optimization of LPN Solving Algorithms

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 optimization techniques for solving Learning Parity with Noise (LPN) algorithms in this 33-minute conference talk presented by Sonia Bogos and Serge Vaudenay at Asiacrypt 2016. Delve into the LPN problem, various algorithms, and reduction methods including Sparse Secret, Claw Reduce, Drop Reduce, and Code Reduce. Examine the general idea behind these optimizations, analyze results, and understand their implications through graphical representations. Gain insights into cutting-edge cryptographic research and its potential impact on the field.

Syllabus

Introduction
Outline
LPN Problem
Algorithms
Sparse Secret
Claw Reduce Reduction
Drop Reduce Reduction
Code Reduce
Results
General Idea
Graph
Conclusion


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