Sunday, July 14, 2019
![Crypto 2019 award](/combinatorics-and-optimization/sites/default/files/uploads/images/cryptoaward.jpg)
![IACR logo](/combinatorics-and-optimization/sites/default/files/uploads/images/iacr-logo.png)
Paper abstract: "We introduce models of computation that enable direct comparisons between classical and quantum algorithms. Incorporating previous work on quantum computation and error correction, we justify the use of the gate-count and depth-times-width cost metrics for quantum circuits. We demonstrate the relevance of these models to cryptanalysis by revisiting, and increasing, the security estimates for the Supersingular Isogeny Diffie-Hellman (SIDH) and Supersingular Isogeny Key Encapsulation (SIKE) schemes. Our models, analyses, and physical justifications have applications to a number of memory intensive quantum algorithms."