Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath
From MaRDI portal
(Redirected from Publication:832343)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 2086709 (Why is no real title available?)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Algebraic Cryptanalysis of the Data Encryption Standard
- Algebraic attacks using binary decision diagrams
- Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
- Analysis of Trivium using compressed right hand side equations
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- Ciphers for MPC and FHE
- Extended BDD-Based Cryptanalysis of Keystream Generators
- Graph-Based Algorithms for Boolean Function Manipulation
- Influence of addition modulo \(2^n\) on algebraic attacks
- On the Complexity of Some Ordering Problems
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Provable security against a differential attack
- Solving compressed right hand side equation systems with linear absorption
- Solving multiple right hand sides linear equations
- Troika: a ternary cryptographic hash function
This page was built for publication: Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832343)