Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath

DOI10.1007/978-3-030-81652-0_9zbMath1485.94094OpenAlexW3186573290MaRDI QIDQ832343

Nicolas Costes, John Petter Indrøy, Håvard Raddum

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_9

zbMATH Keywords

block cipheralgebraic cryptanalysisbinary decision diagramequation systemopen sourcetool

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (1)

CryptaPath

Uses Software

• PolyBoRi
• CUDD
• BuDDy
• GitHub
• ADD-Lib
• dd
• Sylvan
• MARVELlous

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Influence of addition modulo \(2^n\) on algebraic attacks
• Solving multiple right hand sides linear equations
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Provable security against a differential attack
• Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
• Troika: a ternary cryptographic hash function
• Solving Compressed Right Hand Side Equation Systems with Linear Absorption
• On the Complexity of Some Ordering Problems
• Algebraic Attacks Using Binary Decision Diagrams
• Ciphers for MPC and FHE
• Analysis of Trivium Using Compressed Right Hand Side Equations
• Graph-Based Algorithms for Boolean Function Manipulation
• Algebraic Cryptanalysis of the Data Encryption Standard
• Extended BDD-Based Cryptanalysis of Keystream Generators
• Applications of SAT Solvers to Cryptanalysis of Hash Functions

This page was built for publication: Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath