Related papers: Multilinear Cryptography using Nilpotent Groups
We provide a detailed structural description of the nilpotent primitive subgroups of $\mathrm{GL}(n, \mathbb{F})$, where $\mathbb{F}$ is a finite field.
Let $q$ be a prime power and $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $n>1$. We introduce the class of the linearized polynomials $L(x)$ over $\mathbb F_{q^n}$ such that…
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.…
In this study, we give definition of some multivalued hybrid mappings which are general than many mappings in the existing literature, then we give some existence and convergence results for these mappings in CAT({\kappa})-spaces
A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…
This paper presents an identity based multi-proxy multi-signcryption scheme from pairings. In this scheme a proxy signcrypter group could authorized as a proxy agent by the coopration of all members in the original signcryption group. Then…
We employ tropical algebras as platforms for several cryptographic schemes that would be vulnerable to linear algebra attacks were they based on "usual" algebras as platforms.
In this paper, an exact bitwise MAP (Maximum A Posteriori) estimation algorithm for group testing problems is presented. We assume a simplest non-adaptive group testing scenario including N-objects with binary status and M-disjunctive…
We show that the definition of unipotent (resp. nilpotent) pieces for classical groups given by Lusztig (resp. Lusztig and the author) coincides with the combinatorial definition using closure relations on unipotent classes (resp. nilpotent…
Every finite dimensional real representation of a compact real semisimple Lie algebra determines a metric 2-step nilpotent Lie algebra and a corresponding simply connected metric 2-step nilpotent Lie group N. We study the differential…
In this paper we study the MOR cryptosystem using finite classical Chevalley groups over a finite field of odd characteristic. In the process we develop an algorithm for these Chevalley groups in the same spirit as the row-column operation…
We give an algorithm that decides whether a single equation in a group that is virtually a class $2$ nilpotent group with a virtually cyclic commutator subgroup, such as the Heisenberg group, admits a solution. This generalises the work of…
Substitution boxes with thorough cryptographic strengths are essential for the development of strong encryption systems. They are the only portions capable of inducing nonlinearity in symmetric encryption systems. Bijective substitution…
There are normal sub-blocks of nilpotent blocks which are NOT nilpotent or, equivalently, nilpotent extensions of non-nilpotent blocks. In this paper we determine the source algebra structure of the non-nilpotent blocks involved in these…
In this paper, we introduce the weakly nilpotent hypergroups with giving some new properties, and then establish several structural characterizations of these hypergroups. Some results obtained in this paper answer the two questions raised…
Machine learning potentials (MLPs) developed from extensive datasets constructed from density functional theory (DFT) calculations have become increasingly appealing for many researchers. This paper presents a framework of polynomial-based…
We define geometric/unipotent crystal structure on unipotent subgroups of semi-simple algebraic groups. We shall show that in $A_n$-case, their ultra-discretizations coincide with crystals obtained by generalizing Young tableaux.
In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.
We describe how to smoothly parametrize certain families of nilpotent Lie algebras.
We will define a new type of cipher that doesn't use neither an easy to calcualate and hard to invert matematical function like RSA nor a classical mono or polyalphabetic cipher.