Related papers: Galois ring isomorphism problem
In this paper we consider the problem of Galois descent for suitably completed algebraic K-theory of fields. One of the main results is a suitable form of rigidity for Borel-style generalized equivariant cohomology with respect to certain…
We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…
We prove new cases of the inverse Galois problem by considering the residual Galois representations arising from a fixed newform. Specific choices of weight $3$ newforms will show that there are Galois extensions of $\mathbb{Q}$ with Galois…
Let $K$ be a number field and $S$ a set of primes of $K$. We write $K_S/K$ for the maximal extension of $K$ unramified outside $S$ and $G_{K,S}$ for its Galois group. In this paper, we answer the following question under some assumptions:…
Recently, two new constructions of $(v,k,k-1)$ disjoint difference families in Galois rings were presented by Davis, Huczynska, and Mullen and Momihara. Both were motivated by a well-known construction of difference families from cyclotomy…
In this paper, we develop an explicit method to express finite algebraic numbers (in particular, certain idempotents among them) in terms of linear recurrent sequences, and give applications to the characterization of the splitting primes…
We introduce a notion of "Galois closure" for extensions of rings. We show that the notion agrees with the usual notion of Galois closure in the case of an S_n degree n extension of fields. Moreover, we prove a number of properties of this…
We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Using tools from statistical mechanics we are able to identify…
We describe a project to formalize Galois theory using the Lean theorem prover, which is part of a larger effort to formalize all of the standard undergraduate mathematics curriculum in Lean. We discuss some of the challenges we faced and…
We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can…
The Subgroup Isomorphism Problem for Integral Group Rings asks for which finite groups U it is true that if U is isomorphic to a subgroup of V(ZG), the group of normalized units of the integral group ring of the finite group G, it must be…
We solve the inverse differential Galois problem over the fraction field of $k[[t,x]]$ and use this to solve split differential embedding problems over $k((t))(x)$ that are induced from $k(x)$. The proofs use patching as well as prior…
In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over…
We consider the isomorphism problem for formal matrix rings over a given ring. Principal factor matrices of such rings play an important role in this case. The work is supported by Russian Scientific Foundation, project 23-21-00375 (P.A.…
We prove the modularity of minimally ramified ordinary residually reducible p-adic Galois representations of an imaginary quadratic field F under certain assumptions. We first exhibit conditions under which the residual representation is…
In positive characteristic, nearly all Picard-Vessiot extensions are inseparable over some intermediate iterative differential extensions. In the Galois correspondence, these intermediate fields correspond to nonreduced subgroup schemes of…
The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear…
An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of "hard supersingular curves" that is, equations for supersingular curves for which computing the…
The rank decoding problem has been the subject of much attention in this last decade. This problem, which is at the base of the security of public-key cryptosystems based on rank metric codes, is traditionally studied over finite fields.…
The purpose of the paper is to give new key agreement protocols (a multi-party extension of the protocol due to Anshel-Anshel-Goldfeld and a generalization of the Diffie-Hellman protocol from abelian to solvable groups) and a new…