SOFTWARE IMPLEMENTATION AND EXPERIMENTAL RESEARCH OF BLIND SIGNATURE SCHEMES BASED ON ECC

Abstract

This paper investigates the efficiency of blind digital signature schemes based on Elliptic Curve Cryptography (ECC) compared to classical RSA-based implementations. The relevance of the study is driven by the increasing need for user anonymity in electronic voting systems, digital payments, and other applications requiring a clear distinction between authentication and identification. As part of the research, the Fuh-Gwo Jeng blind signature scheme was implemented using the Python programming language and modern cryptographic libraries. Experimental measurements of the performance of the main protocol phases — blinding, signing, and unblinding — were conducted for the NIST elliptic curves P-256, P-384, and P-521. To ensure objective results, a comparative analysis was performed against an RSA-based blind signature implementation at equivalent cryptographic strength levels. The obtained results demonstrate that the use of ECC significantly improves signature generation efficiency: for the P-256 curve, the average operation time is 7–8 ms, which is approximately 10–12 times faster than RSA-3072. It was established that the reduction in key sizes and computational complexity provides a substantial advantage for ECC in resource-constrained environments.

The scientific novelty lies in the software implementation of the Jeng scheme and the experimental comparison of its performance with RSA across various security levels. The practical significance of the results is the possibility of applying the proposed approach in systems with high requirements for speed and energy efficiency.