Аналіз швидкості розкриття ключа підпису HORS

Abstract

Modern asymmetric cryptography is vulnerable to quantum computing. A possible solution is to use hash-based digital signatures. This class includes various algorithms: one-time and few-time signatures and schemes based on their composition. This paper discusses a reusable signature algorithm with a decrease in the security HORS and speed of key disclosure. The results show that the choice of system parameters determines the number of messages that can be signed without the threat of signature forgery.