Faster Isogeny-Based Compressed Key Agreement

Gustavo H. Zanon
Marcos A. Simplicio
Geovandro C. Pereira
Javad Doliskani
Paulo S. Barreto, University of Washington Tacoma


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.