Attacking AES via SAT - Department of Computer Science
Attacking AES via SAT - Department of Computer Science
Attacking AES via SAT - Department of Computer Science
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Basic idea<br />
<strong>AES</strong> and <strong>SAT</strong><br />
Translation <strong>of</strong> <strong>AES</strong> into <strong>SAT</strong><br />
Evaluation <strong>of</strong> initial translation<br />
Future work<br />
Encryption/Decryption<br />
P<br />
K<br />
−−−−−−−→<br />
Encryption<br />
C =⇒ C<br />
K<br />
−−−−−−−→<br />
Decryption<br />
P<br />
The notion <strong>of</strong> “breaking” used in this presentation, is that given a<br />
single plaintext and single block <strong>of</strong> ciphertext, can one deduce a<br />
key. To find unique keys, given multiple plaintext, ciphertext pairs,<br />
this could then be generalised.<br />
Matthew Gwynne<br />
<strong>Attacking</strong> <strong>AES</strong> <strong>via</strong> <strong>SAT</strong>