Search

Summary

In Chapter 5, Computing Discrete Logarithms, Robert Granger and Antoine Joux discuss the question “how hard is it to compute discrete logarithms in various groups?”. It details the key ideas and constructions behind the most efficient algorithms for solving the discrete logarithm problem (DLP) with a focus on the recent advances related to finite fields of extension degree >1. A highlight is the rapid development, in the period 2012–2014, of quasi-polynomial time algorithms to solve the DLP in finite fields of fixed charaterstic. Both Granger and Joux contributed significantly to this development, albeit on competing teams. For this book, in Chapter 5, they join forces and explain how different ideas eventually led to the fall of the fixed characteristic finite-field discrete logarithm problem.

Brizolis asked for which primes p greater than 3 there exists a pair (g,h) such that h is a fixed point of the discrete exponential map with base g, or equivalently h is a fixed point of the discrete logarithm with base g. Various authors have contributed to the understanding of this problem. In this paper, we use p-adic methods, primarily Hensel’s lemma and p-adic interpolation, to count fixed points, two-cycles, collisions, and solutions to related equations modulo powers of a prime p.

Search Results

Refine search

Refine search

Actions for selected content:

2 results

5 - Computing Discrete Logarithms

Summary

COUNTING FIXED POINTS, TWO-CYCLES, AND COLLISIONS OF THE DISCRETE EXPONENTIAL FUNCTION USING p-ADIC METHODS

Search Results

Refine search

Refine search

Actions for selected content:

Save Search

2 results

5 - Computing Discrete Logarithms

Summary

COUNTING FIXED POINTS, TWO-CYCLES, AND COLLISIONS OF THE DISCRETE EXPONENTIAL FUNCTION USING p-ADIC METHODS