Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
From MaRDI portal
Publication:4286604
DOI10.2307/2153413zbMath0805.65046OpenAlexW1993840452MaRDI QIDQ4286604
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
Related Items
The space complexity analysis in the general number field sieve integer factorization, Factoring multivariate polynomials via partial differential equations, On the coefficients of the polynomial in the number field sieve, Efficient matrix preconditioners for black box linear algebra, Practical cryptanalysis of ISO 9796-2 and EMV signatures, A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery, A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions, Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow, Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation, Higher-dimensional sieving for the number field sieve algorithms, IPRainbow, Solving discrete logarithms on a 170-bit MNT curve by pairing reduction, A fraction free matrix Berlekamp/Massey algorithm, Solving sparse linear systems of equations over finite fields using bit-flipping algorithm, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., A Kilobit Special Number Field Sieve Factorization, Reconstructing a phylogenetic level-1 network from quartets, \(\mathbb F _2 \) Lanczos revisited, Factoring polynomials over finite fields: A survey, Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, Computation of a 768-Bit Prime Field Discrete Logarithm, A Kilobit Hidden SNFS Discrete Logarithm Computation, Improved algorithms for computing determinants and resultants, Updating key size estimations for pairings, Block-Krylov techniques in the context of sparse-FGLM algorithms, Fast matrix decomposition in \(\mathbb F_2\), Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography, Probabilistic analysis of block Wiedemann for leading invariant factors, GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\), The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes, Sparse Gaussian Elimination Modulo p: An Update, Euclid’s algorithm and the Lanczos method over finite fields, Unnamed Item, Unnamed Item, On polynomial selection for the general number field sieve, A double large prime variation for small genus hyperelliptic index calculus, Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields, Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment, Cryptanalysis of the lifted unbalanced oil vinegar signature scheme, Solving linear equations over GF(2): Block Lanczos algorithm
