Hardness of Learning AES Key

Sultan Nurmukhamedov, Artur Pak, Rustem Takhanov, Zhenisbek Assylbekov

Research output: Contribution to journalConference articlepeer-review


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 the recent result of Liu et al. [1].

Original languageEnglish
Pages (from-to)42-47
Number of pages6
JournalCEUR Workshop Proceedings
Publication statusPublished - 2023
Event22nd International Conference of the Italian Association for Artificial Intelligence, AIxIA DP 2022 - Udine, Italy
Duration: Nov 28 2022Dec 2 2022


  • AES
  • Computational Hardness
  • Machine Learning

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Hardness of Learning AES Key'. Together they form a unique fingerprint.

Cite this