A method for post-quantum digital signature based on hashing

Abstract

The invention relates to cryptography and information security, specifically to methods for generating and verifying digital signatures that ensure post-quantum stability. The invention can be used in information security systems to protect the integrity and authenticity of messages, including in the face of potential attacks using quantum computing. The proposed method can be applied in various application scenarios, including electronic document management, digital identification, and devices with limited computing resources. The technical result is the development of a post-quantum digital signature method based on cryptographic hash functions, without the use of hash trees. This method addresses two interrelated problems: enabling the reuse of a master secret key without regeneration and reducing the overall volume of key data and digital signatures. A post-quantum digital signature method based on hashing without the use of hash trees is proposed. The method involves selecting system parameters that determine the output length of the cryptographic hash function used and the maximum number of messages to be signed, generating a master secret key, one-time secret keys, and generating and verifying a digital signature. The public key is created by repeatedly hashing the master secret key. A signature is generated by selecting and hashing the components of a signing key derived from a one-time secret key. Authentication of the author is accomplished by comparing the hash result with the public key. Signature verification involves reproducing the steps of its formation and comparing the result with the transmitted signature. The method provides compact keys and signatures, reusability of the master key, resistance to quantum attacks, and application in devices with limited resources.