CRYPTO : Andre Schrottenloher (Inria Paris) : Optimal Merging Trees in Quantum k-xor Algorithms
Bâtiment Descartes, salle 301The generalized birthday problem, or k-xor problem, has many applications in cryptography. Interestingly, there is a gap between its provable query complexity and its best known time complexity, obtained with Wagner’s algorithm. Quantum algorithms for this problem have been studied