scientific article
From MaRDI portal
Publication:2739444
zbMath1006.11076MaRDI QIDQ2739444
Publication date: 9 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods for sparse matrices (65F50) Number-theoretic algorithms; complexity (11Y16) Linear equations (linear algebraic aspects) (15A06) Factorization (11Y05)
Related Items (8)
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ A Kilobit Special Number Field Sieve Factorization ⋮ Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm ⋮ Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields ⋮ Index calculus in class groups of non-hyperelliptic curves of genus three ⋮ Sparse Gaussian Elimination Modulo p: An Update ⋮ Unnamed Item ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Uses Software
This page was built for publication:
