Article
Faster Key Compression for Isogeny-Based Cryptosystems
IEEE Transactions on Computers
Publication Date
1-1-2018
Document Type
Article
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. IEEE
DOI
10.1109/TC.2018.2878829
Publisher Policy
pre print, post print
Citation Information
G.H.M. Zanon, M.A. Simplicio Jr, G.C. C. F. Pereira, J. Doliskani, et al.. "Faster Key Compression for Isogeny-Based Cryptosystems" IEEE Transactions on Computers (2018) Available at: http://works.bepress.com/paulo-barreto/8/