One-Time Signature Based on Pseudorandom Number Generator

TL;DR

This paper introduces a new one-time signature scheme based on pseudorandom number generators, aiming to enhance post-quantum cryptography by leveraging hash functions in a novel way.

Contribution

It proposes a modified hash-based digital signature algorithm utilizing PRNGs for one-time signatures, expanding the application of hash functions in post-quantum cryptography.

Findings

The PRNG-based OTS scheme is feasible with various parameter settings.

Experimental results show trade-offs between key size, signature length, and computational efficiency.

Security analysis indicates robustness against quantum attacks.

Abstract

With the advancement of quantum computing technologies, recent years have seen increasing efforts to identify cryptographic methods resistant to quantum attacks and to establish post-quantum cryptography (PQC) approaches. Among these, hash-based digital signature algorithms (DSAs) are a notable category of PQC. Hash functions are not only utilized in digital signatures but are also widely applied in pseudorandom number generators (PRNGs). Building on the foundation of hash-based DSAs, this study proposes a modified approach that introduces a DSA based on PRNGs, suitable for one-time signature (OTS) applications. The study explores the security of the proposed PRNG-based OTS algorithm and validates its feasibility through experiments comparing various parameter configurations. These experiments examine key length, signature length, key generation time, signature generation time, and signature verification time under different parameter settings.