Title: Quantum period finding against symmetric primitives
Abstract: Quantum period finding has a huge impact in cryptography, with Shor’s
algorithm that breaks the RSA and Diffie-Hellman protocol.
Moreover, there are other quantum period finding algorithms that are less famous,
such as Simon’s algorithm.
I will present cryptanalysis using Simon’s algorithm, from the theory to complete
implementations in Q#, against a diverse set of symmetric constructions: the lightweight
MAC and ISO standard Chaskey, the low-latency block cipher Prince, used to encrypt
the memory in some microcontrollers, and the authenticated encryption scheme Elephant,
which is a candidate in the NIST lightweight authenticated encryption competition.
This presentation will cover content from the following articles:
– https://eprint.iacr.org/2019/614
– https://eprint.iacr.org/2020/919
– https://eprint.iacr.org/2020/1418
