Cryptology ePrint Archive: Report 2017/1143

Faster key compression for isogeny-based cryptosystems

Gustavo H. M. Zanon and Marcos A. Simplicio Jr and Geovandro C. C. F. Pereira and Javad Doliskani and Paulo S. L. M. Barreto

Abstract: Supersingular isogeny-based cryptography is one of the more recent families of post-quantum proposals. An interesting feature is the comparatively low bandwidth occupation in key agreement protocols, which stems from the possibility of key compression. However, compression and decompression introduce a significant overhead to the overall processing cost despite recent progress. In this paper we address the main processing bottlenecks involved in key compression and decompression, and suggest substantial improvements for each of them. Some of our techniques may have an independent interest for other, more conventional areas of elliptic curve cryptography as well.

Category / Keywords: Post-quantum cryptography, Supersingular elliptic curves, Public-key compression, Pohlig-Hellman algorithm, Diffie-Hellman key exchange

Original Publication (with major differences): International Conference on Post-Quantum Cryptography - PQCrypto 2018

Date: received 26 Nov 2017, last revised 5 Nov 2018

Contact author: geovandro pereira at uwaterloo ca

Available format(s): PDF | BibTeX Citation

Version: 20181105:194706 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]