Attacking AES via SAT - Department of Computer Science

More documents

Recommendations

Info

SAT AES and SAT Translation of AES into SAT Evaluation of initial translation Future work In general, the SAT problem is NP-complete, and thus is an appropriate modelling language for hard problems such as the breaking of AES. Given successes with modelling, and other hard problems, as well as interest and work in the form of 1 SAT solvers (see minisat, picosat etc) 2 SAT competitions 3 SAT conferences (see SAT 2009, held at Swansea) SAT provides a good platform for attacking and analysing hard problems. Matthew Gwynne Attacking AES via SAT
AES AES and SAT Translation of AES into SAT Evaluation of initial translation Future work AES at a high level is made up of the following basic operations: R : {0, 1} 128 → {0, 1} 128 KS : {0, 1} 128 × {1, . . . , 10} → {0, 1} 128 AES : {0, 1} 128 × {0, 1} 128 → {0, 1} 128 where R is the round operation, made up of smaller operations including the cryptographically important Sbox, and KS is the key schedule, which generates a round key for each round. 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 7: SAT 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?