Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
From MaRDI portal
Publication:4794653
DOI10.1090/S0025-5718-02-01482-5zbMath1099.11074MaRDI QIDQ4794653
Publication date: 19 February 2003
Published in: Mathematics of Computation (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)
Related Items
A classification of ECM-friendly families of elliptic curves using modular curves, Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation, Index calculus in the trace zero variety, A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm, Higher-dimensional sieving for the number field sieve algorithms, Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation, Collecting relations for the number field sieve in, Faster individual discrete logarithms in finite fields of composite extension degree, When e-th Roots Become Easier Than Factoring, An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic, Computing discrete logarithms in \(\mathbb F_{p^6}\), Cycle detection algorithms and their applications, Computation of a 768-Bit Prime Field Discrete Logarithm, A Kilobit Hidden SNFS Discrete Logarithm Computation, The number field sieve for integers of low weight, Updating key size estimations for pairings, The Function Field Sieve in the Medium Prime Case, Indiscreet logarithms in finite fields of small characteristic, Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography, Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле, ECM on Graphics Cards, Some mathematical remarks on the polynomial selection in NFS, A new ranking function for polynomial selection in the number field sieve, Selecting polynomials for the Function Field Sieve, An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$, Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields, Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment, A Brief History of Pairings, The multiple number field sieve for medium- and high-characteristic finite fields
Cites Work
- The development of the number field sieve
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Factoring polynomials with rational coefficients
- Computation of discrete logarithms in prime fields
- Lattice reduction: a toolbox for the cryptoanalyst
- An Implementation of the Number Field Sieve
- The Factorization of the Ninth Fermat Number
- Fast evaluation of logarithms in fields of characteristic two
- The Multiple Polynomial Quadratic Sieve
- Discrete logarithms and local units
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
