Quantum Multicollision-Finding Algorithm
- 18 November 2017
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Generic State-Recovery and Forgery Attacks on ChopMD-MAC and on NMAC/HMACLecture Notes in Computer Science, 2013
- Time-Efficient Quantum Walks for 3-DistinctnessLecture Notes in Computer Science, 2013
- Improved Generic Algorithms for 3-CollisionsLecture Notes in Computer Science, 2009
- Improved Indifferentiability Security Analysis of chopMD Hash FunctionLecture Notes in Computer Science, 2008
- Birthday Paradox for Multi-CollisionsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008
- Quantum Walk Algorithm for Element DistinctnessSIAM Journal on Computing, 2007
- Quantum lower bounds for the collision and the element distinctness problemsJournal of the ACM, 2004
- On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit A New ConstructionPublished by Springer Science and Business Media LLC ,2002
- Tight Bounds on Quantum SearchingFortschritte der Physik, 1998
- Nondeterministic AlgorithmsJournal of the ACM, 1967