Related papers: Galois ring isomorphism problem

Let G be the absolute Galois group of a global field. Let r1 and r2 be two p-adic, finite dimensional representations of G. Then there exists a finite number of primes q such that if the characteristic polynomials of r1(Frob_q) and…

We prove that the path-finding problem in $\ell$-isogeny graphs and the endomorphism ring problem for supersingular elliptic curves are equivalent under reductions of polynomial expected time, assuming the generalised Riemann hypothesis.…

We propose a symmetric key homomorphic encryption scheme based on the evaluation of multivariate polynomials over a finite field. The proposed scheme is somewhat homomorphic with respect to addition and multiplication. Further, we define a…

We introduce and study a class of field extensions that we call pre-Galois; viz. extensions that become Galois after some linearly disjoint Galois base change. Among them are geometrically Galois extensions of k(T), with k a field:…

This article is on the inverse Galois problem in Galois theory of linear iterative differential equations in positive characteristic. We show that it has an affirmative answer for reduced algebraic group schemes over any iterative…

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…

Let $H$ be a skew field of finite dimension over its center $k$. We solve the Inverse Galois Problem over the field of fractions $H(X)$ of the ring of polynomial functions over $H$ in the variable $X$, if $k$ contains an ample field.

Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over the prime power integer residue ring. In this paper, we give a generalization of these codes to Generalized Reed-Muller codes over Galois rings.

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

We show that each connected group scheme of finite type over an arbitrary ground field is isomorphic to the component of the identity inside the automorphism group scheme of some projective, geometrically integral scheme. The main…

We explore further the hardness of the non-dual discrete variant of the Ring-LWE problem for various number rings, give improved attacks for certain rings satisfying some additional assumptions, construct a new family of vulnerable Galois…

In this paper we revisit the following inverse problem: given a curve invariant under an irreducible finite linear algebraic group, can we construct an ordinary linear differential equation whose Schwarz map parametrizes it? We present an…

This article is the first part of a series of three articles about compatible systems of symplectic Galois representations and applications to the inverse Galois problem. In this first part, we determine the smallest field over which the…

In this article, we focus on orders in arbitrary number fields, consider their Picard groups and finally obtain ring class fields corresponding to them. The Galois group of the ring class field is isomorphic to the Picard group. As an…

Fix a positive integer $g$ and rational prime $p$. We prove the existence of a genus $g$ curve $C/\mathbb{Q}$ such that the mod $p$ representation of its Jacobian is tame by imposing conditions on the endomorphism ring. As an application,…

We solve the lifting problem for Galois representations in every dimension and in every characteristic. That is, we determine all pairs $(n,k)$, where $n$ is a positive integer and $k$ is a field of characteristic $p>0$, such that for every…

Galois rings are regarded as "building blocks" of a finite commutative ring with identity. There have been many papers on classical error correction codes over Galois rings published. As an important warm-up before exploring quantum…

Let f be an arbitrary positive integer valued function. The goal of this note is to show that one can construct a finitely generated group in which the discrete log problem is polynomially equivalent to computing the function f. In…

We consider the inverse Galois problem over function fields of positive characteristic p, for example, the inverse Galois problem over the projective line. We describe a method to construct certain Galois covers of the projective line and…

Galois Field arithmetic blocks are the key components in many security applications, such as Elliptic Curve Cryptography (ECC) and the S-Boxes of the Advanced Encryption Standard (AES) cipher. This paper introduces a novel hardware…