The filtering step of discrete logarithm and integer factorization algorithms - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

The filtering step of discrete logarithm and integer factorization algorithms

Cyril Bouvier

Résumé

The security of most current public-key cryptosystems is based on the difficulty of finding discrete logarithms in large finite fields or factoring large integers. Most discrete logarithm and interger factoring algorithms, such as the Number Field Sieve (NFS) or the Function Field Sieve (FFS), can be described in 3 main steps: data collection, filtering and linear algebra. The goal of the filtering step is to generate a small, sparse matrix over a finite field, for which one will compute the kernel during the linear algebra step. The filtering step is mainly a structured Gaussian elimination (SGE). For the current factorization records, billions of data are collected in the first step and have to be processed in the filtering step. One part of the filtering step is to remove heavy rows of the matrix. The choice of the weight function to select heavy rows is critical in order to obtain the smallest matrix possible. In this paper, several weight functions are studied in order to determine which one is more suited in the context of discrete logarithm and factorization algorithms.
Fichier principal
Vignette du fichier
article.pdf (458.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00734654 , version 1 (24-09-2012)
hal-00734654 , version 2 (07-04-2013)
hal-00734654 , version 3 (03-06-2013)

Identifiants

  • HAL Id : hal-00734654 , version 2

Citer

Cyril Bouvier. The filtering step of discrete logarithm and integer factorization algorithms. 2013. ⟨hal-00734654v2⟩
795 Consultations
876 Téléchargements

Partager

Gmail Facebook X LinkedIn More