Irreducible skew polynomials over domains

Let S be a domain and R = S[t; σ, δ] a skew polynomial ring, where σ is an injective endomorphism of S and δ a left σ -derivation. We give criteria for skew polynomials f ∈ R of degree less or equal to four to be irreducible. We apply them to low degree polynomials in quantized Weyl algebras and the quantum planes. We also consider f(t) = tm − a ∈ R.

Revisiting Multivariate Ring Learning with Errors and Its Applications on Lattice-Based Cryptography

The “Multivariate Ring Learning with Errors” problem was presented as a generalization of Ring Learning with Errors (RLWE), introducing efficiency improvements with respect to the RLWE counterpart thanks to its multivariate structure. Nevertheless, the recent attack presented by Bootland, Castryck and Vercauteren has some important consequences on the security of the multivariate RLWE problem with “non-coprime” cyclotomics; this attack transforms instances of m-RLWE with power-of-two cyclotomic polynomials of degree n=∏ini into a set of RLWE samples with dimension maxi{ni}. This is especially devastating for low-degree cyclotomics (e.g., Φ4(x)=1+x2). In this work, we revisit the security of multivariate RLWE and propose new alternative instantiations of the problem that avoid the attack while still preserving the advantages of the multivariate structure, especially when using low-degree polynomials. Additionally, we show how to parameterize these instances in a secure and practical way, therefore enabling constructions and strategies based on m-RLWE that bring notable space and time efficiency improvements over current RLWE-based constructions.

Guest Column

The approximate degree of a Boolean function f captures how well f can be approximated pointwise by low-degree polynomials. This article surveys what we know about approximate degree and illustrates some of its applications in theoretical computer science.

Generating Root-Finder Iterative Methods of Second Order: Convergence and Stability

In this paper, a simple family of one-point iterative schemes for approximating the solutions of nonlinear equations, by using the procedure of weight functions, is derived. The convergence analysis is presented, showing the sufficient conditions for the weight function. Many known schemes are members of this family for particular choices of the weight function. The dynamical behavior of one of these choices is presented, analyzing the stability of the fixed points and the critical points of the rational function obtained when the iterative expression is applied on low degree polynomials. Several numerical tests are given to compare different elements of the proposed family on non-polynomial problems.