Paper 2017/767

Quantum Key-Recovery on full AEZ

Xavier Bonnetain

Abstract

AEZ is an authenticated encryption algorithm, submitted to the CAESAR competition. It has been selected for the third round of the competition. While some classical analysis on the algorithm have been published, the cost of these attacks is beyond the security claimed by the designers. In this paper, we show that all the versions of AEZ are completely broken against a quantum adversary. For this, we propose a generalisation of Simon's algorithm for quantum period finding that allows to build efficient attacks.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. SAC 2017
Keywords
block ciphersquantum cryptographyauthenticated encryptionCAESAR competitionAEZSimon's algorithm
Contact author(s)
xavier bonnetain @ inria fr
History
2017-08-08: received
Short URL
https://ia.cr/2017/767
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/767,
      author = {Xavier Bonnetain},
      title = {Quantum Key-Recovery on full AEZ},
      howpublished = {Cryptology ePrint Archive, Paper 2017/767},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/767}},
      url = {https://eprint.iacr.org/2017/767}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.