Polybori: A framework for Gröbner-basis computations with Boolean polynomials
From MaRDI portal
Recommendations
Cites work
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- A new efficient algorithm for computing Gröbner bases (F₄)
- Advanced Encryption Standard – AES
- Advances in Cryptology - CRYPTO 2003
- Algebraic attacks on the Courtois toy cipher
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Converting bases with the Gröbner walk
- Fast Software Encryption
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 1726532 (Why is no real title available?)
- scientific article; zbMATH DE number 2127876 (Why is no real title available?)
- scientific article; zbMATH DE number 3649988 (Why is no real title available?)
- scientific article; zbMATH DE number 3759578 (Why is no real title available?)
- scientific article; zbMATH DE number 1256733 (Why is no real title available?)
- scientific article; zbMATH DE number 1262464 (Why is no real title available?)
- scientific article; zbMATH DE number 1273640 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 918600 (Why is no real title available?)
- Interpolants and Symbolic Model Checking
- New developments in the theory of Gröbner bases and applications to formal verification
- SATLIB: An online resource for research on SAT
- The Magma algebra system. I: The user language
- Theory and Applications of Satisfiability Testing
Cited in
(44)- New developments in the theory of Gröbner bases and applications to formal verification
- PolyBoRi
- Gröbner-free normal forms for Boolean polynomials
- Slimgb: Gröbner bases with slim polynomials
- Solving non-linear Boolean equation systems by variable elimination
- A white-box speck implementation using self-equivalence encodings
- A signature based border basis algorithm
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- An algebraic model for implementing expert systems based on the knowledge of different experts
- A natural language for implementing algebraically expert systems
- An algebraic approach for detecting nearly dangerous situations in expert systems
- On conversions from CNF to ANF
- Boolean ideals and their varieties
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
- Conditional Differential Cryptanalysis of Trivium and KATAN
- Mutant differential fault analysis of Trivium MDFA
- Space complexity in polynomial calculus
- On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
- On the Computation of Elimination Ideals of Boolean Polynomial Rings
- Characteristic set algorithms for equation solving in finite fields
- On the relation between the MXL family of algorithms and Gröbner basis algorithms
- Gröbner bases of neural ideals
- Boolean Gröbner bases. Theory, algorithms and applications
- Short Proofs Are Hard to Find
- Computing Boolean Gröbner bases within linear algebra
- Algebraic attacks galore!
- Polynomial semantics for modal logics
- Narrow proofs may be maximally long
- Gröbner-free normal forms for Boolean polynomials
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- Representing the integer factorization problem using ordered binary decision diagrams
- Optimising Gröbner bases on Bivium
- Obtaining and solving systems of equations in key variables only for the small variants of AES
- Model checking in the modal -calculus and generic solutions
- Boolean Gröbner bases
- CLAASP: a cryptographic library for the automated analysis of symmetric primitives
- SAT solving using XOR-OR-AND normal forms.
- Polynomial calculus for optimization
- Towards an understanding of polynomial calculus: new separations and lower bounds
- Efficient checking of separating indeterminates
- A logic-algebraic approach to decision taking in a railway interlocking system
- SMT solving over finite field arithmetic
- Algorithm 1052: evaluating a Boolean polynomial on all possible inputs
- Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath
This page was built for publication: Polybori: A framework for Gröbner-basis computations with Boolean polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1030264)
