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.
CITATION STYLE
Zanon, G. H. M., Simplicio, M. A., Pereira, G. C. C. F., Doliskani, J., & Barreto, P. S. L. M. (2018). Faster isogeny-based compressed key agreement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10786 LNCS, pp. 248–268). Springer Verlag. https://doi.org/10.1007/978-3-319-79063-3_12
Mendeley helps you to discover research relevant for your work.