Towards Post-Quantum Secure Symmetric Cryptography: A Mathematical Perspective

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

Paper 2019/1208

Towards Post-Quantum Secure Symmetric Cryptography: A Mathematical Perspective

Xenia Bogomolec, 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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Minor revision. Computeralgebra Rundbrief
Keywords: AES symmetric cryptography Grover's search quantum algebraic attack eAES post-quantum cryptography
Contact author(s): xb @ quant-x-sec com
john underhill @ protonmail com
contact @ qrcrypto ch
History: 2019-10-16: received
Short URL: https://ia.cr/2019/1208
License: CC BY

BibTeX

@misc{cryptoeprint:2019/1208,
      author = {Xenia Bogomolec and John Gregory Underhill and Stiepan Aurélien Kovac},
      title = {Towards Post-Quantum Secure Symmetric Cryptography: A Mathematical Perspective},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/1208},
      year = {2019},
      url = {https://eprint.iacr.org/2019/1208}
}