Breakthrough: Quasi-Polynomial Time Algorithm for Discrete Logarithms in Finite Fields of Fixed Characteristic 🔐
Explore Benjamin Wesolowski's groundbreaking research on solving discrete logarithms in finite fields more efficiently, opening new avenues in cryptography and security.
Protocol Labs
465 views • Oct 24, 2019
About this video
Talk by Benjamin Wesolowski, a postdoc at Centrum Wiskunde & Informatica (CWI) in Amsterdam. https://eprint.iacr.org/2019/751.pdf
Protocol Labs Research: https://research.protocol.ai/
*If you want to suggest a speaker or a topic for our seminar series, open an issue at github.com/protocol/research (template provided)*
Protocol Labs Research: https://research.protocol.ai/
*If you want to suggest a speaker or a topic for our seminar series, open an issue at github.com/protocol/research (template provided)*
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
465
Likes
8
Duration
01:05:10
Published
Oct 24, 2019
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now