Лекції

Abstract. In this talk, we focus on the modular polynomial multiplication the core part of the ring variant of lattice-based cryptographic schemes in terms of efficiency. We modify well-known algorithms for sparse polynomial multiplication. With the modified methods, we significantly speed up the multiplication operation over the quotient ring (Z/qZ) / (xⁿ ∓ 1) in software. Then, we discuss the prime selection yielding efficient modular reducion in lattice-based cryptographic schemes. Compared with the state of the art, we obtain the lowest arithmetic complexity with the proposed list of primes for hardware implementations.