Related papers: Galois ring isomorphism problem

Many variants of RSA cryptosystem exist in the literature. One of them is RSA over polynomials based on Galois approach. In standard RSA modulus is product of two large primes whereas in the Galois approach author considered the modulus as…

This paper proposes a new homomorphic functional encryption using modular multiplications over a hidden ring. Unlike traditional homomorphic encryption where users can only passively perform ciphertext addition or multiplication, the…

Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…

A Galois scaffold, in a Galois extension of local fields with perfect residue fields, is an adaptation of the normal basis to the valuation of the extension field, and thus can be applied to answer questions of Galois module structure. Here…

We enhance the analogy between field extensions and covering spaces by introducing the concept of splitting covering which correspondences to the splitting field in Galois theory. We define semi-topological Galois groups for Weierstrass…

The Ring Learning-With-Errors (RLWE) problem shows great promise for post-quantum cryptography and homomorphic encryption. We describe a new attack on the non-dual search RLWE problem with small error widths, using ring homomorphisms to…

In this paper we give a survey of recent methods for the asymptotic and exact enumeration of number fields with given Galois group of the Galois closure. In particular, the case of fields of degree up to 4 is now almost completely solved,…

This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a polynomial structure, results for monoid domains come in here and there. The second part of the paper…

The minimal ramification problem may be considered as a quantitative version of the inverse Galois problem. For a nontrivial finite group $G$, let $m(G)$ be the minimal integer $m$ for which there exists a Galois extension $N/\mathbb{Q}$…

In this article we establish certain variants of the Inverse Cluster Size problem. We introduce the notion of primitive extensions and establish the Primitive variant of the problem. Precisely, we prove the existence of primitive extensions…

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

We develop a new form of patching that is both far-reaching and more elementary than the previous versions that have been used in inverse Galois theory for function fields of curves. A key point of our approach is to work with fields and…

In the present paper, we shall show that for any prime number p, every finite p-group occurs as the Galois Group of the maximal unramified p-extension over a certain number field of finite degree. We shall also show that for any given…

We study the minimal number of ramified primes in Galois extensions of rational function fields over finite fields with prescribed finite Galois group. In particular, we obtain a general conjecture in analogy with the well studied case of…

Given a $p$-adic field $K$ and a prime number $\ell$, we count the total number of the isomorphism classes of $p^\ell$-extensions of $K$ having no intermediate fields. Moreover for each group that can appear as Galois group of the normal…

To generalize the notion of Galois closure for separable field extensions, we devise a notion of $G$-closure for algebras of commutative rings $R\to A$, where $A$ is locally free of rank $n$ as an $R$-module and $G$ is a subgroup of…

This paper is a contribution to the isomorphism problem for universal enveloping algebras of finite-dimensional Lie algebras. We focus on solvable Lie algebras of small dimensions over fields of arbitrary characteristic. We prove, over an…

We propose and study a variation of the classical isomorphism problem for group rings in the context of projective representations. We formulate several weaker conditions following from our notion and give all logical connections between…

Graph isomorphism problem is a known hard problem. In this paper, a novel randomized algorithm is proposed for this problem which is very simple and fast. It solves the graph isomorphism problem with running time O(n^2.373) for any pair of…

This article proposes a comprehensive approach to implementing encryption schemes based on the automorphism group of the Hermitian function field. We utilize a three-parameter group with logarithmic representations outside the group's…