Paper 2021/192

Quantum Indifferentiability of SHA-3

Jan Czajkowski

Abstract

In this paper we prove quantum indifferentiability of the sponge construction instantiated with random (invertible) permutations. With this result we bring the post-quantum security of the standardized SHA-3 hash function to the level matching its security against classical adversaries. To achieve our result, we generalize the compressed-oracle technique of Zhandry (Crypto'19) by defining and proving correctness of a compressed permutation oracle. We believe our technique will find applications in many more cryptographic constructions.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. Minor revision.
Keywords
quantum indifferentiabilitysponge constructionSHA3permutations
Contact author(s)
j czajkowski @ uva nl
History
2021-05-12: revised
2021-02-24: received
See all versions
Short URL
https://ia.cr/2021/192
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2021/192,
      author = {Jan Czajkowski},
      title = {Quantum Indifferentiability of SHA-3},
      howpublished = {Cryptology ePrint Archive, Paper 2021/192},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/192}},
      url = {https://eprint.iacr.org/2021/192}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.