Quantum cryptanalysis of hash and claw-free functions: Invited paper
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · see citing works
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · see citing works
Flagged first, then by citations
Research works printed but not linked: 6
- [1][1] M. Boyer, G. Brassard, P. Høyer and A. Tapp, 'Tight bounds on quantum searching', Proceedings of the Fourth Workshop on Physics of Computation , 1996, pp. 36 - 43. -
- [2][2] G. Brassard, D. Chaum and C. Cr´ epeau, 'Minimum disclosure proofs of knowledge', Journal of Computer and System Sciences , Vol. 37, no. 2, October 1988, pp. 156 - 189. -
- [3][3] G. Brassard and P. Høyer, 'An exact quantum polynomial-time algorithm for Simon's problem', Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems , to appear, 1997. -
- [4][4] J. L. Carter and M. N. Wegman, 'Universal classes of hash functions', Journal of Computer and System Sciences , Vol. 18, no. 2, 1979, pp. 143 - 154. -
- [7][7] D.R. Simon, 'On the power of quantum computation', Proceedings of the 35th Annual Symposium on Foundations of Computer Science , 1994, pp. 116 - 123. Final version to appear in SIAM Journal on Computing . -
- [8][8] D.R. Stinson, Cryptography: Theory and Practice , CRC Press, Inc, 1995.
Cited by
Sorted by citations
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607 · see citing works
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344 · see citing works
Circuit-Based Quantum Random Access Memory for Classical Data
Park, D. K., Petruccione, F., & Rhee, J.-K. K. (2019) · Scientific Reports · doi:10.1038/s41598-019-40439-3 · Cited by 151 · see citing works
Kim, P., Han, D., & Jeong, K. C. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2107-3 · Cited by 80 · see citing works
Post-quantum XML and SAML Single Sign-On
Müller, J., & Oupický, J. (2024) · Proceedings on Privacy Enhancing Technologies · doi:10.56553/popets-2024-0128 · Cited by 2 · see citing works
- Authors
- Brassard, G., HØyer, P., & Tapp, A.
- Affiliations
- University of Southern Denmark (DK)
- Université de Montréal (CA)
- ORCID
- HØyer, Peter
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1998
- Pages
- 163-169
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2762094014
- Cited by
- 251
- References
- 2
- Citations by year
- 2026: 11 · 2025: 17 · 2024: 22 · 2023: 22 · 2022: 17 · 2021: 23 · 2020: 31 · 2019: 16 · 2018: 9 · 2017: 8 · 2016: 4 · 2015: 6 · 2014: 11 · 2013: 3 · 2012: 1
- FWCI
- 0.00
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Lecture notes in computer science (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- quantum cryptanalysis, hash functions, Grover's algorithm, quantum search, space-time tradeoff, black-box algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
