Sparse algebraic equations over finite fields
From MaRDI portal
Publication:3558007
Recommendations
Cited in
(17)- Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
- Methods to solve algebraic equations in cryptanalysis
- Solving equation systems by agreeing and learning
- Characteristic set algorithms for equation solving in finite fields
- MaxMinMax problem and sparse equations over finite fields
- On solving sparse algebraic equations over finite fields
- Deterministic equation solving over finite fields
- Sparse Boolean equations and circuit lattices
- An application of combinatorics in cryptography
- Improved agreeing-gluing algorithm
- Local reduction and the algebraic cryptanalysis of the block cipher GOST
- Speeding up deciphering by hypergraph ordering
- Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products
- A combinatorial problem related to sparse systems of equations
- scientific article; zbMATH DE number 5038555 (Why is no real title available?)
- Sparse Solutions of Linear Diophantine Equations
- Beating brute force for systems of polynomial equations over finite fields
This page was built for publication: Sparse algebraic equations over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558007)