Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Lower Bounds on Lattice Enumeration with Extreme Pruning

TheIACR via YouTube

Overview

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

Reviews

Start your review of Lower Bounds on Lattice Enumeration with Extreme Pruning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.