Name
Abstract | ||
|---|---|---|
Multivariate Public Key Cryptosystems (MPKCs) are often touted as future-proofing against Quantum Computers. In 2009, it was shown that hardware advances do not favor just "traditional" alternatives such as ECC and RSA, but also makes MPKCs faster and keeps them competitive at 80-bit security when properly implemented. These techniques became outdated due to emergence of new instruction sets and higher requirements on security. In this paper, we review how MPKC signatures changes from 2009 including new parameters (from a newer security level at 128-bit), crypto-safe implementations, and the impact of new AVX2 and AESNI instructions. We also present new techniques on evaluating multivariate polynomials, multiplications of large finite fields by additive Fast Fourier Transforms, and constant time linear solvers. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1587/transfun.E101.A.553 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
MPKC signatures, finite field arithmetic, SIMD, additive FFT | Journal | E101A |
Issue | ISSN | Citations |
3 | 1745-1337 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ming-Shing Chen | 1 | 159 | 9.70 |
| Wen-Ding Li | 2 | 0 | 0.34 |
| Bo-Yuan Peng | 3 | 0 | 0.34 |
| Bo-Yin Yang | 4 | 100 | 9.92 |
| Chen-Mou Cheng | 5 | 8 | 2.53 |