Characteristic set algorithms for equation solving in finite fields
From MaRDI portal
Recommendations
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- Zero decomposition algorithms for systems of polynomial equations
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- Sparse algebraic equations over finite fields
Cites work
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 4164173 (Why is no real title available?)
- scientific article; zbMATH DE number 16648 (Why is no real title available?)
- scientific article; zbMATH DE number 41286 (Why is no real title available?)
- scientific article; zbMATH DE number 1254247 (Why is no real title available?)
- scientific article; zbMATH DE number 1263332 (Why is no real title available?)
- scientific article; zbMATH DE number 1759269 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- A characteristic set method for ordinary difference polynomial systems
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new efficient algorithm for computing Gröbner bases (F₄)
- A new method for solving algebraic systems of positive dimension
- Advances in Cryptology - CRYPTO 2003
- An elimination method for polynomial systems
- Basic principles of mechanical theorem proving in elementary geometries
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Factorization-free decomposition algorithms in differential algebra
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Lifting techniques for triangular decompositions
- Logical foundations of proof complexity
- Mathematical problems for the next century
- On decomposing systems of polynomial equations with finitely many solutions
- On the theories of triangular sets
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Role of involutive criteria in computing Boolean Gröbner bases
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
Cited in
(20)- Computing switching surfaces in optimal control based on triangular decomposition
- Analyzing Boolean functions via solving parametric polynomial systems
- Elimination theory in differential and difference algebra
- Speeding up the GVW algorithm via a substituting method
- scientific article; zbMATH DE number 16648 (Why is no real title available?)
- A step-by-step CS method and its applications in cryptanalysis of stream ciphers
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
- A new method for solving polynomial systems with noise over \(\mathbb{F}_2\) and its applications in cold boot key recovery
- Parametric equation solving and quantifier elimination in finite fields with the characteristic set method
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- An algorithm to compute the set of characteristics of a system of polynomial equations over the integers.
- Characteristic sets verses generalized characteristic sets
- Ritt-Wu characteristic set method for Laurent partial differential 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
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited
This page was built for publication: Characteristic set algorithms for equation solving in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413410)
