CTIDH: faster constant-time CSIDH

Abstract

This paper introduces a new key space for CSIDH and a new algorithm for constant-time evaluation of the CSIDH group action. The key space is not useful with previous algorithms, and the algorithm is not useful with previous key spaces, but combining the new key space with the new algorithm produces speed records for constant-time CSIDH. For example, for CSIDH-512 with a 256-bit key space, the best previous constant-time results used 789000 multiplications and more than 200 million Skylake cycles; this paper uses 438006 multiplications and 125.53 million cycles.

Publication
In IACR Transactions on Cryptographic Hardware and Embedded Systems.
Gustavo Banegas
Gustavo Banegas
Post-doc

My research interests include post-quantum cryptanalysis and its implementations.