Theory of Computing Seminar
Breaking symmetric cryptosystems using quantum period finding
When a function collides with a fixed periodicity, Simon's algorithm allow to find this period with O(n) quantum queries to the function. This leads to simple attacks in the quantum chosen plaintext model. We apply this idea to a number of cryptosystems including widely used modes of operation for authentication, authenticated encryption and candidates to the CEASAR competition. Finally, we show that slide attacks reveal a similar structure and can be exponentially more efficient in the quantum regime than in the classical one.
Contact: Thomas Vidick firstname.lastname@example.org