scientific article
From MaRDI portal
Publication:2757235
zbMath0973.11520MaRDI QIDQ2757235
Publication date: 25 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16)
Related Items
The space complexity analysis in the general number field sieve integer factorization, Factoring multivariate polynomials via partial differential equations, Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method, On the coefficients of the polynomial in the number field sieve, Practical cryptanalysis of ISO 9796-2 and EMV signatures, Least squares methods in Krylov subspaces, An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\), A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery, The universal block Lanczos-Padé method for linear systems over large prime fields, Proving properties of matrices over \({\mathbb{Z}_{2}}\), A Kilobit Special Number Field Sieve Factorization, Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms, \(\mathbb F _2 \) Lanczos revisited, Rigorous analysis of a randomised number field sieve, An efficient matrix tridiagonalization method for 3D finite element analysis of free vibration, Multiscale S-Fraction Reduced-Order Models for Massive Wavefield Simulations, Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, Updating key size estimations for pairings, GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\), Euclid’s algorithm and the Lanczos method over finite fields, A new efficient algorithm for computing Gröbner bases \((F_4)\), Unnamed Item, Unnamed Item, On polynomial selection for the general number field sieve, <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems
