Benchmark Performance of a New Quantum-Safe Multivariate Polynomial Digital Signature Algorithm

Kuang et al. introduced the new quantum-safe algorithm Multivariate Polynomial Public Key Digital Signature (MPPK DS). To create a signature, the MPPK DS scheme’s private key consists of univariate polynomials used as exponents of a secret randomly generated base. For signature verification, the verifier leverages public key multivariate polynomials and a modular arithmetic property. The verification procedure is probabilistic. The verifier uses noise variables and evaluates the public key polynomials. For a genuine signature, the verification procedure is successful for any evaluation of the public key polynomials. In this paper, we report the results of benchmarking MPPK DS on a 16-core Intel®Core™i7-10700 CPU system at 2.90 GHz using the SUPERCOP toolkit. SUPERCOP has been widely used to analyze the performance of post-quantum public-key encryption and key-establishment algorithms. We provide a side-by-side comparison of the NIST PQC third-round digital signature schemes with MPPK DS. With respect to the PQC schemes, the MPPK DS cryptosystem achieves small size public keys, private keys, and signatures. Moreover, compared with the NIST PQC digital signature algorithms, the performance of the MPPK DS algorithm is outstanding with fast procedures for key generation, signing, and verifying.