{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T10:42:44Z","timestamp":1769078564095,"version":"3.49.0"},"reference-count":48,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T00:00:00Z","timestamp":1734220800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>This paper introduces a novel approach based on matrix multiplication in Fpn\u00d7n, which enables methods for public key exchange, user authentication, digital signatures, blockchain integration, and homomorphic encryption. Unlike traditional algorithms that rely on integer factorization or discrete logarithms, our approach utilizes matrix factorization, rendering it resistant to current quantum cryptanalysis techniques. This method enhances confidentiality by ensuring secure communication and facilitating user authentication through public key validation. We have incorporated a method that allows a Certification Authority to certify the public keys. Furthermore, the incorporation of digital signatures ensures nonrepudiation, while the system functions as a blockchain technology to enhance transaction security. A key innovation of this approach is its capability to perform homomorphic encryption. Our approach has practical applications in artificial intelligence, robotics, and image processing.<\/jats:p>","DOI":"10.3390\/cryptography8040056","type":"journal-article","created":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T10:08:53Z","timestamp":1734343733000},"page":"56","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Matrix Multiplication Approach to Quantum-Safe Cryptographic Systems"],"prefix":"10.3390","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5109-2927","authenticated-orcid":false,"given":"Luis Adri\u00e1n","family":"Lizama-P\u00e9rez","sequence":"first","affiliation":[{"name":"Departamento de Electr\u00f3nica, Universidad T\u00e9cnica Federico Santa Mar\u00eda, Av. Vicu\u00f1a Mackenna 3939, San Joaqu\u00edn, Santiago 8940897, Chile"}]}],"member":"1968","published-online":{"date-parts":[[2024,12,15]]},"reference":[{"key":"ref_1","unstructured":"Shor, P.W. (1994, January 20\u201322). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_2","unstructured":"Barreno, M.A. (2002). The future of cryptography under quantum computers. Dartmouth College Computer Science Technical Reports, Dartmouth College."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J. (2009). Introduction to post-quantum cryptography. Post-Quantum Cryptography, Springer.","DOI":"10.1007\/978-3-540-88702-7"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Ajtai, M. (1996, January 22\u201324). Generating hard instances of lattice problems. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237838"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Pipher, J., and Silverman, J.H. (1998, January 21\u201325). NTRU: A ring-based public key cryptosystem. Proceedings of the International Algorithmic Number Theory Symposium, Portland, OR, USA.","DOI":"10.1007\/BFb0054868"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Buchmann, J., Dahmen, E., and H\u00fclsing, A. (December, January 29). XMSS-a practical forward secure signature scheme based on minimal security assumptions. Proceedings of the Post-Quantum Cryptography: 4th International Workshop, PQCrypto 2011, Taipei, Taiwan. Proceedings 4.","DOI":"10.1007\/978-3-642-25405-5_8"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Hopwood, D., H\u00fclsing, A., Lange, T., Niederhagen, R., Papachristodoulou, L., Schneider, M., Schwabe, P., and Wilcox-O\u2019Hearn, Z. (2015, January 26\u201330). SPHINCS: Practical stateless hash-based signatures. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria.","DOI":"10.1007\/978-3-662-46800-5_15"},{"key":"ref_8","first-page":"114","article-title":"A public-key cryptosystem based on algebraic","volume":"4244","author":"McEliece","year":"1978","journal-title":"Coding Thv"},{"key":"ref_9","first-page":"157","article-title":"Knapsack-type cryptosystems and algebraic coding theory","volume":"15","author":"Niederreiter","year":"1986","journal-title":"Prob. Contr. Inform. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Matsumoto, T., and Imai, H. (1988, January 25\u201327). Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. Proceedings of the Advances in Cryptology\u2014EUROCRYPT\u201988: Workshop on the Theory and Application of Cryptographic Techniques, Davos, Switzerland. Proceedings 7.","DOI":"10.1007\/3-540-45961-8_39"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Ding, J., and Schmidt, D. (2005, January 7\u201310). Rainbow, a new multivariable polynomial signature scheme. Proceedings of the International Conference on Applied Cryptography and Network Security, New York, NY, USA.","DOI":"10.1007\/11496137_12"},{"key":"ref_12","unstructured":"Jao, D., and De Feo, L. (December, January 29). Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. Proceedings of the International Workshop on Post-Quantum Cryptography, Taipei, Taiwan."},{"key":"ref_13","unstructured":"Advanced Encryption Standard (AES) (2001). Federal Information Processing Standards Publication 197, National Institute of Standards and Technology. FIPS PUB."},{"key":"ref_14","unstructured":"Campagna, M., Hardjono, T., Pintsov, L., Romansky, B., and Yu, T. (2013, January 26\u201327). Kerberos revisited quantum-safe authentication. Proceedings of the ETSI Quantum-Safe-Crypto Workshop, Sophia Antipolis, France."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1038\/nature23461","article-title":"Post-quantum cryptography","volume":"549","author":"Bernstein","year":"2017","journal-title":"Nature"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"142413","DOI":"10.1109\/ACCESS.2020.3013250","article-title":"A comparison of security and its performance for key agreements in post-quantum cryptography","volume":"8","author":"Borges","year":"2020","journal-title":"IEEE Access"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00200-013-0185-0","article-title":"Improved algorithm for the isogeny problem for ordinary elliptic curves","volume":"24","author":"Galbraith","year":"2013","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Castryck, W., and Decru, T. (2023, January 23\u201327). An efficient key recovery attack on SIDH. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France.","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","article-title":"On lattices, learning with errors, random linear codes, and cryptography","volume":"56","author":"Regev","year":"2009","journal-title":"JACM"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Nguyen, T.T., Nguyen, T.T.B., and Lee, H. (2022). An Analysis of Hardware Design of MLWE-Based Public-Key Encryption and Key-Establishment Algorithms. Electronics, 11.","DOI":"10.3390\/electronics11060891"},{"key":"ref_21","unstructured":"(2023). Module-Lattice-Based Key-Encapsulation Mechanism Standard. Federal Information Processing Standards Publication (Standard No. FIPS 203)."},{"key":"ref_22","first-page":"688","article-title":"A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem","volume":"2012","author":"Ding","year":"2012","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref_23","unstructured":"Bennett Ch, H., and Brassard, G. (1984, January 10\u201312). Quantum cryptography: Public key distribution and coin tossing Int. Proceedings of the International Conference on Computers, Systems & Signal Processing, Bangalore, India."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_25","unstructured":"Dutta, R., and Barua, R. (2005). Overview of key agreement protocols. Cryptol. ePrint Arch., Available online: https:\/\/eprint.iacr.org\/2005\/289."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Kahrobaei, D., Koupparis, C., and Shpilrain, V. (2013). Public key exchange using matrices over group rings. arXiv.","DOI":"10.1515\/gcc-2013-0007"},{"key":"ref_27","unstructured":"Miller, V.S. (1985, January 9\u201311). Use of elliptic curves in cryptography. Proceedings of the Conference on the Theory and Application of Cryptographic Techniques, Linz, Austria."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","article-title":"Elliptic curve cryptosystems","volume":"48","author":"Koblitz","year":"1987","journal-title":"Math. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Grigoriev, D., and Ponomarenko, I. (2005). Constructions in public-key cryptography over matrix groups. arXiv.","DOI":"10.1090\/conm\/418\/07949"},{"key":"ref_30","unstructured":"Chefranov, A.G., and Mahmoud, A.Y. (2013). Commutative matrix-based Diffie-Hellman-like key-exchange protocol. Information Sciences and Systems 2013: Proceedings of the 28th International Symposium on Computer and Information Sciences, Paris, France, 28\u201329 October 2013, Springer."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/ICITA.2005.33","article-title":"A new method for exchanging secret keys","volume":"Volume 2","author":"Stickel","year":"2005","journal-title":"Proceedings of the Third International Conference on Information Technology and Applications (ICITA\u201905)"},{"key":"ref_32","unstructured":"Myasnikov, A., Shpilrain, V., and Ushakov, A. (2008). Group-Based Cryptography, Springer Science & Business Media."},{"key":"ref_33","unstructured":"Shpilrain, V. (2008, January 7\u201312). Cryptanalysis of Stickel\u2019s key exchange scheme. Proceedings of the International Computer Science Symposium in Russia, Moscow, Russia."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"287","DOI":"10.4310\/MRL.1999.v6.n3.a3","article-title":"An algebraic method for public-key cryptography","volume":"6","author":"Anshel","year":"1999","journal-title":"Math. Res. Lett."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"ElGamal","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_36","first-page":"218","article-title":"Asymmetric cipher protocol using conjugacy and discrete logarithm problem","volume":"50","author":"Raulynaitis","year":"2009","journal-title":"Liet. Mat. Rink."},{"key":"ref_37","first-page":"1113","article-title":"Design Of Public-Key Cryptosystems Based On Matrices Discrete Logarithm Problem","volume":"20","author":"Sagheer","year":"2012","journal-title":"J. Univ. Babylon"},{"key":"ref_38","unstructured":"Margalit, D., Rabinoff, J., and Rolen, L. (2017). Interactive Linear Algebra, Georgia Institute of Technology."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_40","unstructured":"Lancaster, P., and Tismenetsky, M. (1985). The Theory of Matrices: With Applications, Elsevier."},{"key":"ref_41","unstructured":"Ben-Israel, A., and Greville, T.N. (2003). Generalized Inverses: Theory and Applications, Springer Science & Business Media."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Meckes, E.S., and Meckes, M.W. (2018). Linear Algebra, Cambridge University Press.","DOI":"10.1017\/9781316823200"},{"key":"ref_43","first-page":"1","article-title":"CRYSTALS-Kyber algorithm specifications and supporting documentation","volume":"2","author":"Avanzi","year":"2019","journal-title":"NIST PQC Round"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/TC.2022.3222954","article-title":"High-speed hardware architectures and FPGA benchmarking of CRYSTALS-Kyber, NTRU, and Saber","volume":"72","author":"Dang","year":"2022","journal-title":"IEEE Trans. Comput."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Harmalkar, M., Jain, K., and Krishnan, P. (2024, January 18\u201319). A Survey of Post Quantum Key Encapsulation Mechanism. Proceedings of the 2024 5th International Conference on Mobile Computing and Sustainable Informatics (ICMCSI), Lalitpur, Nepal.","DOI":"10.1109\/ICMCSI61536.2024.00028"},{"key":"ref_46","unstructured":"Marchsreiter, D. (2024). Towards Quantum-Safe Blockchain: Exploration of PQC and Public-key Recovery on Embedded Systems. Cryptol. ePrint Arch., Available online: https:\/\/eprint.iacr.org\/2024\/1178."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Duan, R., Wu, H., and Zhou, R. (2023, January 6\u20139). Faster matrix multiplication via asymmetric hashing. Proceedings of the 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), Santa Cruz, CA, USA.","DOI":"10.1109\/FOCS57990.2023.00130"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Williams, V.V., Xu, Y., Xu, Z., and Zhou, R. (2024, January 7\u201310). New bounds for matrix multiplication: From alpha to omega. Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Alexandria, VA, USA.","DOI":"10.1137\/1.9781611977912.134"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/8\/4\/56\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:55:41Z","timestamp":1760115341000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/8\/4\/56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,15]]},"references-count":48,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["cryptography8040056"],"URL":"https:\/\/doi.org\/10.3390\/cryptography8040056","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,15]]}}}