Speed Up Discrete Logarithm Calculations with Pohlig–Hellman Algorithm 🔍
Learn how to efficiently compute discrete logs when given a, b, and m using the Pohlig–Hellman method. Discover techniques to solve for x in the equation a ≡ bˣ mod m faster than brute force!
Jim Fowler
9.4K views • Jul 22, 2020
About this video
Suppose a ≡ bˣ mod m and we know a, b, m. Can you find x, and find it quickly? This is the "discrete log problem" and we meet the Pohlig–Hellman algorithm for solving this problem more quickly than merely applying brute force.
Video Information
Views
9.4K
Likes
165
Duration
9:32
Published
Jul 22, 2020
User Reviews
4.6
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.