CADO-NFS
From MaRDI portal
Software:19299
No author found.
Source code repository: https://gitlab.inria.fr/cado-nfs/cado-nfs
Related Items (14)
The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic ⋮ Examples of CM curves of genus two defined over the reflex field ⋮ A role for generalized Fermat numbers ⋮ Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants ⋮ The Gauss-Wilson theorem for quarter-intervals ⋮ Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ Better polynomials for GNFS ⋮ Lattice sieving in three dimensions for discrete log in medium characteristic ⋮ Montgomery's method of polynomial selection for the number field sieve ⋮ Sparse Gaussian Elimination Modulo p: An Update ⋮ A new ranking function for polynomial selection in the number field sieve ⋮ 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 software: CADO-NFS
