L6: Attacks on Groups
Topics
- Generic d-log algorithms: Baby-Step Giant-Step, Pollard Rho, Shoup’s lower bound
- A non-generic algorithm: Index calculus
Readings
- Chapters 13, 14, and 15 in Galbraith’s book
- The Past, evolving Present and Future of Discrete Logarithm by Joux, Odlyzko and Pierrot
- Notes for Lectures 10 and 11 of Sutherland’s class at MIT
- “Lower Bounds for Discrete Logarithms and Related Problems,” Victor Shoup