Cryptology ePrint Archive: Report 2019/1208

Towards Post-Quantum Secure Symmetric Cryptography: A Mathematical Perspective

Xenia Bogomolec and John Gregory Underhill and Stiepan Aurélien Kovac

Abstract: 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.

Category / Keywords: secret-key cryptography / AES, symmetric cryptography, Grover's search, quantum algebraic attack, eAES, post-quantum cryptography

Original Publication (with minor differences): Computeralgebra Rundbrief

Date: received 15 Oct 2019

Contact author: xb at quant-x-sec com, john underhill@protonmail com, contact@qrcrypto ch

Available format(s): PDF | BibTeX Citation

Version: 20191016:121112 (All versions of this report)

Short URL: ia.cr/2019/1208


[ Cryptology ePrint archive ]