Related papers: A note on using finite non-abelian $p$-groups in t…

In this paper, we completely classify the finite $p$-groups $G$ such that $\Phi(G')G_3\le C_p^2$, $\Phi(G')G_3\le Z(G)$ and $G/\Phi(G')G_3$ is minimal non-abelian. This paper is a part of the classification of finite $p$-groups with a…

We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and discrete log as subroutines. Thus proposed cryptosystems based on the presumed hardness of discrete…

Let $G$ be a finite $p$-group of order $p^n$ and $M(G)$ be its Schur multiplier. It is well known result by Green that $|M(G)|= p^{\frac{1}{2}n(n-1)-t(G)}$ for some $t(G) \geq 0$. In this article we classify non-abelian $p$-groups $G$ of…

We give an analogue of the ElGamal encryption system based on the Markovski algorithm [4; 5].

In this paper, a new variant of ElGamal signature scheme is presented and its security analyzed. We also give, for its theoretical interest, a general form of the signature equation.

We employ tropical algebras as platforms for several cryptographic schemes that would be vulnerable to linear algebra attacks were they based on "usual" algebras as platforms.

We study deformation theory of mod $p$ Galois representations of $p$-adic fields with values in generalised tori, such as $L$-groups of (possibly non-split) tori. We show that the corresponding deformation rings are formally smooth over a…

We prove a cohomological property for a class of finite $p$-groups introduced earlier by M. Y. Xu, which we call semi-abelian $p$-groups. This result implies that a semi-abelian $p$-group has non-inner automorphisms of order $p$, which…

In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…

The mod-p cohomology ring of a non-trivial finite p-group is an infinite dimensional, finitely presented graded unital algebra over the field with p elements, with generators in positive degrees. We describe an effective algorithm to test…

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…

We define the notion of accessibility for a pro-$p$ group. We prove that finitely generated pro-$p$ groups are accessible given a bound on the size of their finite subgroups. We then construct a finitely generated inaccessible pro-$p$…

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

The authors discuss what is provable security in cryptography. Think that provable security is asymptotic, relative, and dynamic, and only a supplement to but not a replacement of exact security analysis. Because the conjecture P != NP has…

We introduce $LoR$, a secure, fully decentralized, and distributed cooperative system, where $LoR$ stands for "the Loop of the Rings". Distinct from conventional transaction-oriented systems, $LoR$ prioritizes {\it cooperation} using its…

Given a fine abelian group grading on a finite dimensional simple Lie algebra over an algebraically closed field of characteristic zero, with universal grading group $G$, it is shown that the induced grading by the free group $G/\tor(G)$ is…

Let $G_1$ be a cyclic multiplicative group of order $n$. It is known that the Diffie-Hellman problem is random self-reducible in $G_1$ with respect to a fixed generator $g$ if $\phi(n)$ is known. That is, given $g, g^x\in G_1$ and having…

In the recently emerging field of nonabelian group-based cryptography, a prominently used one-way function is the Conjugacy Search Problem (CSP), and two important classes of platform groups are polycyclic and matrix groups. In this paper,…

A set of quasi-uniform random variables $X_1,...,X_n$ may be generated from a finite group $G$ and $n$ of its subgroups, with the corresponding entropic vector depending on the subgroup structure of $G$. It is known that the set of entropic…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…