Cryptology ePrint Archive: Report 2021/272

Isogeny-based key compression without pairings

Geovandro C. C. F. Pereira and Paulo S. L. M. Barreto

Abstract: SIDH/SIKE-style protocols benefit from key compression to minimize their bandwidth requirements, but proposed key compression mechanisms rely on computing bilinear pairings. Pairing computation is a notoriously expensive operation, and, unsurprisingly, it is typically one of the main efficiency bottlenecks in SIDH key compression, incurring processing time penalties that are only mitigated at the cost of trade-offs with precomputed tables. We address this issue by describing how to compress isogeny-based keys without pairings. As a bonus, we also substantially reduce the storage requirements of other operations involved in key compression.

Category / Keywords: Isogeny-based cryptosystems, key compression, efficient algorithms

Original Publication (in the same form): IACR-PKC-2021

Date: received 3 Mar 2021, last revised 16 Apr 2021

Contact author: pbarreto at gmail com, geovandro pereira at uwaterloo ca, pbarreto at uw edu

Available format(s): PDF | BibTeX Citation

Version: 20210416:193136 (All versions of this report)

Short URL: ia.cr/2021/272