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.
| Original language | English |
|---|---|
| Title of host publication | AAAI-23 Special Programs, IAAI-23, EAAI-23, Student Papers and Demonstrations |
| Editors | Brian Williams, Yiling Chen, Jennifer Neville |
| Publisher | American Association for Artificial Intelligence (AAAI) Press |
| Pages | 16296-16297 |
| Number of pages | 2 |
| ISBN (Electronic) | 9781577358800 |
| Publication status | Published - Jun 27 2023 |
| Event | 37th AAAI Conference on Artificial Intelligence, AAAI 2023 - Washington, United States Duration: Feb 7 2023 → Feb 14 2023 |
Publication series
| Name | Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023 |
|---|---|
| Volume | 37 |
Conference
| Conference | 37th AAAI Conference on Artificial Intelligence, AAAI 2023 |
|---|---|
| Country/Territory | United States |
| City | Washington |
| Period | 2/7/23 → 2/14/23 |
Funding
This work was supported by the Program of Targeted Funding “Economy of the Future” #0054/ПЦФ-НС-19.
ASJC Scopus subject areas
- Artificial Intelligence
Fingerprint
Dive into the research topics of 'Hardness of Learning AES Key'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS