[Resource Topic] 2019/1208: Towards Post-Quantum Secure Symmetric Cryptography: A Mathematical Perspective

Welcome to the resource topic for 2019/1208

Towards Post-Quantum Secure Symmetric Cryptography: A Mathematical Perspective

Authors: Xenia Bogomolec, John Gregory Underhill, Stiepan Aurélien Kovac


We introduce an independent research project on symmetric cryptography with a focus on foreseeable industrial needs and higher post-quantum security compared to currently used symmetric algorithms. It was initiated by the independent IT-Security experts Kovac and Underhill. The result is the new symmetric cryptographic algorithm eAES, which is intended to be a stronger brother of the widely used Advanced Encryption Standard, the standardized version of the Rijndael algorithm. In this analysis we show, that eAES offers an enhanced complexity by a factor ≥ 2^126 regarding the quantum cryptanalysis Grover’s search algorithm compared to AES for 256 bit keys. Furthermore we outline the basic facts and open questions regarding quantum algebraic attacks on eAES.

ePrint: https://eprint.iacr.org/2019/1208

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .