Related papers: The Diffie-Hellman Key Exchange Protocol and non-a…

Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. The non-commuting graph $\Gamma_G$ associated to $G$ is the graph whose vertex set is $G\setminus Z(G)$ and two distinct elements $x,y$ are adjacent if and only if $xy\neq yx$.…

In the spirit of Diffie Hellman the concept of a protocol algebra is introduced using certain amalgamated free product of Braid group B and Thompson group T together with a nilpotent subgroup H of index 2.

After 38 years of birthday Diffie-Hellman Key Exchange (DHKE), there are many proposed improvements in the DHKE protocol to encounter modern security issues. This protocol seems quite simple to be implemented, but it can be vulnerable to…

We present a divisibility relation for the dimensions and Hilbert series of certain classes of Nichols algebras of non-abelian group type, which generalizes Nichols algebras over Coxeter groups with constant cocycle -1. For this we…

A transfer is a group homomorphism from a finite group to an abelian quotient group of a subgroup of the group. In this paper, we explain some of the properties of transfers by using noncommutative determinants. These properties enable us…

The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…

We use non-abelian fundamental groups to define a sequence of higher reciprocity maps on the adelic points of a variety over a number field satisfying certain conditions in Galois cohomology. The non-abelian reciprocity law then states that…

A Post-Quantum Key Exchange is needed since the availability of quantum computers that allegedly allow breaking classical algorithms like Diffie-Hellman, El Gamal, RSA and others within a practical amount of time is broadly assumed in…

In this article we construct the first examples of strongly aperiodic linearly repetitive Delone sets in non-abelian Lie groups by means of symbolic substitutions. In particular, we find such sets in all $2$-step nilpotent Lie groups with…

We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…

This paper studies the relationships between the traditional Diffie-Hellman key agreement protocol and the identity-based (ID-based) key agreement protocol from pairings. For the Sakai-Ohgishi-Kasahara (SOK) ID-based key construction, we…

An important problem in the theory of cluster algebras is to compute the fundamental group of the exchange graph. A non-trivial closed loop in the exchange graph, for example, generates a non-trivial identity for the classical and quantum…

A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. A non-abelian group is called an inner-abelian group if all of its proper subgroups are…

We introduce non-abelian cohomology sets of Hopf algebras with coefficients in Hopf modules. We prove that these sets generalize Serre's non-abelian group cohomology theory. Using descent techniques, we establish that our construction…

In this paper, we propose to use a twisted dihedral group algebra for public-key cryptography. For this, we introduce a new $2$-cocycle $\alpha_{\lambda}$ to twist the dihedral group algebra. Using the ambient space…

By analogy with the developed cryptographic theory of discrete logarithm problems, we define several hard problems in Entropoid based cryptography, such as Discrete Entropoid Logarithm Problem (DELP), Computational Entropoid Diffie-Hellman…

We present a new group law defined on a subset of the projective plane $\mathbb{F}P^2$ over an arbitrary field $\mathbb{F}$, which lends itself to applications in Public Key Cryptography, in particular to a Diffie-Hellman-like key agreement…

We complete the study of finite and profinite groups admitting an action by an elementary abelian group under which the centralizers of automorphisms consist of Engel elements. In particular, we prove the following theorems. Let $q$ be a…

We study a commutation pattern in which two affine families commute completely across the two families while each family retains internal noncommutativity. For one-dimensional affine groups over finite commutative rings, we prove a…

All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman key exchange protocol, satisfy the so-called "telescoping equality"; in some cases, this equality has been used to construct an attack. In…