Attacking AES via SAT - Department of Computer Science

More documents

Recommendations

Info

Why SAT? AES and SAT Translation of AES into SAT Evaluation of initial translation Future work AES has been approached using other methods such as: 1 Algebraic methods using both Gröbner bases. 2 Algebraic methods using sparse equation systems. SAT is especially attractive here as it has had a lot of success in the past 10 years, for example: 1 Finding the van der Waerden number vdw 2 (6, 6) = 1132. 2 Solving a variety of scheduling and modelling problems including the verification of train signalling systems. Such successes highlight SAT as a strong and interesting method and provide additional motivation for it’s use in studying AES. See the recent Handbook of Satisfiability. Matthew Gwynne Attacking AES via SAT
SAT AES and SAT Translation of AES into SAT Evaluation of initial translation Future work Boolean Satisfiability is the problem, given a propositional formula F , of finding an assignment ϕ : var(F ) → {0, 1} such that ϕ(F ) = 1. For example has the satisfying assignment (v 1 ∨ v 2 ) ∧ (v 1 ∨ ¬v 2 ) ∧ (¬v 1 ∨ v 2 ) < v 1 → 1, v 2 → 1 > . Matthew Gwynne Attacking AES via SAT
Page 1 and 2: AES and SAT Translation of AES into
Page 3 and 4: Basic idea AES and SAT Translation
Page 5: AES and SAT Translation of AES into
Page 9 and 10: AES AES and SAT Translation of AES
Page 13 and 14: Generalised SAT AES and SAT Transla
Page 19 and 20: AES Encoding AES and SAT Translatio
Page 23 and 24: Further Work AES and SAT Translatio
Page 25: References II AES and SAT Translati

Attacking AES via SAT - Department of Computer Science

Create successful ePaper yourself

Delete template?

Save as template?