Related papers: Cryptanalysis of PLWE based on zero-trace quadrati…

Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Motivated by the question of whether a random polynomial with integer coefficients is likely to be irreducible, we study the probability that a monic polynomial with integer coefficients has a low-degree factor over the integers, which is…

The first aim of this note is to fill a gap in the literature by proving that, given a global field $K$ and a finite set $\mathcal{S}$ of primes of $K$, every finite split embedding problem $G \rightarrow {\rm{Gal}}(L/K)$ over $K$ with…

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…

An exponential polynomial of order $q$ is an entire function of the form $$ f(z)=P_1(z)e^{Q_1(z)}+\cdots +P_k(z)e^{Q_k(z)}, $$ where the coefficients $P_j(z),Q_j(z)$ are polynomials in $z$ such that $$ \max\{\deg{Q_j}\}=q. $$ In 1977…

Consider a connected graph $G$, and assume that every edge fails independently with probability $q$. The {\em (all-terminal) reliability polynomial} is the probability in $q$ that the spanning connected subgraph of operational edges is…

In this paper, we present attacks on three types of RSA modulus when the least significant bits of the prime factors of RSA modulus satisfy some conditions. Let $p,$ and $q$ be primes of the form $p=a^{m_1}+r_p$ and $q=b^{m_2}+r_q$…

Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

The Ring-Learning With Errors (RLWE) problem forms the backbone of highly efficient Fully Homomorphic Encryption (FHE) schemes. A significant component of the RLWE public key and ciphertext of the form $(b,a)$ is the uniformly random…

Let $R$ be a commutative ring with identity. An element $r \in R$ is said to be absolutely irreducible in $R$ if for all natural numbers $n>1$, $r^n$ has essentially only one factorization namely $r^n = r \cdots r$. If $r \in R$ is…

We study the class of univariate polynomials $\beta_k(X)$, introduced by Carlitz, with coefficients in the algebraic function field $\mathbb F_q(t)$ over the finite field $\mathbb F_q$ with $q$ elements. It is implicit in the work of…

We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…

In this paper we give a factorization theorem for the ring of exponential polynomials in many variables over an algebraically closed field of characteristic 0 with an exponentiation. This is a generalization of the factorization theorem due…

Sparse binary LWE secrets are under consideration for standardization for Homomorphic Encryption and its applications to private computation. Known attacks on sparse binary LWE secrets include the sparse dual attack and the hybrid sparse…

Unconditional security of quantum key distribution protocol can be guaranteed by the basic property of quantum mechanics. Unfortunately, the practical quantum key distribution system always have some imperfections, and the practical system…

We construct a strong PUF with provable security against ML attacks on both classical and quantum computers. The security is guaranteed by the cryptographic hardness of learning decryption functions of public-key cryptosystems, and the…

Let $G$ and $\tilde G$ be connected complex reductive Lie groups, $G$ semisimple. Let $\Lambda^+$ be the monoid of dominant weights for a positive root system $\Delta^+$, and let $l(w)$ be the length of a Weyl group element $w$. Let…

For a given irreducible and monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree $4$, we consider the quadratic twists by square-free integers $q$ of the genus one quartic ${H\, :\, y^2=f(x)}$ \[ H_q \, :\, qy^2=f(x). \] We say that a curve…