Related papers: The MOR cryptosystem and extra-special $p$-groups

This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms p^m, or 2p^m where p is an odd large prime and m is a positive integer. It is another…

In the cohomology ring of an extraspecial p-group, the subring generated by Chern classes and transfers is studied. This subring is strictly larger than the Chern subring, but still not the whole cohomology ring, even modulo nilradical. A…

In this paper, we have computed the automorphism groups of all groups of order $p^{2}q^{2}$, where $p$ and $q$ are distinct primes.

The discrete logarithm is a problem that surfaces frequently in the field of cryptography as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the…

A p-group G is p-central if the central quotient has exponent p. We prove that for a subset of finite p-central p-groups, the order of the group G divides the order of Aut(G).

In this paper we give a classification of the rank two p-local finite groups for odd p. This study requires the analisis of the possible saturated fusion systems in terms of the outer automorphism group ant the proper F-radical subgroups.…

A special p-form is a p-form which, in some orthonormal basis {e_\mu}, has components \phi_{\mu_1...\mu_p} = \phi(e_{\mu_1},..., e_{\mu_p}) taking values in {-1,0,1}. We discuss graphs which characterise such forms.

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime…

We study the action of the Galois group $G$ of a finite extension $K/k$ of number fields on the points on an elliptic curve $E$. For an odd prime $p$, we aim to determine the structure of the $p$-adic completion of the Mordell-Weil group…

Let p>3 be a prime number and let r be an integer with 1<r<p-1. For each r, let moreover G_r denote the unique quotient of the maximal class pro-p group of size p^{r+1}. We show that the mod-p cohomology ring of G_r has depth one and that,…

In this paper, we consider semi-extraspecial $p$-groups $G$ that have an automorphism of order $|G:G'| - 1$. We prove that these groups are isomorphic to Sylow $p$-subgroups of ${\rm SU}_3 (p^{2a})$ for some integer $a$. If $p$ is odd, this…

Properties of the additive differential probability $\mathrm{adp}^{\mathrm{XR}}$ of the composition of bitwise XOR and a bit rotation are investigated, where the differences are expressed using addition modulo $2^n$. This composition is…

For an odd prime number $p$, we consider degree $p$ extensions $L/K$ of $p$-adic fields with normal closure $\widetilde{L}$ such that the Galois group of $\widetilde{L}/K$ is the dihedral group of order $2p$. We shall prove a complete…

In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over…

Given a cryptographic group action, we show that the Group Action Inverse Problem (GAIP) and other related problems cannot be NP-hard unless the Polynomial Hierarchy collapses. We show this via random self-reductions and the design of…

We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for…

In this paper we study the existence of at least one non-inner automorphism of order p of a finite thin p-group, for any prime p.

Let p be an odd prime number. We describe the Whitehead group of all extra-special and almost extra-special p-groups. For this we compute, for any finite p-group P , the subgroup Cl\_1 (ZP) of SK\_1 (ZP), in terms of a genetic basis of P.…

The discrete logarithm problem is one of the backbones in public key cryptography. In this paper we study the discrete logarithm problem in the group of circulant matrices over a finite field. This gives rise to secure and fast public key…

We give a complete list of all the 70 class two groups of exponent p (p>2) and order p^k for k<9. For each of these groups the number of conjugacy classes is a polynomial in p, and the order of the automorphism group is a polynomial in p.…