Affiliation:
1. St. Petersburg Federal Research Center of the Russian Academy of Sciences (SPC RAS), 39, 14th Line V.O., 199178 St. Petersburg, Russia
Abstract
To eliminate the limitations of signature randomization in known algebraic algorithms with a hidden group, the security of which is based on the computational complexity of solving large systems of power equations, a method for ensuring complete randomization is proposed. Based on this method, a new algorithm of the indicated type was developed, using a four-dimensional finite non-commutative associative algebra as an algebraic basis. We obtained estimates of the security of algorithms to direct attacks as well as from attacks based on known signatures, which confirm the effectiveness of the proposed signature randomization method. Due to the relatively small size and signature of the public and private keys, the developed algorithm is of interest as a potential practical post-quantum digital signature scheme.
Funder
Russian Science Foundation
Reference20 articles.
1. Cheon, J.H., and Johansson, T. (2022, January 28–30). Post-Quantum Cryptography. Proceedings of the 13th International Conference, PQCrypto 2022, Virtual Event.
2. Johansson, T., and Smith-Tone, D. (2023, January 16–18). Post-Quantum Cryptography. Proceedings of the 14th International Conference, PQCrypto 2023, College Park, MD, USA.
3. Announcing Request for Nominations for Public-Key Post-Quantum Cryptographic Algorithms;Kimball;Fed. Regist.,2016
4. Alagic, G., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y., Miller, C., Moody, D., and Peralta, R. (2022). Status Report on the Third Round of the NIST Post-Quantum Cryptography Standardization Process, NIST Interagency/Internal Report (NISTIR), National Institute of Standards and Technology.
5. Quantum computation and Shor’s factoring algorithm;Ekert;Rev. Mod. Phys.,1996