On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups

Noncommutative cryptography is based on applications of algebraic structures like noncommutative groups, semigroups, and noncommutative rings. Its intersection with Multivariate cryptography contains studies of cryptographic applications of subsemigroups and subgroups of affine Cremona semigroups de...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Datum:2023
Hauptverfasser: Ustimenko, V., Klisowski, M.
Format: Artikel
Sprache:English
Veröffentlicht: Lugansk National Taras Shevchenko University 2023
Schlagworte:
Online Zugang:https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1523
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Algebra and Discrete Mathematics

Institution

Algebra and Discrete Mathematics
Beschreibung
Zusammenfassung:Noncommutative cryptography is based on applications of algebraic structures like noncommutative groups, semigroups, and noncommutative rings. Its intersection with Multivariate cryptography contains studies of cryptographic applications of subsemigroups and subgroups of affine Cremona semigroups defined over finite commutative rings. Efficiently computed homomorphisms between stable subsemigroups of affine Cremona semigroups can be used in tame homomorphisms protocols schemes and their inverse versions. The implementation scheme with the sequence of subgroups of affine Cremona group that defines the projective limit was already suggested. We present the implementation of another scheme that uses two projective limits which define two different infinite groups and the homomorphism between them. The security of the corresponding algorithm is based on complexity of the decomposition problem for an element of affine Cremona semigroup into a product of given generators. These algorithms may be used in postquantum technologies.