Quantum Collision-Resistance Of Non-Uniformly Distributed Functions
PQCrypto 2016: Proceedings of the 7th International Workshop on Post-Quantum Cryptography - Volume 9606(2016)
摘要
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).
更多查看译文
关键词
Quantum,Collision,Non-uniform distribution,Query complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络