Paper 2016/015

Quantum Collision-Resistance of Non-Uniformly Distributed Functions

Ehsan Ebrahimi Targhi, Gelo Noel Tabia, and Dominique Unruh

Abstract

We study the quantum query complexity of finding a collision for a function $f$ whose outputs are chosen according to a distribution with min-entropy $k$. We prove that $\Omega(2^{k/9})$ quantum queries are necessary to find a collision for function $f$. This is needed in some security proofs in the quantum random oracle model (e.g. Fujisaki-Okamoto transform).

Metadata
Available format(s)
PDF
Publication info
Preprint.
Keywords
QuantumCollisionNon-uniform distributionQuery complexity
Contact author(s)
ehsan ebrahimi targhi @ ut ee
History
2016-01-08: received
Short URL
https://ia.cr/2016/015
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/015,
      author = {Ehsan Ebrahimi Targhi and Gelo Noel Tabia and Dominique Unruh},
      title = {Quantum Collision-Resistance of Non-Uniformly Distributed Functions},
      howpublished = {Cryptology ePrint Archive, Paper 2016/015},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/015}},
      url = {https://eprint.iacr.org/2016/015}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.