Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
From MaRDI portal
Publication:4286604
DOI10.2307/2153413zbMATH Open0805.65046OpenAlexW1993840452MaRDI QIDQ4286604FDOQ4286604
Publication date: 2 February 1995
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2153413
Recommendations
- Solving linear equations over GF(2): Block Lanczos algorithm
- Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods
- Solvers for systems of linear algebraic equations with block-band matrices
- On Solving Block-Structured Indefinite Linear Systems
- Overlapping block-laterative methods for solving algebraic equations
- Explicit solution of block tridiagonal systems of linear equations
- On solving almost block diagonal (staircase) linear systems
- Efficient algorithms for the solution of block linear systems with Toeplitz entries
- Solving linear systems via Pfaffians
- scientific article
Cited In (48)
- Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
- Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
- A double large prime variation for small genus hyperelliptic index calculus
- Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
- The hardness of LPN over any integer ring and field for PCG applications
- \(\mathbb F _2 \) Lanczos revisited
- Title not available (Why is that?)
- The space complexity analysis in the general number field sieve integer factorization
- Updating key size estimations for pairings
- IPRainbow
- Solving linear equations over GF(2): Block Lanczos algorithm
- Efficient matrix preconditioners for black box linear algebra
- Cryptanalysis of \texttt{Elisabeth-4}
- Factoring multivariate polynomials via partial differential equations
- Higher-dimensional sieving for the number field sieve algorithms
- Computation of a 768-Bit Prime Field Discrete Logarithm
- Sparse Gaussian Elimination Modulo p: An Update
- The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes
- Practical cryptanalysis of ISO 9796-2 and EMV signatures
- Euclid’s algorithm and the Lanczos method over finite fields
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factoring polynomials over finite fields: A survey
- A block algorithm of Lanczos type for solving sparse systems of linear equations
- The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
- Probabilistic analysis of block Wiedemann for leading invariant factors
- Improved algorithms for computing determinants and resultants
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- Fast matrix decomposition in \(\mathbb F_2\)
- Reconstructing a phylogenetic level-1 network from quartets
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- On the coefficients of the polynomial in the number field sieve
- Cryptanalysis of Rank-Metric Schemes Based on Distorted Gabidulin Codes
- A Kilobit Special Number Field Sieve Factorization
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\)
- 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
- A fraction free matrix Berlekamp/Massey algorithm
- Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow
- Algebraic algorithm for the alternating trilinear form equivalence problem
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- A Kilobit Hidden SNFS Discrete Logarithm Computation
This page was built for publication: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286604)
