Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath
DOI10.1007/978-3-030-81652-0_9zbMATH Open1485.94094OpenAlexW3186573290MaRDI QIDQ832343FDOQ832343
Authors: John Petter Indrøy, Nicolas Costes, Håvard Raddum 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_9
Recommendations
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Graph-Based Algorithms for Boolean Function Manipulation
- Title not available (Why is that?)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Title not available (Why is that?)
- Influence of addition modulo \(2^n\) on algebraic attacks
- Solving compressed right hand side equation systems with linear absorption
- Algebraic attacks using binary decision diagrams
- Solving multiple right hand sides linear equations
- Algebraic Cryptanalysis of the Data Encryption Standard
- Provable security against a differential attack
- On the Complexity of Some Ordering Problems
- Title not available (Why is that?)
- Extended BDD-Based Cryptanalysis of Keystream Generators
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- Ciphers for MPC and FHE
- Analysis of Trivium using compressed right hand side equations
- Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
- Troika: a ternary cryptographic hash function
Cited In (2)
Uses Software
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)
