Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
1027 11 |
Ultima descărcare din IBN: 2024-02-20 16:43 |
Căutarea după subiecte similare conform CZU |
004.056.55 (50) |
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4184) |
SM ISO690:2012 BEREZIN, Andrei, MOLDOVYAN, Nikolay, SHCHERBACOV, Victor. Cryptoschemes Based on Dificulty of
Simultaneous Solving Two Diferent Dificult
Problems. In: Computer Science Journal of Moldova, 2013, nr. 2(62), pp. 280-290. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 2(62) / 2013 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 004.056.55 | ||||||
Pag. 280-290 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
The paper proposes a general method for construction cryp-
toschemes based on dificulty of simultaneous solving factoring
(FP) and discrete logarithm modulo prime problem (DLpP). The
proposed approach is applicable for construction digital signa-
tures (usual, blind, collective), public key encryption algorithms,
public key distribution protocols, and cryptoschemes of other
types. Moreover, the proposed approach provides reducing the
signature size and increasing the rate of the cryptoschemes, while
comparing with the known designs of the digital signature protocols based on the FP and DLpP. |
||||||
Cuvinte-cheie Cryptosystem, Digital signature, public encryption, cryptographic protocol |
||||||
|