Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Faster Key Compression for Isogeny-Based Cryptosystems

Full text
Author(s):
Zanon, Gustavo H. M. [1] ; Simplicio, Jr., Marcos A. [1] ; Pereira, Geovandro C. C. F. [2] ; Doliskani, Javad [2] ; Barreto, Paulo S. L. M. [3]
Total Authors: 5
Affiliation:
[1] Univ Sao Paulo, Escola Politecn, BR-05508220 Sao Paulo - Brazil
[2] Univ Waterloo, Inst Quantum Comp, Waterloo, ON N2L 3G1 - Canada
[3] Univ Washington Tacoma, Tacoma, WA 98402 - USA
Total Affiliations: 3
Document type: Journal article
Source: IEEE TRANSACTIONS ON COMPUTERS; v. 68, n. 5, p. 688-701, MAY 2019.
Web of Science Citations: 0
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: 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