Related papers: Multilinear Cryptography using Nilpotent Groups

Witness encryption using multilinear maps was first proposed in 2013, and has continued to evolve since. In this paper, we build on an open-source multilinear map implementation by Carmer and Malozemoff of the graded encoding scheme CLT13…

S. Bera (Line graph characterization of power graphs of finite nilpotent groups, \textit{Communication in Algebra}, 50(11), 4652-4668, 2022) characterized finite nilpotent groups whose power graphs and proper power graphs are line graphs.…

Let $\Gamma_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $\Gamma_H$ is isomorphic to $\Gamma_G$ for a finite nilpotent group $G$.…

This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…

Ulam asked whether every connected Lie group can be represented on a countable structure. This is known in the linear case. We establish it for the first family of non-linear groups, namely in the nilpotent case. Further context is…

We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of…

With privacy-preserving and traceability properties, group signature is a cryptosystem with central role in cryptography. And there are lots of application scenarios. A new extension concept of group signature is presented, namely group…

The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian…

We define a map from the unipotent representations of a split semisimple group over a finite field to (essentially) the set of pairs of left cells representations of the Weyl group in the same two-sided cell. We use this map to parametrize…

We develop a structure theory for nilpotent symplectic alternating algebras. We then give a classification of all nilpotent symplectic alternating algebras of dimension up to 10 over any field. The study reveals a new subclasses of powerful…

A new open spin chain hamiltonian is introduced. It is both integrable (Sklyanin`s type $K$ matrices are used to achieve this) and invariant under ${\cal U}_{\epsilon}(sl(2))$ transformations in nilpotent irreps for $\epsilon^3=1$. Some…

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

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.

In the present paper we give the full description of the Lie nilpotent group algebras which have maximal Lie nilpotency indices.

In this article we study the homology of nilpotent groups. In particular a certain vanishing result for the homology and cohomology of nilpotent groups is proved.

Modifications of Markovski quasigroup based crypto-algorithm have been proposed. Some of these modifications are based on the systems of orthogonal n-ary groupoids. T-quasigroups based stream ciphers have been constructed.

Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups.…

This paper introduces a newly developed private key cryptosystem and a public key cryptosystem. In the first one, each letter is encrypted with a different key. Therefore, it is a kind of a one-time pad. The second one is inspired by the…

It has recently been shown that cryptographic trilinear maps are sufficient for achieving indistinguishability obfuscation. In this paper we develop a method for constructing such maps on the Weil descent (restriction) of abelian varieties…

We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can…