Solving sparse linear equations over finite fields
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On solving sparse algebraic equations over finite fields
- Measuring and computing natural generators for homology groups
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Univariate polynomial factorization over finite fields
- Techniques for exploiting structure in matrix formulae of the sparse resultant
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Solving linear systems of determinant frequently zero over finite field GF(2)
- Density of normal elements
- A new efficient algorithm for computing Gröbner bases (F₄)
- Modifications to the number field sieve
- Solving linear equations over GF(2): Block Lanczos algorithm
- Factorization of polynomials and some linear-algebra problems over finite fields
- Finding succinct ordered minimal perfect hash functions
- Efficient matrix preconditioners for black box linear algebra
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Algebraic and numerical techniques for the computation of matrix determinants
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- An efficient structural attack on NIST submission DAGS
- Sparse FGLM algorithms
- Improved algorithms for computing determinants and resultants
- A note on the factorization method of Niederreiter
- Indiscreet logarithms in finite fields of small characteristic
- Matrices in elimination theory
- Early termination in sparse interpolation algorithms
- On the density of normal bases in finite fields
- New techniques for the computation of linear recurrence coefficients
- New results on quasi-subfield polynomials
- Updating key size estimations for pairings
- Analysis of multivariate encryption schemes: application to Dob
- Computing newforms using supersingular isogeny graphs
- An algebraic approach to the rank support learning problem
- Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
- Improved agreeing-gluing algorithm
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- Parallel GNFS algorithm integrated with parallel block Wiedemann algorithm for RSA security in cloud computing
- Refined analysis to the extended tower number field sieve
- The RCH method for computing minimal polynomials of polynomial matrices
- Quantum walks on generalized quadrangles
- Automating algorithm selection: checking for matrix properties that can simplify computations
- Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
- An algorithm to solve integer linear systems exactly using numerical methods
- Exact solutions to linear programming problems
- Fast matrix decomposition in F₂
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Certified dense linear system solving
- Certified sparse linear system solving
- Hanani-Tutte for radial planarity. II
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- The index calculus method using non-smooth polynomials
- Special prime numbers and discrete logs in finite prime fields
- The space complexity analysis in the general number field sieve integer factorization
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Sparse Gaussian Elimination Modulo p: An Update
- Extended tower number field sieve: a new complexity for the medium prime case
- The multiple number field sieve for medium- and high-characteristic finite fields
- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
- The SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wake
- Hanani-Tutte for Radial Planarity II
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- scientific article; zbMATH DE number 4211357 (Why is no real title available?)
- An Optimal Bloom Filter Replacement Based on Matrix Solving
- Evaluation of solving time for multivariate quadratic equation system using XL algorithm over small finite fields on GPU
- On fast and provably secure message authentication based on universal hashing
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- Some algorithms related to matrices with entries in a finite field
- Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III
- The Function Field Sieve in the Medium Prime Case
- Implicitization of curves and (hyper)surfaces using predicted support
- A Rigorous Time Bound for Factoring Integers
- scientific article; zbMATH DE number 177858 (Why is no real title available?)
- Euclid’s algorithm and the Lanczos method over finite fields
- scientific article; zbMATH DE number 1262436 (Why is no real title available?)
- scientific article; zbMATH DE number 503245 (Why is no real title available?)
- Growth Functions and Automatic Groups
- Subquadratic-time factoring of polynomials over finite fields
- The black-box Niederreiter algorithm and its implementation over the binary field
- Discrete logarithm problem using index calculus method
- Complexity transitions in global algorithms for sparse linear systems over finite fields
- The irreducibility of some level 1 Hecke polynomials
- scientific article; zbMATH DE number 2151185 (Why is no real title available?)
- Factoring multivariate polynomials via partial differential equations
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
- Reconstructing a phylogenetic level-1 network from quartets
- Using number fields to compute logarithms in finite fields
- Solving systems of linear equations arising in the computation of logarithms in a finite prime field
- A rank attack against extension field cancellation
- Constant-time retrieval with O( m) extra bits
- Cache Optimized Solution for Sparse Linear System over Large Order Finite Field
- Hanani-Tutte for approximating maps of graphs
- scientific article; zbMATH DE number 7310221 (Why is no real title available?)
- scientific article; zbMATH DE number 7310230 (Why is no real title available?)
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Deterministic equation solving over finite fields
- A brief history of pairings
- Black box linear algebra: extending Wiedemann's analysis of a sparse matrix preconditioner for computations over small fields
- Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
This page was built for publication: Solving sparse linear equations over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3746790)
