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 = ∏ i n i into a set of RLWE samples with dimension max i { n i } . This is especially devastating for low-degree cyclotomics (e.g., Φ 4 ( x ) = 1 + x 2 ). 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.