CryptoDB
CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations
| Authors: | |
|---|---|
| Download: | |
| Abstract: | In this paper we report on a new record class group computation of an imaginary quadratic field having 154-digit discriminant, surpassing the previous record of 130 digits. This class group is central to the CSIDH-512 isogeny based cryptosystem, and knowing the class group structure and relation lattice implies efficient uniform sampling and a canonical representation of its elements. Both operations were impossible before and allow us to instantiate an isogeny based signature scheme first sketched by Stolbunov. We further optimize the scheme using multiple public keys and Merkle trees, following an idea by De Feo and Galbraith. We also show that including quadratic twists allows to cut the public key size in half for free. Optimizing for signature size, our implementation takes 390 ms to sign/verify and results in signatures of 263 bytes, at the expense of a large public key. This is 300 times faster and over 3 times smaller than an optimized version of SeaSign for the same parameter set. Optimizing for public key and signature size combined, results in a total size of 1468 bytes, which is smaller than any other post-quantum signature scheme at the 128-bit security level. |
BibTeX
@article{asiacrypt-2019-30016,
title={CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations},
booktitle={Advances in Cryptology – ASIACRYPT 2019},
series={Advances in Cryptology – ASIACRYPT 2019},
publisher={Springer},
volume={11921},
pages={227-247},
doi={10.1007/978-3-030-34578-5_9},
author={Ward Beullens and Thorsten Kleinjung and Frederik Vercauteren},
year=2019
}