TY - GEN
T1 - Hardness of Learning AES Key
AU - Pak, Artur
AU - Nurmukhamedov, Sultan
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:
Copyright © 2023, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2023/6/27
Y1 - 2023/6/27
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 a recent result on statistical closeness of AES to pairwise independence.
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 a recent result on statistical closeness of AES to pairwise independence.
UR - http://www.scopus.com/inward/record.url?scp=85168247043&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85168247043&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85168247043
T3 - Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023
SP - 16296
EP - 16297
BT - AAAI-23 Special Programs, IAAI-23, EAAI-23, Student Papers and Demonstrations
A2 - Williams, Brian
A2 - Chen, Yiling
A2 - Neville, Jennifer
PB - American Association for Artificial Intelligence (AAAI) Press
T2 - 37th AAAI Conference on Artificial Intelligence, AAAI 2023
Y2 - 7 February 2023 through 14 February 2023
ER -