eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20210407:185644 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in PKC 2021
- Keywords
- Isogeny-based cryptosystemskey compressionefficient algorithms
- Contact author(s)
- pbarreto @ gmail com,geovandro pereira @ uwaterloo ca,pbarreto @ uw edu
- History
- 2021-04-16: last of 4 revisions
- 2021-03-04: received
- See all versions
- Short URL
- https://ia.cr/2021/272
- License
-
CC BY
