Name
Abstract | ||
|---|---|---|
Among the candidates for NIST's post-quantum cryptography standardization project, cryptosystems that rely on Low Rank Parity Check (LRPC) codes have interesting properties, such as a low public key size. However, the key generation phase for these cryptosystems is computationally expensive when done in constant-time, which is a security requirement on the standardization project, making it almost unusable for ephemeral key generation. We present a new constant-time algorithm for key generation on LRPC code-based cryptosystems, that divides the computational costs by four when compared to previous work over ROLLO, one of the NIST candidates. Our improvement consists in changing the way objects of a quotient ring are represented. By switching from a canonical basis to an optimal normal basis, we enable the full potential of the Itoh-Tsuiji algorithm for field inversion. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/ISIT45174.2021.9518250 | 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Aguilar Melchor | 1 | 266 | 20.27 |
| Nicolas Aragon | 2 | 5 | 2.82 |
| Victor Dyseryn | 3 | 0 | 0.34 |
| Philippe Gaborit | 4 | 700 | 56.29 |