The following pages link to PolyBoRi (Q13477):
Displaying 48 items.
- Characteristic set algorithms for equation solving in finite fields (Q413410) (← links)
- On the relation between the MXL family of algorithms and Gröbner basis algorithms (Q414624) (← links)
- Dynamics of Boolean networks (Q542562) (← links)
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers (Q611072) (← links)
- Optimising Gröbner bases on Bivium (Q626947) (← links)
- Obtaining and solving systems of equations in key variables only for the small variants of AES (Q626949) (← links)
- Model checking in the modal \(\mu \)-calculus and generic solutions (Q633088) (← links)
- Boolean Gröbner bases (Q633095) (← links)
- A logic-algebraic approach to decision taking in a railway interlocking system (Q694549) (← links)
- An approach from answer set programming to decision making in a railway interlocking system (Q740741) (← links)
- Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath (Q832343) (← links)
- New developments in the theory of Gröbner bases and applications to formal verification (Q1017680) (← links)
- 3BA: a border bases solver with a SAT extension (Q1662237) (← links)
- Gröbner-free normal forms for Boolean polynomials (Q1760097) (← links)
- Slimgb: Gröbner bases with slim polynomials (Q1958670) (← links)
- A white-box speck implementation using self-equivalence encodings (Q2096645) (← links)
- A signature based border basis algorithm (Q2183746) (← links)
- On the efficiency of solving Boolean polynomial systems with the characteristic set method (Q2211189) (← links)
- An algebraic model for implementing expert systems based on the knowledge of different experts (Q2228552) (← links)
- A natural language for implementing algebraically expert systems (Q2228853) (← links)
- An algebraic approach for detecting nearly dangerous situations in expert systems (Q2228856) (← links)
- On conversions from CNF to ANF (Q2307626) (← links)
- Boolean ideals and their varieties (Q2348121) (← links)
- The Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm Over Boolean Polynomial Rings (Q2799559) (← links)
- Advanced Algebraic Attack on Trivium (Q2807844) (← links)
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (Q2818203) (← links)
- An Implementation Method of Boolean Gröbner Bases and Comprehensive Boolean Gröbner Bases on General Computer Algebra Systems (Q2879173) (← links)
- Conditional Differential Cryptanalysis of Trivium and KATAN (Q2889871) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- Pseudo-partitions, transversality and locality (Q2986893) (← links)
- Algorithm 898 (Q2989091) (← links)
- Algebraic Techniques in Differential Cryptanalysis Revisited (Q3012982) (← links)
- Algebraic Precomputations in Differential and Integral Cryptanalysis (Q3019942) (← links)
- Algebraic Techniques in Differential Cryptanalysis (Q3391571) (← links)
- A Practical Attack on Patched MIFARE Classic (Q3454151) (← links)
- Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT (Q3648465) (← links)
- Block Ciphers: Algebraic Cryptanalysis and Gröbner Bases (Q3652824) (← links)
- Quasigroups as Boolean Functions, Their Equation Systems and Gröbner Bases (Q3652840) (← links)
- Gröbner bases of neural ideals (Q4576004) (← links)
- (Q4931177) (← links)
- Modifying Faugère's F5 algorithm to ensure termination (Q5175285) (← links)
- (Q5188247) (← links)
- Algebraic Attacks Galore! (Q5189805) (← links)
- Polynomial semantics for modal logics (Q5243399) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- (Q5301603) (← links)
- Some trade-off results for polynomial calculus (Q5495852) (← links)
- The Sage Project: Unifying Free Mathematical Software to Create a Viable Alternative to Magma, Maple, Mathematica and MATLAB (Q5747850) (← links)
