arXiv (All)
open access
Collision Detection is Instance $\widetilde{O}$ptimal Under the Birthday Threshold
Can structural knowledge about a hash function help accelerate the (black box) detection of collisions in it? This question is fundamental to cryptography theory given the importance of collision-resistant hash functions, and in this paper we tackle it from the angle of instance optimality, an ultim
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Collision Detection is Instance $\widetilde{O}$ptimal Under the Birthday Threshold#1122198
- Selected Topics in Cryptography#66897
- Autonomous Weapons Systems, the Frame Problem and Computer Security#745344
- KRYPTOS K4: Constraint-Based Structural Cryptanalysis from Public Anchors#191052
- Structured lattices and their applications to security#287057
Record · ID 1141665
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive