Abstract
This paper presents the results of benchmarking the quantum-safe Multivariate Public Key Cryptosystem (MPPK) key encapsulation mechanism for quadratic solvable univariate polynomials. We used a benchmarking tool containing implementations of the four NIST Post-Quantum Cryptography (PQC) finalists: Kyber, McEliece, NTRU, and Saber. The benchmark demonstrates that the performance of MPPK is comparable with that of the four PQC algorithms, offering relatively fast key generation and small key sizes. Key encapsulation and decapsulation performance are comparable with the PQC schemes, with room for improvement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Avanzi, R., et al.: Crystals-Kyber algorithm specifications and supporting documentation. NIST PQC Round 2, 4 (2017)
Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Info. Theory 24(3), 384–386 (1978)
Bourgain, J., Konyagin, S.V., Shparlinski, I.E.: Character sums and deterministic polynomial root finding in finite fields. Math. Comput. 84(296), 2969–2977 (2015)
Ding, J., Yang, B.Y.: Multivariate Public Key Cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 193–241. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-88702-7_6
Garey, M.R., Johnson, D.S.: Computers and intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., USA (1990)
Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267–288. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0054868
Kuang, R.: A deterministic polynomial public key algorithm over a prime Galois Field GF (p). In: 2021 2nd Asia Conference on Computers and Communications (ACCC), pp. 79–88. IEEE (2021)
Kuang, R., Barbeau, M.: Indistinguishability and non-deterministic encryption of the quantum safe multivariate polynomial public key cryptographic system. In: 2021 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE), pp. 1–5. IEEE (2021)
Kuang, R., Barbeau, M.: Performance analysis of the quantum safe multivariate polynomial public key algorithm. In: 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 351–358. IEEE (2021)
Kuang, R., Perepechaenko, M., Barbeau, M.: A new post-quantum multivariate polynomial public key encapsulation algorithm. Quantum Inf. Process. 21, 360 (2022). https://doi.org/10.1007/s11128-022-03712-5
McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Deep Space Netw. Progress Rep. 44, 114–116 (1978)
NIST: Post-quantum cryptography (2021). https://csrc.nist.gov/projects/post-quantum-cryptography. Accessed 22 June 2022
NIST: Status report on the second round of the NIST post-quantum cryptography standardization process (2021). https://csrc.nist.gov/publications/detail/nistir/8309/final. Accessed 22 June 2022
Shoup, V.: On the deterministic complexity of factoring polynomials over finite fields. Inf. Process. Lett. 33(5), 261–267 (1990)
Redpine Signals, Inc. – RS9113 FIPS 140–2 Module Non-proprietary Security Policy Version 1.0 (2016). https://csrc.nist.rip/groups/STM/cmvp/documents/140-1/140sp/140sp2548.pdf. Accessed 22 Apr 2022
Sun, G., Su, S., Xu, M.: Quantum algorithm for polynomial root finding problem. In: 2014 Tenth International Conference on Computational Intelligence and Security, pp. 469–473 (2014)
VAMPIRE: eBACS: ECRYPT Benchmarking of Cryptographic Systems - SUPERCOP. https://bench.cr.yp.to/supercop.html. Accessed: 2022-40-10
Vercauteren, I.F.: SABER: Mod-LWR based KEM (Round 3 Submission) (2017). https://www.esat.kuleuven.be/cosic/pqcrypto/saber/files/saberspecround3.pdf. Accessed 21 June 2022
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kuang, R., Perepechaenko, M., Toth, R., Barbeau, M. (2023). Benchmark Performance of the Multivariate Polynomial Public Key Encapsulation Mechanism. In: Kallel, S., Jmaiel, M., Zulkernine, M., Hadj Kacem, A., Cuppens, F., Cuppens, N. (eds) Risks and Security of Internet and Systems. CRiSIS 2022. Lecture Notes in Computer Science, vol 13857. Springer, Cham. https://doi.org/10.1007/978-3-031-31108-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-031-31108-6_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-31107-9
Online ISBN: 978-3-031-31108-6
eBook Packages: Computer ScienceComputer Science (R0)