IMCS/Publications/BASM/Issues/BASM n.2 (72) -n.3 (73), 2013/

Short signatures from the difficulty of factoring problem

Authors: N. A. Moldovyan, A. A. Moldovyan, Şcerbacov Victor


For some practical applications there is a need of digital signature schemes (DSSes) with short signatures. The paper presents some new DSSes based on the difficulty of the factorization problem, the signature size of them being equal to 160 bits. The signature size is significantly reduced against the known DSS. The proposed DSSes are based on the multilevel exponentiation procedures. Three type of the exponentiation operations are used in the DSSes characterized in performing multiplication modulo different large numbers. As modulus prime and composite numbers are used. The latters are difficult for factoring and have relation with the prime modulus.

N. A. Moldovyan, A. A. Moldovyan
St. Petersburg Institute for Informatics
and Automation of Russian Academy of Sciences
14 Liniya, 39, St.Petersburg 199178
E-mail: ;

V. A. Shcherbacov
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
Academiei str. 5, MD?2028 Chisinau
E-mail: ;


Adobe PDF document0.13 Mb