Zobrazeno 1 - 5
of 5
pro vyhledávání: '"diagrams in groups"'
Autor:
N. V. Bezverkhniy
Publikováno v:
Matematika i Matematičeskoe Modelirovanie, Vol 0, Iss 4, Pp 1-16 (2017)
In this paper we investigate the structure of the ring diagrams with periodic marks in groups with small cancellation conditions C (3) T (6). These diagrams are used to solve the tasks such as the problem of conjugate words, the problem of conjugate
Externí odkaz:
https://doaj.org/article/f8d7bc95bd3b4943a6d882feafb82712
Autor:
N. V. Bezverkhniy
Publikováno v:
Matematika i Matematičeskoe Modelirovanie, Vol 0, Iss 5, Pp 43-63 (2016)
The paper considers the possibility for building a one-way function in the small cancellation group. Thus, it uses the algorithm to solve the problem for a cyclic subgroup, also known as a discrete logarithm problem, and the algorithm to solve the wo
Externí odkaz:
https://doaj.org/article/3f1b4e66ec73415eb2af6182b8e5b508
Autor:
N. V. Bezverkhniy
Publikováno v:
Matematika i Matematičeskoe Modelirovanie, Vol 0, Iss 5, Pp 43-63 (2015)
The paper considers the possibility for building a one-way function in the small cancellation group. Thus, it uses the algorithm to solve the problem for a cyclic subgroup, also known as a discrete logarithm problem, and the algorithm to solve the wo
Externí odkaz:
https://doaj.org/article/df11d0f050974a0594abe6e5c5936f80
Autor:
Nikolai Bezverhnii
Publikováno v:
Nauka i Obrazovanie, Vol 0, Iss 11, Pp 238-256 (2014)
In this paper we investigate the structure of ring diagrams with periodic labels in groups with small cancellation conditions C(3)-T(6). These diagrams are used to solve the power conjugacy search problem in a cyclic subgroup and the problem of power
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec394ed88c7202bac2c6f2d7d66a20da
http://technomag.edu.ru/jour/article/view/733
http://technomag.edu.ru/jour/article/view/733
Autor:
Olga Chernisheva, Nikolai Bezverhnii
Publikováno v:
Nauka i Obrazovanie, Vol 0, Iss 10, Pp 70-101 (2014)
In this work we are consider a possibility to create schemes of open key distribution in the groups meeting conditions C(3)-T(6). Our constructions use the following algorithms.1. The algorithm that solves the membership problem for cyclic subgroups,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c98e170f9127d2ab080fe43355a3365
http://technomag.edu.ru/jour/article/view/696
http://technomag.edu.ru/jour/article/view/696