scientific article; zbMATH DE number 475433
From MaRDI portal
Publication:4273680
zbMath0806.11066MaRDI QIDQ4273680
Publication date: 13 February 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
The space complexity analysis in the general number field sieve integer factorization ⋮ A classification of ECM-friendly families of elliptic curves using modular curves ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms ⋮ Оценки количества чисел со специальным разложением на простые множители ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ An Implementation of the Number Field Sieve ⋮ Robust Estimation in Binary Choice Models ⋮ Better polynomials for GNFS ⋮ Lattice sieving in three dimensions for discrete log in medium characteristic ⋮ Strategy of Relations Collection in Factoring RSA Modulus ⋮ An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$ ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment ⋮ Root optimization of polynomials in the number field sieve
This page was built for publication:
