YoVDO

Lower Bounds on Lattice Enumeration with Extreme Pruning

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Computer Science Courses Cryptography Courses Advanced Algorithms Courses Lattice-Based Cryptography Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a presentation from Crypto 2018 that delves into the lower bounds on lattice enumeration with extreme pruning. Examine the research conducted by Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, and Junji Shikata as they discuss their findings on this cryptographic topic. Gain insights into the complexities of lattice-based cryptography and the challenges associated with enumeration algorithms. Learn about the implications of extreme pruning techniques and their impact on the efficiency of lattice-based cryptosystems. Enhance your understanding of advanced cryptographic concepts in this 23-minute conference talk, which provides valuable information for researchers and practitioners in the field of cryptography.

Syllabus

Lower Bounds on Lattice Enumeration with Extreme Pruning


Taught by

TheIACR

Related Courses

Building Geospatial Apps on Postgres, PostGIS, & Citus at Large Scale
Microsoft via YouTube
Unlocking the Power of ML for Your JavaScript Applications with TensorFlow.js
TensorFlow via YouTube
Managing the Reactive World with RxJava - Jake Wharton
ChariotSolutions via YouTube
What's New in Grails 2.0
ChariotSolutions via YouTube
Performance Analysis of Apache Spark and Presto in Cloud Environments
Databricks via YouTube