相关论文: Security considerations for Galois non-dual RLWE f…

The ring and polynomial learning with errors problems (Ring-LWE and Poly-LWE) have been proposed as hard problems to form the basis for cryptosystems, and various security reductions to hard lattice problems have been presented. So far…

We employ methods from homotopy theory to define new obstructions to solutions of embedding problems. By using these novel obstructions we study embedding problems with non-solvable kernel. We apply these obstructions to study the…

We say a tame Galois field extension $L/K$ with Galois group $G$ has trivial Galois module structure if the rings of integers have the property that $\Cal{O}_{L}$ is a free $\Cal{O}_{K}[G]$-module. The work of Greither, Replogle, Rubin, and…

The Learning with Errors (\LWE) problem has been widely utilized as a foundation for numerous cryptographic tools over the years. In this study, we focus on an algebraic variant of the \LWE problem called \emph{Group ring} \LWE ($\GRLWE$).…

The "Ring Learning with Errors" (RLWE) problem was formulated as a variant of the "Learning with Errors" (LWE) problem, with the purpose of taking advantage of an additional algebraic structure in the underlying considered lattices; this…

Recently, Dor\"oz et al. (2017) proposed a new hard problem, called the finite field isomorphism problem, and constructed a fully homomorphic encryption scheme based on this problem. In this paper, we generalize the problem to the case of…

Let $K$ be a number field and $G$ a finite abelian group. We study the asymptotic behaviour of the number of tamely ramified $G$-extensions of $K$ with ring of integers of fixed realisable class as a Galois module.

In this paper, we survey the status of attacks on the ring and polynomial learning with errors problems (RLWE and PLWE). Recent work on the security of these problems [Eisentr\"ager-Hallgren-Lauter, Elias-Lauter-Ozman-Stange] gives rise to…

Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…

We provide an infinite family of quadratic number fields with everywhere unramified Galois extensions of Galois group $SL_2(7)$. To my knowledge, this is the first instance of infinitely many such realizations for a perfect group which is…

Let $G$ be a finite group and let $N/E$ be a tamely ramified $G$-Galois extension of number fields. We show how Stickelberger's factorization of Gauss sums can be used to determine the stable isomorphism class of various arithmetic…

We investigate unramified extensions of number fields with prescribed solvable Galois group and certain extra conditions. In particular, we are interested in the minimal degree of a number field $K$, Galois over $\mathbb{Q}$, such that $K$…

We extend the Brauer-Siegel theorem to new families of number fields, both in the classical setting of asymptotically bad families and in the more general framework due to Tsfasman and Vl\u{a}du\c{t} of asymptotically exact families. We…

Algebraic methods are used to construct families of unramified abelian extensions of some families of number fields with specified Galois groups.

In this paper, we give a partial solution to a new isomorphism problem about $2$-$(v,k,k-1)$ designs from disjoint difference families in finite fields and Galois rings. Our results are obtained by carefully calculating and bounding some…

We develop Hopf-Galois theory for weak Hopf algebras, and recover analogs of classical results for Hopf algebras. Our methods are based on the recently introduced Galois theory for corings. We focus on the situatation where the weak Hopf…

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…

We consider an application to the discrete log problem using completely regular semigroups which may provide a more secure symmetric cryptosystem than the classic system based on groups. In particular we describe a scheme that would appear…

We discuss the following two problems: 1) The properties of the multiple zeta-values and their generalizations, multiple polylogarithms at N-th roots of unity; 2) The action of the absolute Galois group on the pro-l-completion of the…

In this article new cases of the Inverse Galois Problem are established. The main result is that for a fixed integer n, there is a positive density set of primes p such that PSL_2(F_{p^n}) occurs as the Galois group of some finite extension…