Related papers: Multilinear Cryptography using Nilpotent Groups

Machine learning potentials (MLPs) are becoming powerful tools for performing accurate atomistic simulations and crystal structure optimizations. An approach to developing MLPs employs a systematic set of polynomial invariants including…

We give a sufficient criterion for complex analyticity of nonlinear maps defined on direct limits of normed spaces. This tool is then used to construct new classes of (real and complex) infinite dimensional Lie groups: (a) groups of germs…

In this paper, algorithms for multivariate public key cryptography and digital signature are described. Plain messages and encrypted messages are arrays, consisting of elements from a fixed finite ring or field. The encryption and…

In this paper, we determine the structure of the nilpotent multipliers of all pairs $(G,N)$ of finitely generated abelian groups where $N$ admits a complement in $G$. Moreover, some inequalities for the nilpotent multipliers of pairs of…

In this paper we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the El-Gamal cryptosystem over finite…

In this paper, we show that one can interrelate pluriharmonic maps with para-pluriharmonic maps by means of the loop group method. As an appendix, we give examples for the interrelation between pluriharmonic maps and para-pluriharmonic…

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract model of composable security definitions in…

We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology…

We show that every nilpotent group of class at most two may be embedded in a central extension of abelian groups with bilinear cocycle. The embedding is shown to depend only on the base group. Some refinements are obtained by considering…

Unimodal maps have been broadly used as a base of new encryption strategies. Recently, a stream cipher has been proposed in the literature, whose keystream is basically a symbolic sequence of the (one-parameter) logistic map or of the tent…

We discuss a new attack, termed a dimension or linear decomposition attack, on several known group-based cryptosystems. This attack gives a polynomial time deterministic algorithm that recovers the secret shared key from the public data in…

The power graph of a group is the simple graph whose vertices are the group elements and two vertices are adjacent whenever one of them is a positive power of the other. We characterize the finite nilpotent groups whose power graphs have…

Building upon the author's previous work on primitivity testing of finite nilpotent linear groups over fields of characteristic zero, we describe precisely those finite nilpotent groups which arise as primitive linear groups over a given…

We establish a version of a semistable reduction theorem over a log point with a non-trivial nilpotent structure. In order to do this we extend the classical desingularization theories to non-reduced schemes with generically principal…

We give a characterization of the finite groups having nilpotent or abelian Hall $\pi$-subgroups which can easily be verified from the character table.

This article introduces a novel cryptographic paradigm based on nonderived polyadic algebraic structures. Traditional cryptosystems rely on binary operations within groups, rings, or fields, whose well-understood properties can be exploited…

We exhibit an extension of the category of class two nilpotent groups. It has the same objects but, unlike the latter, its morphisms are closed under pointwise addition of maps. At the same time the class of its morphisms is much smaller…

This paper aims to introduce the concept of nilpotency and capability in multiplicative Lie algebras. Also, we see the existence of covers of a multiplicative Lie algebra and thoroughly examine their relationships with capable and perfect…

We construct some examples of polynomial maps over finite fields that admit subvarieties with a peculiar property: every geometric point is mapped to a fixed point by some iteration of the map, while the whole subvariety is not. Several…