Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
From MaRDI portal
(Redirected from Publication:697496)
Recommendations
- Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
- A block Wiedemann rank algorithm
- Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
- scientific article; zbMATH DE number 1253961
- scientific article; zbMATH DE number 503196
Cites work
- scientific article; zbMATH DE number 1643927 (Why is no real title available?)
- scientific article; zbMATH DE number 1676636 (Why is no real title available?)
- scientific article; zbMATH DE number 5009188 (Why is no real title available?)
- scientific article; zbMATH DE number 3956969 (Why is no real title available?)
- scientific article; zbMATH DE number 1253961 (Why is no real title available?)
- scientific article; zbMATH DE number 1302865 (Why is no real title available?)
- scientific article; zbMATH DE number 503245 (Why is no real title available?)
- scientific article; zbMATH DE number 2081061 (Why is no real title available?)
- scientific article; zbMATH DE number 1795735 (Why is no real title available?)
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- An algorithm for solving the discrete log problem on hyperelliptic curves
- Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Distributed matrix-free solution of large sparse linear systems over finite fields
- Fast algorithms for rational Hermite approximation and solution of Toeplitz systems
- Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
- Fast evaluation of logarithms in fields of characteristic two
- Modern computer algebra
- On the computational power of pushdown automata
- Recursive Evaluation of Padé Approximants for Matrix Sequences
- Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Solving linear equations over GF(2): Block Lanczos algorithm
- Solving sparse linear equations over finite fields
Cited in
(16)- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- A Kilobit Special Number Field Sieve Factorization
- scientific article; zbMATH DE number 7310221 (Why is no real title available?)
- scientific article; zbMATH DE number 7310230 (Why is no real title available?)
- Faster Multiplication in GF(2)[x]
- The hardness of LPN over any integer ring and field for PCG applications
- A block Wiedemann rank algorithm
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
- A double large prime variation for small genus hyperelliptic index calculus
- Rigorous analysis of a randomised number field sieve
- Polynomial evaluation and interpolation on special sets of points
- Online order basis algorithm and its impact on the block Wiedemann algorithm
- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
This page was built for publication: Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697496)
