When numbers boomerang and collide in AES encryption

I was really surprised, yes there is a pattern to me being surprised and my blog postings (I blog usually when something surprises me), to read[1, 2] that AES has been attacked [2] (i.e. cryptanalysis attack by using a related-key boomerang attack) which presents weaknesses (local collisions) in the AES algorithm. Still it is claimed that we are still secure as it might be possible to reduce the complexity to 2110.5 data and time,compared to the current 2119, which attacks are still both computationally unfeasible for AES-256.

2119 * wishes it is so!

Links Used:

[1] Bruce Schneier, ‘New Attack on AES’ – http://www.schneier.com/blog/archives/2009/07/new_attack_on_a.html
[2] Alex Biryukov and Dmitry Khovratovich, “Related-key Cryptanalysis of the Full AES-192 and AES-256” – https://cryptolux.uni.lu/mediawiki/uploads/1/1a/Aes-192-256.pdf

This entry was posted in Uncategorized. Bookmark the permalink.

One Response to When numbers boomerang and collide in AES encryption

  1. René says:

    It may be roundly asserted that human ingenuity cannot concoct a cipher which human ingenuity cannot resolve.

    -Edgar A. Poe Esq.

Leave a Reply

Your email address will not be published. Required fields are marked *