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

Let $p$ be an odd prime number. We show that the modular isomorphism problem has a positive answer for finite $p$-groups whose center has index $p^3$, which is a strong contrast to the analogous situation for $p = 2$.

We consider an amalgam of groups constructed from fusion systems for different odd primes p and q. This amalgam contains a self-normalizing cyclic subgroup of order pq and isolated elements of order p and q.

Let $k$ be an algebraically closed field of positive characteristic $p>0$ and $C \to {\mathbb P}^1_k$ a $p$-cyclic cover of the projective line ramified in exactly one point. We are interested in the $p$-part of the full automorphism group…

In this paper we study the existence of at least one non-inner automorphism of order p of a non-abelian finite p-group of coclass 3, where p is a prime integer such that p is different from 3.

We study the mod $p$ cohomology ring of the classifying space $BPU(p)$ of the projective unitary group $PU(p)$, when $p$ is an odd prime. We prove a mod $p$ formula analogous to a formula of Vistoli for the integral cohomology ring of…

The present paper proposes a new and systematic approach to the so-called black box group methods in computational group theory. Instead of a single black box, we consider categories of black boxes and their morphisms. This makes new…

Let $E$ be an elliptic curve over $\F_p$ without complex multiplication, and for each prime $p$ of good reduction, let $n_E(p) = | E(\F_p) |$. Let $Q_{E,b}(x)$ be the number of primes $p \leq x$ such that $b^{n_E(p)} \equiv b\,({\rm…

We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm problem on (semi) groups of matrices over a group ring. We can find the secret key and break entirely the protocols.

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…

This survey on the automorphism groups of finite p-groups focuses on three major topics: explicit computations for familiar finite p-groups, such as the extraspecial p-groups and Sylow p-subgroups of Chevalley groups; constructing p-groups…

In this paper we study extensively the discrete logarithm problem in the group of non-singular circulant matrices. The emphasis of this study was to find the exact parameters for the group of circulant matrices for a secure implementation.…

We consider actions of a group or a semigroup on a set, which generalize the setup of discrete logarithm based cryptosystems. Such cryptographic group actions have gained increasing attention recently in the context of isogeny-based…

In this paper, following the methods of http://arxiv.org/abs/1305.7449v2, we show that the double covering groups of the symmetric and alternating groups have p-basic sets for any odd prime p.

We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also works for polynomials with multiple roots provided that the number $k$ of distinct roots is given as part of the input. It outputs $k$ pairwise…

Let $p$ be an odd prime, and let $S$ be a $p$-group with a unique elementary abelian subgroup $A$ of index $p$. We classify the simple fusion systems over all such groups $S$ in which $A$ is essential. The resulting list, which depends on…

We propose modifications of known quasigroup based stream ciphers. Systems of orthogonal n-ary groupoids are used.

For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…

Many common finite p-groups admit automorphisms of order coprime to p, and when p is odd, it is reasonably difficult to find finite p-groups whose automorphism group is a p-group. Yet the goal of this paper is to prove that the automorphism…

Type-two constructions abound in cryptography: adversaries for encryption and authentication schemes, if active, are modeled as algorithms having access to oracles, i.e. as second-order algorithms. But how about making cryptographic schemes…

This paper gives the definitions of an extra superincreasing sequence and an anomalous subset sum, and proposes a fast quantum-safe asymmetric cryptosystem called JUOAN2. The new cryptosystem is based on an additive multivariate permutation…