Parametric equation solving and quantifier elimination in finite fields with the characteristic set method
From MaRDI portal
Publication:2439880
DOI10.1007/s11424-012-0168-4zbMath1292.93047OpenAlexW2140913328MaRDI QIDQ2439880
Publication date: 18 March 2014
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-012-0168-4
Related Items (5)
A New Method for Solving Polynomial Systems with Noise over $\mathbb{F}_2$ and Its Applications in Cold Boot Key Recovery ⋮ A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity ⋮ Analyzing Boolean functions via solving parametric polynomial systems ⋮ On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characteristic set algorithms for equation solving in finite fields
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- Basic principles of mechanical theorem proving in elementary geometries
- A new method for solving algebraic systems of positive dimension
- An algorithm for solving parametric linear systems
- Comprehensive Gröbner bases
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- On the theories of triangular sets
- Attacking Bivium and Trivium with the Characteristic Set Method
- ZERO DECOMPOSITION THEOREMS FOR COUNTING THE NUMBER OF SOLUTIONS FOR PARAMETRIC EQUATION SYSTEMS
This page was built for publication: Parametric equation solving and quantifier elimination in finite fields with the characteristic set method
