EUVIMEDEUVIMED entdecken
Crossref

Algebraic signature algorithms with a hidden group group, based on hardness of solving systems of quadratic equations

Nikolay Moldovyan

Quasigroups and Related Systems · 2023

DOI: 10.56415/qrs.v30.24 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Quasigroups and Related Systems, 2023. Verfasst von Nikolay Moldovyan. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 18 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Moldovyan, N. (2023). Algebraic signature algorithms with a hidden group group, based on hardness of solving systems of quadratic equations. Quasigroups and Related Systems. https://doi.org/10.56415/qrs.v30.24

Vancouver

Moldovyan N. Algebraic signature algorithms with a hidden group group, based on hardness of solving systems of quadratic equations. Quasigroups and Related Systems. 2023. doi:10.56415/qrs.v30.24

BibTeX
@article{Moldovyan2023,
  author = {Moldovyan, Nikolay},
  title = {Algebraic signature algorithms with a hidden group group, based on hardness of solving systems of quadratic equations},
  journal = {Quasigroups and Related Systems},
  year = {2023},
  doi = {10.56415/qrs.v30.24}
}
Kostenlos starten →