A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
From MaRDI portal
Publication:611072
DOI10.1007/s11424-008-9103-0zbMath1201.94080OpenAlexW2034241626WikidataQ121219793 ScholiaQ121219793MaRDI QIDQ611072
Fengjuan Chai, Xiao-Shan Gao, Chun-Ming Yuan
Publication date: 14 December 2010
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-008-9103-0
Related Items
Using variable-entered Karnaugh maps to produce compact parametric general solutions of Boolean equations, Solution of systems of Boolean equations via the integer domain, A New Method for Solving Polynomial Systems with Noise over $\mathbb{F}_2$ and Its Applications in Cold Boot Key Recovery, Characteristic set algorithms for equation solving in finite fields, Implicitization using univariate resultants, Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case, Chordal graphs in triangular decomposition in top-down style, 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, A criterion for testing whether a difference ideal is prime, Ritt-Wu characteristic set method for Laurent partial differential polynomial systems, Elimination theory in differential and difference algebra, Attacking Bivium and Trivium with the Characteristic Set Method, Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited, Computing Switching Surfaces in Optimal Control Based on Triangular Decomposition, The Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm Over Boolean Polynomial Rings, Polybori: A framework for Gröbner-basis computations with Boolean polynomials, On the Chordality of Simple Decomposition in Top-Down Style, Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
Uses Software
Cites Work
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- On decomposing systems of polynomial equations with finitely many solutions
- An elimination method for polynomial systems
- Mathematical problems for the next century
- Solving SAT by algorithm transform of Wu's method
- Graph-Based Algorithms for Boolean Function Manipulation
- Lifting techniques for triangular decompositions
- Application of Wu's method to symbolic model checking
- A Computing Procedure for Quantification Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
