In this work, we describe an integer version of ring-LWE over the polynomial rings and prove that its hardness is equivalent to one of the polynomial ring-LWE. Moreover, we also present a public key cryptosystem using this variant of the polynomial ring-LWE.

let $r$ be an infinite ring. here we prove that if $0_r$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin x}$ for every infinite subset $x$ of $r$, then $r$ satisfies the polynomial identity $x^n=0$. also we prove that if $0_r$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in x}$ for every infinite subset $x$ of $r$, then $x^n=x$ for all $xin r$.

The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still, the Ring-LWE problem defined in [LPR10] involves the fractional ideal R∨, the dual of the ring R, which is the source of many theoretical and implementation technicalities. Until now, getting rid of R∨, required some relatively...

We study questions around the existence of bounds and the dependence on parameters for linear-algebraic problems in polynomial rings over rings of an arithmetic flavor. In particular, we show that the module of syzygies of polynomials f1, . . . , fn ∈ R[X1, . . . , XN ] with coefficients in a Prüfer domain R can be generated by elements whose degrees are bounded by a number only depending on N ...

In Mn(k), k an algebraically closed field, we call a matrix l-regular if each eigenspace is at most l-dimensional. We prove that the variety of commuting pairs in the centralizer of a 2-regular matrix is the direct product of various affine spaces and various determinantal varieties Zl,m obtained from matrices over truncated polynomial rings. We prove that these varieties Zl,m are irreducible, ...

We give an effective solution of the conjugacy problem for two by two matrices over the polynomial ring in one variable over a finite field.