Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
285 15 |
Ultima descărcare din IBN: 2024-03-22 00:19 |
Căutarea după subiecte similare conform CZU |
004.056:519.6 (1) |
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4223) |
Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
SM ISO690:2012 MOLDOVYAN, Dmitriy. A new type of digital signature algorithms with a hidden group. In: Computer Science Journal of Moldova, 2023, vol. 31, nr. 1(91), pp. 111-124. ISSN 1561-4042. DOI: https://doi.org/10.56415/csjm.v31.06 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Volumul 31, Numărul 1(91) / 2023 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
DOI:https://doi.org/10.56415/csjm.v31.06 | ||||||
CZU: 004.056:519.6 | ||||||
Pag. 111-124 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
The known designs of digital signature schemes with a hidden group, which use finite non-commutative algebras as algebraic support, are based on the computational complexity of the so-called hidden discrete logarithm problem. A similar design, used to develop a signature algorithm based on the difficulty of solving a system of many quadratic equations in many variables, is introduced. The significant advantage of the proposed method compared with multivariate-cryptography signature algorithms is that the said system of equations, which occurs as the result of performing the exponentiation operations in the hidden group, has a random look and is specified in a finite field of a higher order. This provides the ability to develop post-quantum signature schemes with significantly smaller public-key sizes at a given level of security. |
||||||
Cuvinte-cheie finite associative algebra, non-commutative algebra, commutative finite group, discrete logarithm problem, hidden logarithm problem, public key, Digital signature, multivariate cryptography, post-quantum cryptosystem |
||||||
|