Revisiting the Expected Cost of Solving uSVP and Applications to LWE
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a comprehensive analysis of the expected cost of solving the unique Shortest Vector Problem (uSVP) and its applications to Learning with Errors (LWE) in this 22-minute conference talk presented at Asiacrypt 2017. Delve into the research findings of Martin R. Albrecht, Florian Göpfert, Fernando Virdia, and Thomas Wunderer as they revisit and update the understanding of uSVP solving costs. Gain insights into the implications of their work on the security of lattice-based cryptographic schemes and the estimation of concrete security levels for LWE-based cryptosystems.
Syllabus
Revisiting the Expected Cost of Solving uSVP and Applications to LWE
Taught by
TheIACR
Related Courses
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera