Characteristic set algorithms for equation solving in finite fields
From MaRDI portal
Publication:413410
DOI10.1016/j.jsc.2011.12.025zbMath1273.11176MaRDI 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 field; stream cipher; characteristic set; Boolean polynomial; proper triangular set; single exponential algorithm
68W30: Symbolic computation and algebraic computation
11Y16: Number-theoretic algorithms; complexity
11T06: Polynomials over finite fields
12E20: Finite fields (field-theoretic aspects)
Related Items
Characteristic sets verses generalized characteristic sets, Computing Switching Surfaces in Optimal Control Based on Triangular Decomposition, Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited, A note on determine the greatest common subfamily of two NFSRs by Gröbner basis, 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, Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition, Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems, Chordal graphs in triangular decomposition in top-down style, On the efficiency of solving Boolean polynomial systems with the characteristic set method, A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity, Parametric equation solving and quantifier elimination in finite fields with the characteristic set method, Analyzing Boolean functions via solving parametric polynomial systems, A New Method for Solving Polynomial Systems with Noise over $\mathbb{F}_2$ and Its Applications in Cold Boot Key Recovery
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
