Pages that link to "Item:Q1030264"
From MaRDI portal
The following pages link to Polybori: A framework for Gröbner-basis computations with Boolean polynomials (Q1030264):
Displaying 33 items.
- PolyBoRi (Q13477) (← links)
- 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)
- 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)
- Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath (Q832343) (← links)
- Slimgb: Gröbner bases with slim polynomials (Q1958670) (← links)
- Solving non-linear Boolean equation systems by variable elimination (Q2032298) (← 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)
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (Q2818203) (← links)
- Conditional Differential Cryptanalysis of Trivium and KATAN (Q2889871) (← links)
- Mutant Differential Fault Analysis of Trivium MDFA (Q2942851) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- Gröbner bases of neural ideals (Q4576004) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Algebraic Attacks Galore! (Q5189805) (← links)
- Polynomial semantics for modal logics (Q5243399) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Representing the integer factorization problem using ordered binary decision diagrams (Q6185610) (← links)
- CLAASP: a cryptographic library for the automated analysis of symmetric primitives (Q6620060) (← links)
- SAT solving using XOR-OR-AND normal forms. (Q6653668) (← links)
- Polynomial calculus for optimization (Q6665696) (← links)
