Understanding Cryptography by Christof Paar and Jan Pelzl - Chapter 4 Solutions - Ex4.16

- 2 mins

Exercise 4.16

For the following, we assume AES with 192-bit key length. Furthermore, let us assume an ASIC which can check keys per second.

  1. If we use 100,000 such ICs in parallel, how long does an average key search take? Compare this period of time with the age of the universe (approx. years).
  2. Assume Moore’s Law will still be valid for the next few years, how many years do we have to wait until we can build a key search machine to perform an average key search of AES-192 in 24 hours? Again, assume that we use 100,000 ICs in parallel.

Solution

I haven’t yet verified this solution independently. If you spot any mistakes, please leave a comment in the Disqus box at the bottom of the page.

1. With 100,000 ICs in parallel, the amount of keys we can check per second is as follows:

The size of the keyspace in this instance is , meaning the average key search will need to do checks. As such, the time required for an average key search is as follows:

We can calculate what this value is in years:

This is approximately times the current elapsed age of the universe.

2. If we represent the number of Moore’s Law iterations to bring the using then we can express the equation as:

We can rearrange this equation to make the only item on the left:

The reveals a value of which is roughly .

Rounding the number of iterations to 134 allows us to calculate the number of years:


Thomas Busby

Thomas Busby

I write about computing stuff

comments powered by Disqus
rss facebook twitter github youtube mail spotify instagram linkedin google google-plus pinterest medium vimeo stackoverflow reddit quora