AES encryption fast implementation uses table lookup operation. The index value of the table lookup will affect the cache hit rate and encryption time, and the index value of the table lookup is closely related to the key. By analyzing the relationship between the table lookup index value and the ciphertext and the last round of subkey in the last round of AES encryption, as well as their impact on cache hit and encryption time, a technology using cache hit information as bypass information to attack AES is proposed. In the environment of Intel Celeron 1.99 GHz and Pentium4 3.6 GHz CPU, the 128-bit key of AES in the OpenSSL v.0.9.8(a) library is recovered within 5 minutes under the conditions of 221 and 225 random plaintext samples respectively, and the means to defend against this attack are introduced. Keywords: bypass attack; cache hit; AES algorithm
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore