Attacking AES via SAT - Department of Computer Science

More documents

Recommendations

Info

Rewrite System AES and SAT Translation of AES into SAT Evaluation of initial translation Future work The current translation mechanism works by setting up a set of “constraints”, and rewriting each constraint into a simpler constraints. For example: aes round(i 1 , ..., i 128 , o 1 , ..., o 128 ) is translated to: { aes sbox(i 1 , ..., i 8 , t 1 , ..., t 8 ), aes sbox(i 9 , ..., i 16 , t 9 , ..., t 16 ), aes mul03(t 1 , ..., t 8 , t 1 ′ , t′ 8 ), ... } To obtain a (boolean CNF), certain “final constraints” are treated as boolean functions and translated into CNF. Matthew Gwynne Attacking AES via SAT
AES and SAT Translation of AES into SAT Evaluation of initial translation Future work Rewrite System - Sbox Operations such as the Sbox, multiplication over finite fields, xor etc were studied using their full CNF representations (considering them as simple boolean functions), and then small (although not necessarily the smallest) equivalent representations were generated, i.e., no unnecessary auxiliary variables were introduced. The study of such representations is a continuing area of research, and relevant research goals here are 1 Study the space of AES translations 2 Learn more about the structure of AES 3 Determine how SAT algorithms react to the structure of AES 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 and 8: SAT AES and SAT Translation of AES
Page 9 and 10: AES AES and SAT Translation of AES
Page 13: 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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?