The following pages link to (Q2757235):
Displaying 17 items.
- The space complexity analysis in the general number field sieve integer factorization (Q278727) (← links)
- Practical cryptanalysis of ISO 9796-2 and EMV signatures (Q315558) (← links)
- A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery (Q376164) (← links)
- Proving properties of matrices over \({\mathbb{Z}_{2}}\) (Q453198) (← links)
- An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\) (Q604101) (← links)
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- The universal block Lanczos-Padé method for linear systems over large prime fields (Q1708252) (← links)
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153) (← links)
- Rigorous analysis of a randomised number field sieve (Q1747213) (← links)
- An efficient matrix tridiagonalization method for 3D finite element analysis of free vibration (Q1998010) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\) (Q2304593) (← links)
- Least squares methods in Krylov subspaces (Q2405047) (← links)
- \(\mathbb F _2 \) Lanczos revisited (Q2469540) (← links)
- On polynomial selection for the general number field sieve (Q3420245) (← links)
- On the coefficients of the polynomial in the number field sieve (Q5046489) (← links)
