Related papers: Galois ring isomorphism problem

The aim of the paper is to introduce B-extensions which are the most symmetrical finite field extensions (a finite field extension $L/K$ is called a {\it B-extension} if the endomorphism algebra ${\rm End}_K(L)$ is generated by the algebra…

The inverse Galois problem is concerned with finding a Galois extension of a field $K$ with given Galois group. In this paper we consider the particular case where the base field is $K=\F_p(t)$. We give a conjectural formula for the minimal…

Let $p$ be an odd prime. For field extensions $L/\mathbb{Q}_p$ with Galois group isomorphic to the dihedral group $D_{2p}$ of order $2p$, we consider the problem of computing a basis of the associated order in each Hopf Galois structure and…

Let n be either 2, or an odd integer greater than 1, and fix a prime p > 2(n + 1). Under standard "adequate image" assumptions, we show that the set of components of n-dimensional p-adic potentially semistable local Galois deformation rings…

We present novel homomorphic encryption schemes for integer arithmetic, intended for use in secure single-party computation in the cloud. These schemes are capable of securely computing only low degree polynomials homomorphically, but this…

In this paper, we draw connections between ideal lattices and multivariate polynomial rings over integers using Gr\"obner bases. Ideal lattices are ideals in the residue class ring, $\mathbb{Z}[x]/\langle f \rangle$ (here $f$ is a monic…

This paper focuses on a refinement of the inverse Galois problem. We explore what finite groups appear as the Galois group of an extension of the rational numbers in which only a predetermined set of primes may ramify. After presenting new…

The goal of this chapter is to present a survey of homomorphic encryption techniques and their applications. After a detailed discussion on the introduction and motivation of the chapter, we present some basic concepts of cryptography. The…

In this manuscript, we apply patching methods to give a positive answer to the inverse differential Galois problem over function fields over Laurent series fields of characteristic zero. More precisely, we show that any linear algebraic…

A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen…

Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods…

In this article, we explore the problem of determining isomorphisms between the twisted complex group algebras of finite $p$-groups. This problem bears similarity to the classical group algebra isomorphism problem and has been recently…

For every finite field F and every positive integer r, there exists a finite extension F' of F such that either SO(2r+1,F') or its simple derived group can be realized as a Galois group over Q. If the characteristic of F is 3 or 5 (mod 8),…

We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in…

Let $R$ be a finite unital commutative ring. We introduce a new class of finite groups, which we call hereditary groups over $R$. Our main result states that if $G$ is a hereditary group over $R$ then a unital algebra isomorphism between…

Let $F$ be a number field with ring of integers $O_F$ and let $G$ be a finite group. We describe an approach to the study of the set of realisable classes in the locally free class group $Cl(O_FG)$ of $O_FG$ that involves applying the work…

Let $m$ be an integer greater than three and $\ell$ be an odd prime. In this paper, we prove that at least one of the following groups: $\mbox{P}\Omega^\pm_{2m}(\mathbb{F}_{\ell^s})$, $\mbox{PSO}^\pm_{2m}(\mathbb{F}_{\ell^s})$,…

A characterization of predicate encryption (PE) with support for homomorphic operations is presented and we describe the homomorphic properties of some existing PE constructions. Even for the special case of IBE, there are few known…

An algebraic technique is presented that does not use results of model theory and makes it possible to construct a general Galois theory of arbitrary nonlinear systems of partial differential equations. The algebraic technique is based on…

In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determine the support of a graph pattern; subgraph isomorphism is a…