Hardness of Learning AES Key (Student Abstract)

Artur Pak, Sultan Nurmukhamedov, Rustem Takhanov, Zhenisbek Assylbekov

AAAI 2023 pp. 16296-16297

doi:10.1609/AAAI.V37I13.27008 /aaai/2023/pak2023aaai-hardness/

Abstract

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.

PDF AAAI Semantic Scholar

Cite

Text

Pak et al. "Hardness of Learning AES Key (Student Abstract)." AAAI Conference on Artificial Intelligence, 2023. doi:10.1609/AAAI.V37I13.27008

Markdown

[Pak et al. "Hardness of Learning AES Key (Student Abstract)." AAAI Conference on Artificial Intelligence, 2023.](https://mlanthology.org/aaai/2023/pak2023aaai-hardness/) doi:10.1609/AAAI.V37I13.27008

BibTeX

@inproceedings{pak2023aaai-hardness,
  title     = {{Hardness of Learning AES Key (Student Abstract)}},
  author    = {Pak, Artur and Nurmukhamedov, Sultan and Takhanov, Rustem and Assylbekov, Zhenisbek},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2023},
  pages     = {16296-16297},
  doi       = {10.1609/AAAI.V37I13.27008},
  url       = {https://mlanthology.org/aaai/2023/pak2023aaai-hardness/}
}