Attacking AES via SAT
نویسندگان
چکیده
An investigation is made into applying SAT solving techniques to the cryptanalysis of the AES block cipher. AES was intended to be translated into a generalised set of clauses and then a boolean CNF obtained through analysis of the components of the cipher, hopefully resulting in novel insight into the construction of AES and further cryptanalysis.
منابع مشابه
The Interaction between Propositional Satisfiability and Applications in Cryptography and Ramsey Problems
The Advanced Encryption Standard is used widely throughout industry for symmetric encryption and is, so far, resistant to any cryptanalytic attacks, despite interest in the area. Attacking AES and smaller variants therefore offers an interesting problem, with a lot of underlying structure inherent in the cipher itself, and so we continue research started in [Gwy] by looking at AES from the pers...
متن کاملObtaining and Solving Systems of Equations in Key Variables Only for the Small Variants of AES
This work is devoted to attacking the small scale variants of the Advanced Encryption Standard (AES) via systems that contain only the initial key variables. To this end, we introduce a system of equations that naturally arises in the AES, and then eliminate all the intermediate variables via normal form reductions. The resulting system in key variables only is solved then. We also consider a p...
متن کاملThe International SAT Solver Competitions
is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various ...
متن کاملFirst report on an adaptive density based branching rule for DLL-like SAT solvers, using a database for mixed random conjunctive normal forms created using the Advanced Encryption Standard (AES)
We introduce an adaptive density-based heuristics hA for a given (DLLlike, otherwise arbitrary) SAT solver A, leading to a (hopefully) improved SAT solver A0. The determination of hA is motivated by a generalised threshold conjecture for random formulas, and exploits a database for satis ability and hardness of random formulas. To build up such a (large) database, a new reliable pseudo-random f...
متن کاملSuccessfully Attacking Masked AES Hardware Implementations
During the last years, several masking schemes for AES have been proposed to secure hardware implementations against DPA attacks. In order to investigate the effectiveness of these countermeasures in practice, we have designed and manufactured an ASIC. The chip features an unmasked and two masked AES-128 encryption engines that can be attacked independently. In addition to conventional DPA atta...
متن کامل