Hardness of Learning AES Key

Sultan Nurmukhamedov; Artur Pak; Rustem Takhanov; Zhenisbek Assylbekov

Hardness of Learning AES Key

Sultan Nurmukhamedov
, Artur Pak
, Rustem Takhanov
, Zhenisbek Assylbekov

Nazarbayev University

Результат исследований › рецензирование

Аннотация

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].

Язык оригинала	English
Страницы (с-по)	42-47
Число страниц	6
Журнал	CEUR Workshop Proceedings
Том	3419
Состояние	Published - 2023
Событие	22nd International Conference of the Italian Association for Artificial Intelligence, AIxIA DP 2022 - Udine Продолжительность: нояб. 28 2022 → дек. 2 2022

ASJC Scopus subject areas

General Computer Science

Другие файлы и ссылки

Цитировать

@article{0827d8879f434aa9982f4470be6356c6,

title = "Hardness of Learning AES Key",

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 the recent result of Liu et al. [1].",

keywords = "AES, Computational Hardness, Machine Learning",

author = "Sultan Nurmukhamedov and Artur Pak and Rustem Takhanov and Zhenisbek Assylbekov",

note = "Funding Information: This work was supported by the Program of Targeted Funding {\textquotedblleft}Economy of the Future{\textquotedblright} \#0054/ПЦФ-НС-19. Publisher Copyright: {\textcopyright} 2021 Copyright for this paper by its authors.; 22nd International Conference of the Italian Association for Artificial Intelligence, AIxIA DP 2022 ; Conference date: 28-11-2022 Through 02-12-2022",

year = "2023",

language = "English",

volume = "3419",

pages = "42--47",

journal = "CEUR Workshop Proceedings",

issn = "1613-0073",

publisher = "CEUR-WS",

}

TY - JOUR

T1 - Hardness of Learning AES Key

AU - Nurmukhamedov, Sultan

AU - Pak, Artur

AU - Takhanov, Rustem

AU - Assylbekov, Zhenisbek

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 - https://www.scopus.com/pages/publications/85164183115

UR - https://www.scopus.com/pages/publications/85164183115#tab=citedBy

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 -

Hardness of Learning AES Key

Аннотация

ASJC Scopus subject areas

Другие файлы и ссылки

Fingerprint

Цитировать