TY - JOUR
T1 - Hardness of Learning AES Key
AU - Nurmukhamedov, Sultan
AU - Pak, Artur
AU - Takhanov, Rustem
AU - Assylbekov, Zhenisbek
N1 - Funding Information:
This work was supported by the Program of Targeted Funding “Economy of the Future” #0054/ПЦФ-НС-19.
Publisher Copyright:
© 2021 Copyright for this paper by its authors.
PY - 2023
Y1 - 2023
N2 - 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].
AB - 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].
KW - AES
KW - Computational Hardness
KW - Machine Learning
UR - http://www.scopus.com/inward/record.url?scp=85164183115&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85164183115&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85164183115
SN - 1613-0073
VL - 3419
SP - 42
EP - 47
JO - CEUR Workshop Proceedings
JF - CEUR Workshop Proceedings
T2 - 22nd International Conference of the Italian Association for Artificial Intelligence, AIxIA DP 2022
Y2 - 28 November 2022 through 2 December 2022
ER -