Sparse algebraic equations over finite fields
From MaRDI portal
Publication:3558007
DOI10.1137/070700371zbMATH Open1248.11105OpenAlexW2048079788MaRDI QIDQ3558007FDOQ3558007
Authors: Igor Semaev 
Publication date: 29 April 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070700371
Recommendations
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16)
Cited In (17)
- Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
- Solving equation systems by agreeing and learning
- Methods to solve algebraic equations in cryptanalysis
- 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
- Title not available (Why is that?)
- 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)
