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

This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…

Since their introduction in 2004, Polynomial Modular Number Systems (PMNS) have become a very interesting tool for implementing cryptosystems relying on modular arithmetic in a secure and efficient way. However, while their implementation…

We consider finite dimensional representations of the dihedral group $D_{2p}$ over an algebraically closed field of characteristic two where $p$ is an odd integer and study the degrees of generating and separating polynomials in the…

Let $\mathcal{A}$ be an abelian variety over a number field, with a good reduction at a prime ideal containing a prime number $p$. Denote by ${\rm A}$ an abelian variety over a finite field of characteristic $p$, obtained by the reduction…

We investigate the computational complexity of the discrete logarithm, the computational Diffie-Hellman and the decisional Diffie-Hellman problems in some identity black-box groups G_{p,t}, where p is a prime number and t is a positive…

Let $p$ be an odd prime, and let $n\in \N$ be an integer. We show that the $n^{\text{th}}$ mod-$p$ cohomology of a solvable saturable pro-$p$ group is isomorphic to the $n^{\text{th}}$ mod-$p$ cohomology of its associated $\Z_p$-Lie algebra…

In this paper we present new examples of simple $p$-local compact groups for all odd primes. We also develop the necessary tools to show saturation, simpleness and the non-realizability as $p$-compact groups or compact Lie groups, which can…

We extend the notion of free $p$-central groups for odd primes $p$ to the case $p=2$ by introducing a variant of the lower $p$-central series. This enables us to calculate Schur multipliers of free $p$-central groups. We also prove that for…

The discrete logarithm problem (DLP) over finite fields, commonly used in classical cryptography, has no known polynomial-time algorithm on classical computers. However, Shor has provided its polynomial-time algorithm on quantum computers.…

This paper presents an analysis of primitive permutation groups of degree $3p$, where $p$ is a prime number, analogous to H. Wielandt's treatment of groups of degree $2p$. It is also intended as an example of the systematic use of…

A finite group G is exceptional if it has a quotient Q whose minimal faithful permutation degree is greater than that of G. We say that Q is a distinguished quotient. The smallest examples of exceptional p-groups have order p^5. For an odd…

The braid group is an important non commutative group, at the same time, it is an important tool in quantum field theory with better topological structure, and often used as a research carrier for anti-quantum cryptographic algorithms. This…

The non-abelian groups with abelian group of automorphisms are widely studied. Following Earnley, such groups are called Miller groups, since the first example of such a group was given by Miller in 1913. Many other examples of Miller…

In this paper, we construct an infinite families of group $G$ of order $4p^m$ which can be an automorphism group of some regular polytope with type $\{p, 2p\}$, where $m \geq 3$ and $p$ is an odd prime. For $p=3$, our polytopes are the…

We calculate the group $\kappa_2$ of exotic elements in the $K(2)$-local Picard group at the prime $2$ and find it is a group of order $2^9$ isomorphic to $(\mathbb{Z}/8)^2 \times (\mathbb{Z}/2)^3$. In order to do this we must define and…

This paper is devoted to a study of the automorphism groups of three series of finite dimensional special odd Hamiltonian superalgebras $\mathfrak{g}$ over a field of prime characteristic. Our aim is to characterize the connections between…

An important problem of modern cryptography concerns secret public-key computations in algebraic structures. We construct homomorphic cryptosystems being (secret) epimorphisms f:G --> H, where G, H are (publically known) groups and H is…

Let $p$ be a odd prime such that 2 is a primitive element of finite field $F_p*$. In this short note we propose a new algorithm for the computation of discrete logarithm in $F_p*$. This algorithm is based on elementary properties of finite…

For the $p$-Sylow subgroups $U$ of the finite classical groups of untwisted Lie type, $p$ an odd prime, we construct a monomial $\mathbb C U$-module $M$ which is isomorphic to the regular representation of $\mathbb C G$ by a modification of…

Let $p$ be an odd prime. For field extensions $L/\mathbb{Q}_p$ with Galois group isomorphic to the dihedral group $D_{2p}$ of order $2p$, we consider the problem of computing a basis of the associated order in each Hopf Galois structure and…