Alan G. Konheim
Abstract
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
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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
Key concepts: Discrete logarithm, Logarithm, Modulo, Mathematics, Iterated logarithm, Factorization, Extension (predicate logic), State (computer science)