Cryptology ePrint Archive: Report 2021/368

Memory Optimization Techniques for Computing Discrete Logarithms in Compressed SIKE

Aaron Hutchinson and Koray Karabina and Geovandro Pereira

Abstract: The supersingular isogeny-based key encapsulation (SIKE) suite stands as an attractive post-quantum cryptosystem with its relatively small public keys. Public key sizes in SIKE can further be compressed by computing pairings and solving discrete logarithms in certain subgroups of finite fields. This comes at a cost of precomputing and storing large discrete logarithm tables. In this paper, we propose several techniques to optimize memory requirements in computing discrete logarithms in SIKE, and achive to reduce table sizes by a factor of 4. We implement our techniques and verify our theoretical findings.

Category / Keywords: public-key cryptography / SIKE, isogeny-based cryptography, public key compression, discrete logarithms

Date: received 18 Mar 2021

Contact author: a5hutchinson at uwaterloo ca,profkarabina@gmail com,geovandro pereira@uwaterloo ca

Available format(s): PDF | BibTeX Citation

Version: 20210322:193100 (All versions of this report)

Short URL: ia.cr/2021/368


[ Cryptology ePrint archive ]