Alex Biryukov, Dmitry Khovratovich
Abstract
Abstract. In this note we present the first attack with feasible com-plexity on the 13-round AES-256. The attack runs in the related-subkey scenario with four related keys, in 276 time, data, and memory. 1
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract. In this note we present the first attack with feasible com-plexity on the 13-round AES-256. The attack runs in the related-subkey scenario with four related keys, in 276 time, data, and memory. 1
Key concepts: Computer science, Computer security, Arithmetic, Mathematics