Applied Cryptography: The Discrete Log Problem - Part 7

This video gives an example of a computation for a discrete log in Z*137 using the baby-step-giant-step algorithm. You need to know how to compute with the extended euclidean algorithm. The links to these videos are below: https://youtu.be/XReEJD-l0Vc https://youtu.be/gyFYKHUacFw