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.
Ming-Shing CHEN
National Taiwan University
Wen-Ding LI
Academia Sinica
Bo-Yuan PENG
Academia Sinica
Bo-Yin YANG
Academia Sinica
Chen-Mou CHENG
National Taiwan University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ming-Shing CHEN, Wen-Ding LI, Bo-Yuan PENG, Bo-Yin YANG, Chen-Mou CHENG, "Implementing 128-Bit Secure MPKC Signatures" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 3, pp. 553-569, March 2018, doi: 10.1587/transfun.E101.A.553.
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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.553/_p
Copy
@ARTICLE{e101-a_3_553,
author={Ming-Shing CHEN, Wen-Ding LI, Bo-Yuan PENG, Bo-Yin YANG, Chen-Mou CHENG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Implementing 128-Bit Secure MPKC Signatures},
year={2018},
volume={E101-A},
number={3},
pages={553-569},
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.},
keywords={},
doi={10.1587/transfun.E101.A.553},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Implementing 128-Bit Secure MPKC Signatures
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 553
EP - 569
AU - Ming-Shing CHEN
AU - Wen-Ding LI
AU - Bo-Yuan PENG
AU - Bo-Yin YANG
AU - Chen-Mou CHENG
PY - 2018
DO - 10.1587/transfun.E101.A.553
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2018
AB - 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.
ER -