Faster Key Compression for Isogeny-Based Cryptosystems
| Autor: | Javad Doliskani, Marcos A. Simplicio, Paulo S. L. M. Barreto, Gustavo H. M. Zanon, Geovandro C. C. F. Pereira |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Isogeny
Computer science business.industry Cryptography Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology 020202 computer hardware & architecture Theoretical Computer Science Elliptic curve Computational Theory and Mathematics Computer engineering Quantum cryptography Hardware and Architecture 0202 electrical engineering electronic engineering information engineering Key (cryptography) Bandwidth (computing) Overhead (computing) Cryptosystem Elliptic curve cryptography business Software |
| Zdroj: | IEEE Transactions on Computers. 68:688-701 |
| ISSN: | 2326-3814 0018-9340 |
| DOI: | 10.1109/tc.2018.2878829 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|