Zobrazeno 1 - 10
of 200
pro vyhledávání: '"Ushakov Alexander"'
Publikováno v:
Journal of Mathematical Cryptology, Vol 17, Iss 1, Pp 1-5 (2023)
In this article, we analyze two digital signature schemes, proposed in Moldovyan et al., that use finite noncommutative associative algebras as underlying platforms. We prove that these schemes do not possess the claimed property of being quantum saf
Externí odkaz:
https://doaj.org/article/eff3810a14e2465aa98349b5a2527414
Publikováno v:
Journal of Mathematical Cryptology, Vol 15, Iss 1, Pp 237-249 (2020)
We analyze security properties of a two-party key-agreement protocol recently proposed by I. Anshel, D. Atkins, D. Goldfeld, and P. Gunnels, called Kayawood protocol. At the core of the protocol is an action (called E-multiplication) of a braid group
Externí odkaz:
https://doaj.org/article/98616d0613c2462aa79c785be0633976
Publikováno v:
E3S Web of Conferences, Vol 431, p 02023 (2023)
The issues of improving the exploitation properties of renewable energy equipment are considered. The concept of improving power electronics and the design of a wind farm is defined. A model and algorithms for controlling the power of an electric gen
Externí odkaz:
https://doaj.org/article/23de04ce9e7d4369aeb0703ba289cb74
Autor:
Ushakov, Alexander
Publikováno v:
journal of Groups, complexity, cryptology, Volume 16, Issue 1 (July 9, 2024) gcc:13555
In this paper we analyze computational properties of the Diophantine problem (and its search variant) for spherical equations $\prod_{i=1}^m z_i^{-1} c_i z_i = 1$ (and its variants) over the class of finite metabelian groups $G_{p,n}=\mathbb{Z}_p^n \
Externí odkaz:
http://arxiv.org/abs/2405.03591
Autor:
Kotov Matvei, Ushakov Alexander
Publikováno v:
Journal of Mathematical Cryptology, Vol 12, Iss 3, Pp 137-141 (2018)
In this paper, we consider a two party key-exchange protocol proposed in [D. Grigoriev and V. Shpilrain, Tropical cryptography, Comm. Algebra 43 (2014), 2624–2632, Section 2], which uses tropical matrix algebra as the platform. Our analysis shows t
Externí odkaz:
https://doaj.org/article/9cd202dc094c42bebeeb02ed10abade6
Autor:
Ushakov, Alexander, Weiers, Chloe
In this paper we study the complexity of solving quadratic equations in the lamplighter group. We give a complete classification of cases (depending on genus and other characteristics of a given equation) when the problem is $\mathbf{NP}$-complete or
Externí odkaz:
http://arxiv.org/abs/2401.08589
In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when $G$ is a pa
Externí odkaz:
http://arxiv.org/abs/2308.12841
Autor:
Kotov Matvei, Ushakov Alexander
Publikováno v:
Journal of Mathematical Cryptology, Vol 9, Iss 3, Pp 161-167 (2015)
We investigate security properties of the Anshel–Anshel–Goldfeld commutator key-establishment protocol [Math. Res. Lett. 6 (1999), 287–291] used with certain polycyclic groups described by Eick and Kahrobaei [http://arxiv.org/abs/math.GR/041107
Externí odkaz:
https://doaj.org/article/6f9f8032f99047ab93b6494935dc33e2
Autor:
Myasnikov Alex D., Ushakov Alexander
Publikováno v:
Journal of Mathematical Cryptology, Vol 8, Iss 2, Pp 95-114 (2014)
In this paper we cryptanalyze two protocols: the Grigoriev–Shpilrain authentication protocol and a public key cryptosystem due to Wang, Wang, Cao, Okamoto and Shao. Both of these protocols use the computational hardness of some variations of the co
Externí odkaz:
https://doaj.org/article/13c6d23ec4ea4d12bd6ca09e8f61a2ab
Autor:
Mandel, Richard, Ushakov, Alexander
For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in $G$. In th
Externí odkaz:
http://arxiv.org/abs/2302.06974