We consider real trigonometric polynomial Bernoulli equations of the form A(θ)y′=B1(θ)+Bn(θ)yn where n≥2, with A,B1,Bn being polynomials degree at most μ≥1 in variables θ and Bn(θ)≢0. also A(θ)yn−1y′=B0(θ)+Bn(θ)yn A,B0,Bn variable For first equation, we show that when n≥4, it has 3 solutions n is even 5 odd. second n≥3, odd even. provide two types mentioned above maximum number achieved. The pr...

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...