A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms - Archive ouverte HAL Access content directly
Journal Articles Mathematics of Computation Year : 2019

A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms

Abstract

In this paper, we revisit the ZigZag strategy of Granger, Kleinjung and Zumbrägel. In particular, we provide a new algorithm and proof for the so-called degree 2 elimination step. This allows us to provide a stronger theorem concerning discrete logarithm computations in small characteristic fields F q k 0 k with k close to q and k0 a small integer. As in the aforementioned paper, we rely on the existence of two polynomi-als h0 and h1 of degree 2 providing a convenient representation of the finite field F q k 0 k .
Fichier principal
Vignette du fichier
Deg2Elimination.pdf (297.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01960765 , version 1 (12-07-2019)

Identifiers

  • HAL Id : hal-01960765 , version 1

Cite

Faruk Göloğlu, Antoine Joux. A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms. Mathematics of Computation, 2019, pp.1. ⟨hal-01960765⟩
61 View
51 Download

Share

Gmail Facebook X LinkedIn More