Pseudo Random Number Generator-Based One-Time Signature

With the advancement of quantum computing technologies, there has been increasing focus in recent years on identifying cryptographic methods resilient to quantum attacks and developing post-quantum cryptography (PQC) techniques. Among these, hash-based digital signature algorithms (DSA) represent one category of PQC methods. Hash computations are not only fundamental to digital signatures but also widely employed in pseudorandom number generators (PRNGs). This study proposes a DSA derived from hash-based digital signatures, incorporating modifications to leverage PRNGs for the applications of one-time signature (OTS). The security of the proposed PRNG-based OTS is analyzed, and experimental evaluations are conducted. These experiments compare key length, signature length, key generation time, signature generation time, and signature verification time under various parameter settings to demonstrate the feasibility of the proposed approach. The proposed PRNG-based OTS algorithm can potentially be applied to scenarios such as voting systems in the future.