相关论文: A simple generalization of El-Gamal cryptosystem t…

Let $U/L$ be a finite abelian extension of number fields. We first construct a universal primitive generator of $U$ over $L$ whose relative trace to any intermediate field $F$ becomes a generator of $F$ over $L$, too. We also develop a…

Given a fine abelian group grading on a finite dimensional simple Lie algebra over an algebraically closed field of characteristic zero, with universal grading group $G$, it is shown that the induced grading by the free group $G/\tor(G)$ is…

This paper is an attempt to build a new public-key cryptosystem; similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem built using two permutation error-correcting codes. We show…

We define a translation based cipher over an arbitrary finite field, and study the permutation group generated by the round functions of such a cipher. We show that under certain cryptographic assumptions this group is primitive. Moreover,…

We propose a generalization of the quantum hashing technique based on the notion of the small-bias sets. These sets have proved useful in different areas of computer science, and here their properties give an optimal construction for…

Similarly to how the classical group ring isomorphism problem asks, for a commutative ring $R$, which information about a finite group $G$ is encoded in the group ring $RG$, the twisted group ring isomorphism problem asks which information…

In this paper we consider gradings by a finite abelian group $G$ on the Lie algebra $\mathfrak{sl}_n(F)$ over an algebraically closed field $F$ of characteristic different from 2 and not dividing $n$.

Given a global exponent $E$ for a black box group $\mathsf{Y}$ encrypting ${\rm SL}_2(\mathbb{F})$, where $\mathbb{F}$ is an unknown finite field of unknown odd characteristic, we construct, in probabilistic time polynomial in $\log E$, the…

We consider algebraic affine and projective curves of Edwards \cite{E, SkOdProj} over a finite field $\text{F}_{p^n}$. Most cryptosystems of the modern cryptography \cite{SkBlock} can be naturally transform into elliptic curves \cite{Kob}.…

We give a complete characterization of abelian subgroups of GL(n, R) with a locally dense (resp. dense) orbit in R^n. For finitely generated subgroups, this characterization is explicit and it is used to show that no abelian subgroup of…

Abelian groups having partial orderings compatible with their binary operations have long been studied in the literature. In particular, lattice-ordered abelian groups constitute a universal-algebraic variety, and thus form a category which…

In this paper we will give a computation of the \'{e}tale fundamental group of an integral arithmetic scheme. For such a scheme, we will prove that the \'{e}tale fundamental group is naturally isomorphic to the Galois group of the maximal…

We study the structure of the Mordell--Weil groups of semiabelian varieties over large algebraic extensions of a finitely generated field of characteristic zero. We consider two types of algebraic extensions in this paper; one is of…

Gaussian elimination is used in special linear groups to solve the word problem. In this paper, we extend Gaussian elimination to unitary groups. These algorithms have an application in building a public-key cryptosystem, we demonstrate…

Using Cayley transform, we show how to construct rotation matrices \emph{infinitely near} the identity matrix over a non-archimedean pythagorean field. As an application, an alternative way to construct non-central proper normal subgroups…

This paper settles the question of injectivity of the non-Abelian X-ray transform on simple surfaces for the general linear group of invertible complex matrices. The main idea is to use a factorization theorem for Loop Groups to reduce to…

The automorphism group of an elliptic curve over an algebraically closed field is well known. However, for various applications in coding theory and cryptography, we usually need to apply automorphisms defined over a finite field. Although…

We give an explicit description of the category of central extensions of a group scheme by a sheaf of Abelian groups. Based on this, we describe a framework for computing with central extensions of finite commutative group schemes, torsors…

In this paper, we initiate the study of spectrum of the commuting graphs of finite non-abelian groups. We first compute the spectrum of this graph for several classes of finite groups, in particular AC-groups. We show that the commuting…

This scholarly work presents an advanced cryptographic framework utilizing automorphism groups as the foundational structure for encryption scheme implementation. The proposed methodology employs a three-parameter group construction,…