Integer factorization and discrete logarithm problems - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Integer factorization and discrete logarithm problems

(1)
1

Abstract

These are notes for a lecture given at CIRM in 2014, for the Journées Nationales du Calcul Formel. We explain the basic algorithms based on combining congruences for solving the integer factorization and the discrete logarithm problems. We highlight two particular situations where the interaction with symbolic computation is visible: the use of Gröbner basis in Joux's algorithm for discrete logarithm in nite eld of small characteristic, and the exact sparse linear algebra tools that occur in the Number Field Sieve algorithm for discrete logarithm in large characteristic.
Fichier principal
Vignette du fichier
poly.pdf (380.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01215553 , version 1 (14-10-2015)

Identifiers

  • HAL Id : hal-01215553 , version 1

Cite

Pierrick Gaudry. Integer factorization and discrete logarithm problems. 2014. ⟨hal-01215553⟩
242 View
2283 Download

Share

Gmail Facebook Twitter LinkedIn More