Related papers: Multilinear Cryptography using Nilpotent Groups

A new quantum cryptography protocol, based on all unselected states of a qubit as a sort of alphabet with continuous set of letters, is proposed. Its effectiveness is calculated and shown to be essentially higher than those of the other…

The goal of this note is to generalize Isoperimetric Inequality for random groups to the class of non-planar diagrams of bounded number of faces.

In this paper, we propose two cryptosystems based on group rings and existing cryptosystem. First one is Elliptic ElGamal type group ring public key cryptosystem whose security is greater than security of cryptosystems based on elliptic…

In math.DG/0312243 we developed a general classification scheme for metric Lie algebras, i.e. for finite-dimensional Lie algebras equipped with a non-degenerate invariant inner product. Here we determine all nilpotent Lie algebras l with…

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.

Artificial Neural Networks(ANN) has been phenomenally successful on various pattern recognition tasks. However, the design of neural networks rely heavily on the experience and intuitions of individual developers. In this article, the…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

We propose public-key cryptosystems with public key a system of polynomial equations, algebraic or differential, and private key a single polynomial or a small-size ideal. We set up probabilistic encryption, signature, and signcryption…

It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into $GL_{n}(\mathbb{Z})$ for an appropriate $n\in \mathbb{N}$; that is, each element in the group has a unique matrix…

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

The parameter coclass has been used successfully in the study of nilpotent algebraic objects of different kinds. In this paper a definition of coclass for nilpotent semigroups is introduced and semigroups of coclass 0, 1, and 2 are…

This is a survey of algorithmic problems in group theory, old and new, motivated by applications to cryptography.

The crystalline period map is a tool for linearizing $p$-divisible groups. It has been applied to study the Langlands correspondences, and has possible applications to the homotopy groups of spheres. The original construction of the period…

The type and several invariant subspaces related to the upper annihilating series of finite-dimensional nilpotent evolution algebras are introduced. These invariants can be easily computed from any natural basis. Some families of nilpotent…

In this paper we prove characterizations of $p$-nilpotency for fusion systems and $p$-local finite groups that are inspired by results in the literature for finite groups. In particular, we generalize criteria by Atiyah, Brunetti,…

We define a pseudometric on the set of all unbounded subsets of a metric space. The Kolmogorov quotient of this pseudometric space is a complete metric space. The definition of the pseudometric is guided by the principle that two unbounded…

Homomorphic encryption has largely been studied in context of public key cryptosystems. But there are applications which inherently would require symmetric keys. We propose a symmetric key encryption scheme with fully homomorphic evaluation…

An argument used to show that certain varieties of nilpotent groups have instances of nontrivial dominions is considered, and generalized. The same is done with the argument used to show that there are nontrivial dominions in the variety of…

This paper deals with the evaluation of trust in public-key infrastructures. Different trust models have been proposed to interconnect the various PKI components in order to propagate the trust between them. In this paper we provide a new…

In this paper we determine all finitely generated abelian groups which are varietal capable with respect to the variety of polynilpotent groups. This result is a vast generalization of the famous Baer's result about capability of finitely…