Hardness of Learning AES with Gradient-Based Methods

Kanat Alimanov, Zhenisbek AssylbekovCANS 2023 · OpenReview

Abstract

We show the approximate pairwise orthogonality of a class of functions formed by a single AES output bit under the assumption that all of its round keys except the initial one are independent. This result implies the hardness of learning AES encryption (and decryption) with gradient-based methods. The proof relies on the Boas-Bellman type of inequality in inner-product spaces.
BibTeX
@inproceedings{alimanov2023hardness,
  author = {Kanat Alimanov and Zhenisbek Assylbekov},
  title = {{Hardness of Learning AES with Gradient-Based Methods}},
  booktitle = {CANS},
  year = {2023},
  url = {https://openreview.net/forum?id=prax8FNx9E},
}

Loading related content...

Figure