Algebraic attacks using binary decision diagrams
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2086709 (Why is no real title available?)
- scientific article; zbMATH DE number 3353170 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Algebraic Cryptanalysis
- Algebraic Cryptanalysis of the Data Encryption Standard
- Algebraic and Slide Attacks on KeeLoq
- Communication Theory of Secrecy Systems*
- Cryptanalysis of hash functions on the MD4-family.
- Extended BDD-Based Cryptanalysis of Keystream Generators
- Fast Software Encryption
- Graph-Based Algorithms for Boolean Function Manipulation
- Improving the variable ordering of OBDDs is NP-complete
- Obtaining and solving systems of equations in key variables only for the small variants of AES
- Solving compressed right hand side equation systems with linear absorption
- Solving multiple right hand sides linear equations
- The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera
- Theory and Applications of Satisfiability Testing
- Verification of restricted EA-equivalence for vectorial Boolean functions
Cited in
(5)
This page was built for publication: Algebraic attacks using binary decision diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947100)