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)

• Title not available (Why is that?)
• Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath
• A Practical Attack on Patched MIFARE Classic
• The Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm Over Boolean Polynomial Rings
• 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
• Algebraic Techniques in Differential Cryptanalysis Revisited
• A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
• 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
• Block Ciphers: Algebraic Cryptanalysis and Gröbner Bases
• Gröbner-free normal forms for Boolean polynomials
• Polynomial semantics for modal logics
• On conversions from CNF to ANF
• On the relation between the MXL family of algorithms and Gröbner basis algorithms
• Algebraic Attacks Galore!
• On the efficiency of solving Boolean polynomial systems with the characteristic set method
• Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT
• Title not available (Why is that?)
• Quasigroups as Boolean Functions, Their Equation Systems and Gröbner Bases
• Narrow Proofs May Be Maximally Long
• Advanced Algebraic Attack on Trivium
• Dynamics of Boolean networks
• Space Complexity in Polynomial Calculus
• Pseudo-partitions, transversality and locality
• 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
• The Sage Project: Unifying Free Mathematical Software to Create a Viable Alternative to Magma, Maple, Mathematica and MATLAB
• Conditional Differential Cryptanalysis of Trivium and KATAN
• A signature based border basis algorithm
• Title not available (Why is that?)
• Optimising Gröbner bases on Bivium
• Modifying Faugère's F5 algorithm to ensure termination
• Slimgb: Gröbner bases with slim polynomials
• Algebraic Techniques in Differential Cryptanalysis
• Algebraic Precomputations in Differential and Integral Cryptanalysis
• Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
• 3BA: a border bases solver with a SAT extension
• Gröbner bases of neural ideals
• Some trade-off results for polynomial calculus
• A white-box speck implementation using self-equivalence encodings
• Boolean Gröbner bases

This page was built for software: PolyBoRi