Abstract: High-speed long polynomial multiplication is important for applications in homomorphic encryption (HE) and lattice-based cryptosystems. This paper addresses low-latency hardware ...

Abstract: Post-quantum cryptography (PQC) is a rapidly growing field that aims to develop cryptographic algorithms that can resist attacks by quantum computers. Large-degree polynomial multiplication ...

Multiplication is an essential step in a lot of calculations. In this paper we look at multiplication of 2 binary polynomials of degree at most n − 1, modulo an irreducible polynomial of degree n with ...

Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...

With the advance of quantum computers, there is an urgent need to find replacements for public-key cryptography threatened by Shor’s quantum algorithm. This thesis presents work towards understanding ...

Polynomial Class in Python: A Python implementation of a Polynomial class that supports addition, subtraction, multiplication by a number, evaluation for specific values, and a human-readable string ...