Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
385 27 |
Ultima descărcare din IBN: 2023-11-26 19:04 |
Căutarea după subiecte similare conform CZU |
004.056+519.254 (1) |
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4156) |
Probabilitate. Statistică matematică (80) |
SM ISO690:2012 MOLDOVYAN, Dmitriy. A practical digital signature scheme based on the hidden logarithm problem. In: Computer Science Journal of Moldova, 2021, nr. 2(86), pp. 206-226. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | |
Numărul 2(86) / 2021 / ISSN 1561-4042 /ISSNe 2587-4330 | |
|
|
CZU: 004.056+519.254 | |
MSC 2010: 68P25, 68Q12, 68R99, 94A60, 16Z05, 14G50 | |
Pag. 206-226 | |
Descarcă PDF | |
Rezumat | |
A candidate for practical post-quantum digital signature algorithm based on computational difficulty of the hidden discrete logarithm problem is introduced. The used algebraic carrier represents a 4-dimensional finite non-commutative associative algebra defined over the field GF(p), which is caracterized in using a sparse basis vector multiplication table for defining the vector multiplication operation. Structure of the algebra is studied. Three types of the commutative groups are contained in the algebra and formulas for number of groups of every type are obtained. One of the types represents groups of the order (p−1)2, possessing 2-dimensional cyclicity, and one of them is used as a hidden group in the signature scheme developed using a new method for implementing a general criterion of post-quantum resistance proposed earlier. |
|
Cuvinte-cheie finite associative algebra, non-commutative algebra, commutative finite group, discrete logarithm problem, hidden logarithm problem, public key, Digital signature, postquantum cryptosystem |
|
|