[Resource Topic] 2021/272: Isogeny-based key compression without pairings

Welcome to the resource topic for 2021/272

Isogeny-based key compression without pairings

Authors: Geovandro C. C. F. Pereira, Paulo S. L. M. Barreto


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.

ePrint: https://eprint.iacr.org/2021/272

Talk: https://www.youtube.com/watch?v=impcM6CCWXI

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .