PolyBoRi

swMATH723MaRDI QIDQ13477FDOQ13477

Author name not available (Why is that?)

Described by source

• Polybori: A framework for Gröbner-basis computations with Boolean polynomials

Cited In (48)

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

This page was built for software: PolyBoRi