Key establishment à la Merkle in a quantum world
From MaRDI portal
Publication:2318085
DOI10.1007/s00145-019-09317-zzbMath1466.94020arXiv1108.2316OpenAlexW2963231949MaRDI QIDQ2318085
Kassem Kalach, Gilles Brassard, Louis Salvail, Sophie Laplante, M. A. Kaplan, Peter Høyer
Publication date: 13 August 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2316
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- Universal classes of hash functions
- Cryptography in a Quantum World
- Secure communications over insecure channels
- Adversary lower bound for the k-sum problem
- Search via Quantum Walk
- Quantum Random Access Memory
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Quantum lower bounds for the collision and the element distinctness problems
- Quantum Walk Based Search Algorithms
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Strengths and Weaknesses of Quantum Computing
- On the Communication Complexity of Key-Agreement Protocols.
- Merkle Puzzles in a Quantum World
- On the Robustness of Bucket Brigade Quantum RAM
- Quantum Walk Algorithm for Element Distinctness
- Quantum Query Complexity of State Conversion
- Logical Reversibility of Computation
- Quantum cryptanalysis of hash and claw-free functions