Calculating Discrete Logarithms. John Hawley Nicolette Nicolosi Ryan Rivard. Discrete Logarithms. We want to find a unique integer x such that α x = β (mod n) . We can find x by solving: x = log α β (mod n) . But…. Logarithms are easy!.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
BABY-STEP-GIANT-STEP(α, β, m, n)
FOR j IN [0, m]
HASH-TABLE-PUT(αj (mod n), j)
Compute α−m (mod n)
FOR i IN [0, ceil(n/m)]
j ← HASH-TABLE-GET(γ) RETURN (i * m) + j
γ←γ∗α−m (mod n)