Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
246 0 |
Căutarea după subiecte similare conform CZU |
512.624.95+519.6 (1) |
Algebră (413) |
Matematică computațională. Analiză numerică. Programarea calculatoarelor (124) |
SM ISO690:2012 MOLDOVYAN, Nikolay. Algebraic signature algorithms with a hidden group, based on hardness of solving systems of quadratic equations. In: Quasigroups and Related Systems, 2022, vol. 30, nr. 2(48), pp. 287-298. ISSN 1561-2848. DOI: https://doi.org/10.56415/qrs.v30.24 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Quasigroups and Related Systems | ||||||
Volumul 30, Numărul 2(48) / 2022 / ISSN 1561-2848 | ||||||
|
||||||
DOI:https://doi.org/10.56415/qrs.v30.24 | ||||||
CZU: 512.624.95+519.6 | ||||||
Pag. 287-298 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
A new-type algebraic digital signature schemes on non-commutative associative algebras are developed using technique of performing exponentiation operations in a hidden group. The signature contains two elements: a randomization integer e and a vector S. The used verification equations are characterized in multiple entries of the signature element S. The post-quantum security of the introduced signature algorithms is provided by the computational difficulty of solving a system of many quadratic equations in many variables, like in the public-key multivariate cryptosystems. However in the former case the quadratic equations are set over the finite fields having the order of significantly larger size. |
||||||
|