Alexander Ushakov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alexander Ushakov has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Andrey Nikolaev
Stevens Institute of Technology 07030 Hoboken NJ US
6 shared publications - Matvei Kotov
Stevens Institute of Technology
4 shared publications Alexei Myasnikov
3 shared publications- Alexei Myasnikov
Stevens Institute of Technology, Hoboken, USA
3 shared publications - Alexey D. Myasnikov
Department of Mathematics, Stevens Institute of Technology, Hoboken, NJ 07030, USA
3 shared publications Andrey Nikolaev
3 shared publications
Latest Publications
- 2 September 2026
- Published by Elsevier in Journal of Algebra
- Vol. 708, 492-529
One-variable equations over the lamplighter group
- 2 September 2026
- Published by Elsevier in Journal of Algebra
- Vol. 708, 492-529
One-variable equations over the lamplighter group
- 2 February 2026
- Published by Elsevier in Journal of Algebra
- Vol. 694, 324-358
Orientable quadratic equations in wreath products of abelian groups
- 2 February 2026
- Published by Elsevier in Journal of Algebra
- Vol. 694, 324-358
Orientable quadratic equations in wreath products of abelian groups
- Open Access
- 4 December 2025
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Groups - Complexity - Cryptology
- Vol. ume 17, Is
Kahrobaei--Koupparis DSS: universal forgery
Regardless of the choice of parameters, knowledge of a single signed message, i.e., a pair message/signature, produced by Kahrobaei-Koupparis digital signature scheme, proposed in [D. Kahrobaei and C. Koupparis, 2012], is sufficient to forge a valid signature for any other message.
- 4 December 2025
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Groups - Complexity - Cryptology
- Vol. ume 17, Is
Open AccessKahrobaei--Koupparis DSS: universal forgery
Regardless of the choice of parameters, knowledge of a single signed message, i.e., a pair message/signature, produced by Kahrobaei-Koupparis digital signature scheme, proposed in [D. Kahrobaei and C. Koupparis, 2012], is sufficient to forge a valid signature for any other message.
- Open Access
Kahrobaei--Koupparis DSS: universal forgery
Regardless of the choice of parameters, knowledge of a single signed message, i.e., a pair message/signature, produced by Kahrobaei-Koupparis digital signature scheme, proposed in [1], is sufficient to forge a valid signature for any other message.
Open AccessKahrobaei--Koupparis DSS: universal forgery
Regardless of the choice of parameters, knowledge of a single signed message, i.e., a pair message/signature, produced by Kahrobaei-Koupparis digital signature scheme, proposed in [1], is sufficient to forge a valid signature for any other message.
- 9 December 2024
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 129
Quadratic equations in the lamplighter group
- 9 December 2024
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 129
Quadratic equations in the lamplighter group
- Open Access
- 9 July 2024
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Groups - Complexity - Cryptology
- Vol. ume 16, Is (1)
Constrained inhomogeneous spherical equations: average-case hardness
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 \rtimes \mathbb{Z}_p^\ast$, where $n\in\mathbb{N}$ and $p$ is prime. We prove that the problem of finding solutions for certain constrained spherical equations is computationally hard on average (assuming that some lattice approximation problem is hard in the worst case).- 9 July 2024
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Groups - Complexity - Cryptology
- Vol. ume 16, Is (1)
Open AccessConstrained inhomogeneous spherical equations: average-case hardness
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 \rtimes \mathbb{Z}_p^\ast$, where $n\in\mathbb{N}$ and $p$ is prime. We prove that the problem of finding solutions for certain constrained spherical equations is computationally hard on average (assuming that some lattice approximation problem is hard in the worst case). - 7 February 2024
- Published by Springer Nature
- p. 383-397
Complexity of Spherical Equations in Finite Groups
- 7 February 2024
- Published by Springer Nature
- p. 383-397
Complexity of Spherical Equations in Finite Groups
- 4 September 2023
- Published by Elsevier in Journal of Algebra
- Vol. 636, 779-803
The Diophantine problem for systems of algebraic equations with exponents
- 4 September 2023
- Published by Elsevier in Journal of Algebra
- Vol. 636, 779-803
The Diophantine problem for systems of algebraic equations with exponents
- Open Access
Quadratic equations in metabelian Baumslag-Solitar groups
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 this paper, we investigate the algorithmic complexity of the Diophantine problem for the class $\mathcal{C}$ of quadratic equations over the metabelian Baumslag-Solitar groups $\mathbf{BS}(1,n)$. We prove that this problem is $\mathbf{NP}$-complete whenever $n\neq \pm 1$, and determine the algorithmic complexity for various subclasses (orientable, nonorientable etc.) of $\mathcal{C}$.Open AccessQuadratic equations in metabelian Baumslag-Solitar groups
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 this paper, we investigate the algorithmic complexity of the Diophantine problem for the class $\mathcal{C}$ of quadratic equations over the metabelian Baumslag-Solitar groups $\mathbf{BS}(1,n)$. We prove that this problem is $\mathbf{NP}$-complete whenever $n\neq \pm 1$, and determine the algorithmic complexity for various subclasses (orientable, nonorientable etc.) of $\mathcal{C}$. - Open Access
The Diophantine problem for systems of algebraic equations with exponents
Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as an \emph{algebraic equation with exponents}. We prove that the problem to decide if a given equation has an integer solution is $\textbf{NP}$-complete, and that the same holds for systems of equations (whether $\alpha$ is fixed or given as part of the input). Furthermore, we describe the set of all solutions for a given system of algebraic equations with exponents and prove that it is semilinear.Open AccessThe Diophantine problem for systems of algebraic equations with exponents
Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as an \emph{algebraic equation with exponents}. We prove that the problem to decide if a given equation has an integer solution is $\textbf{NP}$-complete, and that the same holds for systems of equations (whether $\alpha$ is fixed or given as part of the input). Furthermore, we describe the set of all solutions for a given system of algebraic equations with exponents and prove that it is semilinear.