Related papers: Galois ring isomorphism problem

We investigate the Galois group $G_S(p)$ of the maximal $p$-extension unramified outside a finite $S$ of primes of a number field in the (tame) case, when no prime dividing $p$ is in $S$. We show that the cohomology of $G_S(p)$ is 'often'…

Applying geometric methods of $2$-dimensional cell complex theory, we construct a Galois covering of a bimodule problem satisfying some structure, triangularity and finiteness conditions in order to describe the objects of finite…

We prove many new cases of the Inverse Galois Problem for those simple groups arising from orthogonal groups over finite fields. For example, we show that the finite simple groups Omega_{2n+1}(p) and POmega_{4n}^+(p) both occur as the…

We introduce the notion of differential torsors, which allows the adaptation of constructions from algebraic geometry to differential Galois theory. Using these differential torsors, we set up a general framework for applying patching…

We continue our investigation of a variation of the group ring isomorphism problem for twisted group algebras. Contrary to previous work, we include cohomology classes which do not contain any cocycle of finite order. This allows us to…

The Galois ring $GR(p^r,m)$ of characteristic $p^r$ and cardinality $p^{rm}$, where $p$ is a prime and $r,m \ge 1$ are integers, is a Galois extension of the residue class ring $Z_{p^r}$ by a root $\omega$ of a monic basic irreducible…

In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

Given a cryptographic group action, we show that the Group Action Inverse Problem (GAIP) and other related problems cannot be NP-hard unless the Polynomial Hierarchy collapses. We show this via random self-reductions and the design of…

We carry out some of Galois's work in the setting of an arbitrary first-order theory T. We replace the ambient algebraically closed field by a large model M of T, replace fields by definably closed subsets of M, assume that T codes finite…

Counterexamples to the Modular Isomorphism Problem were discovered recently. These are non-isomorphic finite $2$-groups $G$ and $H$ that have isomorphic group algebras over the field $\mathbb{Z}/2\mathbb{Z}$ and non-isomorphic group…

This article is the third and last part of a series of three articles about compatible systems of symplectic Galois representations and applications to the inverse Galois problem. This part proves the following new result for the inverse…

Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation.…

In this paper, we prove that the supersingular isogeny problem (Isogeny), endomorphism ring problem (EndRing) and maximal order problem (MaxOrder) are equivalent under probabilistic polynomial time reductions, unconditionally. Isogeny-based…

We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…

Galois comodules of a coring are studied. The conditions for a simple comodule to be a Galois comodule are found. A special class of Galois comodules termed principal comodules is introduced. These are defined as Galois comodules that are…

We develop a public key cryptosystem based on invariants of diagonalizable groups and investigate properties of such cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of…

In 2002, Johnson et al. posed an open problem at the Cryptographers' Track of the RSA Conference: how to construct a secure homomorphic signature on a semigroup, rather than on a group. In this paper, we introduce, for the first time, a…

One of the key points in Galois theory via field extensions is to build up a correspondence between subfields of a field and subgroups of its automorphism group, so as to study fields via methods of groups. As an analogue of the Galois…

We solve the inverse differential Galois problem over differential fields with a large field of constants of infinite transcendence degree over ${\mathbb Q}$. More generally, we show that over such a field, every split differential…