A block Lanczos algorithm for finding dependencies over GF(2)

DOI10.1007/3-540-49264-X_9MaRDI QIDQ2757235zbMATH OpenFDO

Authors Peter L. Montgomery

Publication date 25 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49264-X_9

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Solving linear equations over GF(2): Block Lanczos algorithm
• A reliable block Lanczos algorithm over small finite fields
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Reliable Krylov-based algorithms for matrix null space and rank
• \(\mathbb F _2 \) Lanczos revisited

Cited in

(33)

• A new efficient algorithm for computing Gröbner bases (F₄)
• Solving linear equations over GF(2): Block Lanczos algorithm
• The universal block Lanczos-Padé method for linear systems over large prime fields
• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• Rigorous analysis of a randomised number field sieve
• An efficient matrix tridiagonalization method for 3D finite element analysis of free vibration
• Updating key size estimations for pairings
• An improved parallel block Lanczos algorithm over GF(2) for integer factorization
• GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\)
• Least squares methods in Krylov subspaces
• \(\mathbb F _2 \) Lanczos revisited
• Strategies in filtering in the number field sieve
• The space complexity analysis in the general number field sieve integer factorization
• Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case
• scientific article; zbMATH DE number 4134221 (Why is no real title available?)
• Practical cryptanalysis of ISO 9796-2 and EMV signatures
• On polynomial selection for the general number field sieve
• A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery
• Euclid’s algorithm and the Lanczos method over finite fields
• Proving properties of matrices over \({\mathbb{Z}_{2}}\)
• 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
• <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems
• On the coefficients of the polynomial in the number field sieve
• scientific article; zbMATH DE number 7310221 (Why is no real title available?)
• scientific article; zbMATH DE number 7310230 (Why is no real title available?)
• A reliable block Lanczos algorithm over small finite fields
• A Kilobit Special Number Field Sieve Factorization
• Multiscale S-fraction reduced-order models for massive wavefield simulations
• The Block Lanczos Algorithm
• An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over GF(2)
• The regular multivariate quadratic problem
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm

This page was built for publication: A block Lanczos algorithm for finding dependencies over GF(2)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757235)