|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2013, Number 2-3, Pages 27–36
(Mi basm336)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Short signatures from the difficulty of factoring problem
N. A. Moldovyana, A. A. Moldovyana, V. A. Shcherbacovb a St. Petersburg Institute for Informatics and Automation of Russian Academy of Sciences, 14 Liniya, 39, St. Petersburg, 199178 Russia
b Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Academiei str. 5, MD–2028 Chişinău, Moldova
Abstract:
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.
Keywords and phrases:
information authentication, digital signature scheme, short signature, factorization problem, discrete logarithm problem.
Received: 29.11.2012
Citation:
N. A. Moldovyan, A. A. Moldovyan, V. A. Shcherbacov, “Short signatures from the difficulty of factoring problem”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2013, no. 2-3, 27–36
Linking options:
https://www.mathnet.ru/eng/basm336 https://www.mathnet.ru/eng/basm/y2013/i2/p27
|
Statistics & downloads: |
Abstract page: | 598 | Full-text PDF : | 48 | References: | 46 |
|