An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography
Authors:
- André ChaillouxACAndré Chailloux
- María Naya-PlasenciaMNMaría Naya-Plasencia
- André SchrottenloherASAndré Schrottenloher
- 18 November 2017
- book chapter
- Published by Springer Nature
- p. 211-240
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications2012
- Second Preimage Attacks on Dithered Hash Functions2008
- 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
- Trade-offs in the quantum search algorithmPhysical Review A, 2002
- How to decrypt or even substitute DES-encrypted messages in 228 stepsInformation Processing Letters, 2002
- Quantum amplitude amplification and estimation2002
- A construction of a cipher from a single pseudorandom permutationJournal of Cryptology, 1997
- HOW TO SWINDLE RABINCryptologia, 1979
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975