Characteristic set algorithms for equation solving in finite fields
From MaRDI portal
Publication:413410
DOI10.1016/j.jsc.2011.12.025zbMath1273.11176OpenAlexW2035167209MaRDI QIDQ413410
Publication date: 7 May 2012
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.025
finite fieldstream ciphercharacteristic setBoolean polynomialproper triangular setsingle exponential algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems ⋮ Characteristic sets verses generalized characteristic sets ⋮ 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 ⋮ Chordal graphs in triangular decomposition in top-down style ⋮ A note on determine the greatest common subfamily of two NFSRs by Gröbner basis ⋮ Parametric equation solving and quantifier elimination in finite fields with the characteristic set method ⋮ On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ Ritt-Wu characteristic set method for Laurent partial differential polynomial systems ⋮ Speeding up the GVW algorithm via a substituting method ⋮ Elimination theory in differential and difference algebra ⋮ Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited ⋮ Computing Switching Surfaces in Optimal Control Based on Triangular Decomposition ⋮ Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- Role of involutive criteria in computing Boolean Gröbner bases
- A characteristic set method for ordinary difference polynomial systems
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Basic principles of mechanical theorem proving in elementary geometries
- A new method for solving algebraic systems of positive dimension
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- On decomposing systems of polynomial equations with finitely many solutions
- An elimination method for polynomial systems
- Factorization-free decomposition algorithms in differential algebra
- Mathematical problems for the next century
- On the theories of triangular sets
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Lifting techniques for triangular decompositions
- Advances in Cryptology - CRYPTO 2003
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
This page was built for publication: Characteristic set algorithms for equation solving in finite fields