As of August 2020 the site you are on ( is deprecated, and content is now at


Jump to: navigation, search

Tutorial B6 Breaking AES (Manual CPA Attack)

1 byte added, 11:53, 29 March 2016
no edit summary
It can be noticed there is effectively three sums, all sums are done over all traces. For this initial implementation we'll be explicitly calculating some of these sums, although it's faster to use NumPy to calculate across large arrays. We'll convert the equation into this format:
<math>{r_{i,j}} = \frac{sumnum}{\sqrt{sumden1 \times sumden2}}</math>
Let's go ahead an implement this in Python. To begin with, we initialize those three sums to zero:
Anonymous user

Navigation menu