SearcharxivSearch

arXiv subjects

Anton Menshov

Publications and source records attributed to Anton Menshov.

5 recordsLinked to original sources

Cryptanalysis of Andrecut's public key cryptosystem

We show that a linear decomposition attack based on the decomposition method introduced by the first author in monography "Algebraic cryptography" and in a series of papers works by finding the exchanging key in the Abdrecut's protocol.

math.GR

$p$-solvability of regular equations over unitriangular groups over prime finite fields

An equation over a group with one unknown is called regular if the exponent sum of the unknown is nonzero. In this paper we prove that some regular equations of exponent $rp^s$, where $r \in \mathbb{Z}$, $s \in \mathbb{N}$, $\gcd(r,p)=1$, over the group UT$_n(\mathbb{F}_p)$ ($n \geq 2$) are solvable in an overgroup isomorphic to UT$_{(n-1)p^s + 1}(\mathbb{F}_p)$. Applying this for $n=3$ we prove that any regular equation of exponent $rp^s$ over the Heisenberg $p$-group UT$_3(\mathbb{F}_p)$ is solvable in an overgroup isomorphic to UT$_{2p^s + 1}(\mathbb{F}_p)$. The proofs of these results are constructive and allow to obtain solutions of equations in explicit form.

math.GR

Adjunction of roots to unitriangular groups over prime finite fields

In this paper we study embeddings of unitriangular groups UT$_n(\mathbb{F}_p)$ arising under adjunction of roots. We construct embeddings of UT$_n(\mathbb{F}_p)$ in UT$_m(\mathbb{F}_p)$, for $n \geq 2$, $m=(n-1)p^s + 1$, $s \in \mathbb{Z}^+$, such that any element of UT$_n(\mathbb{F}_p)$ has a $p^s$-th root in UT$_m(\mathbb{F}_p)$. Also we construct an embedding of the wreath product UT$_n(\mathbb{F}_p) \wr C_{p^s}$ in UT$_m(\mathbb{F}_p)$, where $C_{p^s}$ is the cyclic group of order $p^s$.

math.GR

Asymptotic density of rational sets in free abelian groups

In this paper we study asymptotic density of rational sets in free abelian group $\mathbb{Z}^n$ of rank $n$. We show that any rational set $R$ in $\mathbb{Z}^n$ has asymptotic density. If $R$ is given by its semi-simple decomposition we show how to compute its asymptotic density.

math.GR

On systems of equations in free abelian groups

In this paper we study the asymptotic probability that a random system of equations in free abelian group $\mathbb{Z}^m$ of rank $m$ is solvable. Denote $SAT(\mathbb{Z}^m, k, n)$ and $SAT_{\mathbb{Q}^m}(\mathbb{Z}^m, k, n)$ the sets of all systems of $n$ equations in $k$ variables in the group $\mathbb{Z}^m$ solvable in $\mathbb{Z}^m$ and $\mathbb{Q}^m$ respectively. We show that asymptotic density of the set $SAT_{\mathbb{Q}^m}(\mathbb{Z}^m, k, n)$ is equal to $1$ for $n \leq k$, and is equal to $0$ for $n > k$. For $n < k$ we give nontrivial estimates for upper and lower asymptotic densities of the set $SAT(\mathbb{Z}^m, k, n)$. When $n > k$ the set $SAT(\mathbb{Z}^m, k, n)$ is negligible. Also for $n \leq k$ we provide some connection between asymptotic density of the set $SAT(\mathbb{Z}^m, k, n)$ and sums over full rank matrices involving their greatest divisors.

math.GR