.png){kind=icon}
.png){kind=icon}
Return
Faster Key Compression for Isogeny-Based Cryptosystems
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2018.2878829.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Post-quantum cryptography
supersingular elliptic curves
public-key compression
Pohlig-Hellman algorithm
Diffie-Hellman key exchange
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
View more organizations