| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 860 6 |
| Ultima descărcare din IBN: 2023-01-19 10:03 |
 SM ISO690:2012MOLDOVYAN, Nikolay, SHCHERBACOV, Victor. New signature scheme based on dificulty of finding roots. In: Quasigroups and Related Systems, 2012, vol. 20, nr. 2(28), pp. 261-266. ISSN 1561-2848. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Quasigroups and Related Systems |
||||||
| Volumul 20, Numărul 2(28) / 2012 / ISSN 1561-2848 | ||||||
|
||||||
| Pag. 261-266 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
There are considered two digital signature schemes based on di culty of nding the wth roots in the nite ground elds GF(p). The rst scheme uses the prime value p = Nt0t1t2 1, where N is an even number; t0, t1, t2 are prime numbers such that |t0| t |t1| t |t2| t 80 bits. The public key is de ned as follows Y = Kw1 1 Kw2
2 , where w1 = t0t1 and w2 = t0t2. The second scheme uses the value p = Nt1t2 1, and the public key composed of two values Y1 = Kt1 1 Kt2 2 mod p and Y2 = Kt1 3 Kt2 4 mod p, where four numbers K1, K2, K3, and K4 are the private key. |
||||||
| Cuvinte-cheie cryptography, public key, Digital signature, di cult problem, computing roots |
||||||
|
|
|
|
