Cited in
(72)- Nusschecker
- Algebraic precomputations in differential and integral cryptanalysis
- A practical attack on patched MIFARE Classic
- A white-box speck implementation using self-equivalence encodings
- Gröbner bases of neural ideals
- MARVELlous
- Obtaining and solving systems of equations in key variables only for the small variants of AES
- Block ciphers: algebraic cryptanalysis and Gröbner bases
- Slimgb: Gröbner bases with slim polynomials
- Model checking in the modal \(\mu \)-calculus and generic solutions
- Some trade-off results for polynomial calculus (extended abstract)
- ADD-Lib
- dd
- Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath
- Polynomial semantics for modal logics
- Algebraic Techniques in Differential Cryptanalysis
- Gröbner-free normal forms for Boolean polynomials
- Quasigroups as Boolean functions, their equation systems and Gröbner bases
- Boolean ideals and their varieties
- Algorithm 898
- A logic-algebraic approach to decision taking in a railway interlocking system
- Characteristic set algorithms for equation solving in finite fields
- The Sage project: unifying free mathematical software to create a viable alternative to Magma, Maple, Mathematica and Matlab
- Advanced algebraic attack on Trivium
- On conversions from CNF to ANF
- An algebraic model for implementing expert systems based on the knowledge of different experts
- Optimising Gröbner bases on Bivium
- A natural language for implementing algebraically expert systems
- An algebraic approach for detecting nearly dangerous situations in expert systems
- Gröbner-free normal forms for Boolean polynomials
- Modifying Faugère's F5 algorithm to ensure termination
- Boolean Gröbner bases. Theory, algorithms and applications
- Conditional Differential Cryptanalysis of Trivium and KATAN
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
- FGb
- slimgb
- CUDD
- BuDDy
- ApCoCoA
- Trivium
- mwrank
- antom
- M4RIE
- GBLA
- Algorithm 898
- VBF
- CNFgen
- 3BA
- LELA
- neural ideal
- An approach from answer set programming to decision making in a railway interlocking system
- Algebraic attacks galore!
- Boolean Gröbner bases
- MXL3
- MutantXL
- Algebraic techniques in differential cryptanalysis revisited
- Dynamics of Boolean networks
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- The implementation and complexity analysis of the branch Gröbner bases algorithm over Boolean ring
- Narrow proofs may be maximally long
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- Pseudo-partitions, transversality and locality, a combinatorial characterization for the space measure in algebraic proof systems
- Bosphorus
- CryptaPath
- The implementation and complexity analysis of the branch Gröbner bases algorithm over Boolean polynomial rings
- Space Complexity in Polynomial Calculus
- Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT
- New developments in the theory of Gröbner bases and applications to formal verification
- 3BA: a border bases solver with a SAT extension
- An implementation method of Boolean Gröbner bases and comprehensive Boolean Gröbner bases on general computer algebra systems
- On the relation between the MXL family of algorithms and Gröbner basis algorithms
- A signature based border basis algorithm
This page was built for software: PolyBoRi
