| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 909 2 |
| Ultima descărcare din IBN: 2021-12-08 10:01 |
 SM ISO690:2012MOLDOVYAN, Nikolay, MOLDOVYAN, Alexandr, SHCHERBACOV, Victor. Short signatures from the difficulty of factoring problem. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2013, nr. 2-3(73), pp. 27-36. ISSN 1024-7696. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica |
||||||
| Numărul 2-3(73) / 2013 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
| Pag. 27-36 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
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. |
||||||
| Cuvinte-cheie Information authentication, digital signature scheme, short signature, factorization problem, discrete logarithm problem |
||||||
|
|
|
|
