AAAI2023

Hardness of Learning AES Key (Student Abstract)

Artur Pak, Sultan Nurmukhamedov, Rustem Takhanov, Zhenisbek Assylbekov

摘要

We show hardness of learning AES key from pairs of ciphertexts under the assumption of computational closeness of AES to pairwise independence. The latter is motivated by a recent result on statistical closeness of AES to pairwise independence.