The filtering step of discrete logarithm and integer factorization algorithms
type: Dataset
description: 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.
landing page: https://inria.hal.science/hal-00734654
keyword: discrete-logarithm
keyword: factorization
keyword: filtering
keyword: function-field-sieve
keyword: infoeu-reposemanticspreprint
keyword: infoinfo-crcomputer-science-cscryptography-and-security-cscr
keyword: linear-algebra
keyword: number-field-sieve
keyword: preprints-working-papers-
keyword: sparse-linear-system
keyword: structured-gaussian-elimination
issued: 2026-05-10T21:44:12.452464
modified: 2026-05-10T21:44:12.452468
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

The filtering step of discrete logarithm and integer factorization algorithms
type: Distribution
format: HTML
access URL: https://inria.hal.science/hal-00734654
issued: 2026-05-10T21:44:12.457822
modified: 2026-05-10T21:44:12.441068