Advanced search
Start date
Betweenand


Faster Isogeny-Based Compressed Key Agreement

Full text
Author(s):
Zanon, Gustavo H. M. ; Simplicio, Marcos A., Jr. ; Pereira, Geovandro C. C. F. ; Doliskani, Javad ; Barreto, Paulo S. L. M. ; Lange, T ; Steinwandt, R
Total Authors: 7
Document type: Journal article
Source: POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2018; v. 10786, p. 21-pg., 2018-01-01.
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. (AU)

FAPESP's process: 13/25977-7 - Security and reliability of Information: theory and practice
Grantee:Marcelo Firer
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 15/50520-6 - Efficient post-quantum cryptography for building advanced security applications
Grantee:Marcos Antonio Simplicio Junior
Support Opportunities: Research Grants - Research Partnership for Technological Innovation - PITE