The Discrete Logarithm Problem
Alan G. Konheim · 2006
This chapter contains sections titled: The Discrete Logarithm Problem Modulo p Solution of the DLP Modulo p Given a Factorization of p – 1 Adelman's Subexponential Algorithm for the Discrete Logarithm Problem The Baby-Step, Giant-Step Algorithm The Index-Calculus Method Pollard's ρ-Algorithm Extension Fields The Current State of Discrete Logarithm Research