Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
890 14 |
Ultima descărcare din IBN: 2022-11-11 11:40 |
Căutarea după subiecte similare conform CZU |
004.056.55:511 (1) |
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4184) |
Teoria numerelor (37) |
SM ISO690:2012 MOLDOVYAN, Nikolay. Digital Signature Scheme Based on a New Hard
Problem. In: Computer Science Journal of Moldova, 2008, nr. 2(47), pp. 163-182. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 2(47) / 2008 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 004.056.55:511 | ||||||
Pag. 163-182 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
Factorizing composite number n = qr, where q and r are two
large primes, and finding discrete logarithm modulo large prime
number p are two difficult computational problems which are
usually put into the base of different digital signature schemes
(DSSes). This paper introduces a new hard computational problem that consists in finding the kth roots modulo large prime
p = Nk2 1, where N is an even number and k is a prime
with the length jkj ¸ 160. Difficulty of the last problem is estimated as O(
p
k). It is proposed a new DSS with the public
key y = xk mod p, where x is the private key. The signature
corresponding to some message M represents a pair of the jpj-
bit numbers S and R calculated as follows: R = tk mod p and
S = txf(R;M) mod p, where f(R;M) is a compression function.
The verification equation is Sk mod p = yf(R;M)R mod p. The
DSS is used to implement an efficient protocol for generating
collective digital signatures. |
||||||
|