The filtering step of discrete logarithm and integer factorization algorithms

Cyril Bouvier 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : 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 integer 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.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées
Contributeur : Cyril Bouvier <>
Soumis le : lundi 3 juin 2013 - 12:44:18
Dernière modification le : jeudi 22 septembre 2016 - 14:31:25
Document(s) archivé(s) le : mardi 4 avril 2017 - 15:30:17


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00734654, version 3



Cyril Bouvier. The filtering step of discrete logarithm and integer factorization algorithms. 2013. <hal-00734654v3>



Consultations de
la notice


Téléchargements du document