DOI | Resolve DOI: https://doi.org/10.1007/978-3-030-81293-5_16 |
---|
Author | Search for: Hutchinson, Aaron; Search for: Karabina, Koray1; Search for: Pereira, Geovandro |
---|
Affiliation | - National Research Council of Canada. Digital Technologies
|
---|
Format | Text, Book Chapter |
---|
Conference | PQCrypto 2021 (12th International Workshop), July 20–22, 2021, Daejeon, South Korea |
---|
Subject | SIKE; isogeny-based cryptography; public key compression; discrete logarithms |
---|
Abstract | The supersingular isogeny-based key encapsulation (SIKE) suite stands as an attractive post- quantum cryptosystem with its relatively small public keys. Public key sizes in SIKE can further be compressed by computing pairings and solving discrete logarithms in certain subgroups of finite fields. This comes at a cost of precomputing and storing large discrete logarithm tables. In this paper, we propose several techniques to optimize memory requirements in computing discrete logarithms in SIKE, and achieve to reduce table sizes by a factor of 4. We implement our techniques and verify our theoretical findings. |
---|
Publication date | 2021-07-15 |
---|
Publisher | Springer |
---|
In | |
---|
Series | |
---|
Language | English |
---|
Peer reviewed | Yes |
---|
Export citation | Export as RIS |
---|
Report a correction | Report a correction (opens in a new tab) |
---|
Record identifier | a4f85c4b-4db7-4a63-8300-c1b38295cde6 |
---|
Record created | 2021-09-10 |
---|
Record modified | 2021-09-13 |
---|