Abstract: Numerous works have addressed efficient parallel $(GF(2^m))$ multiplication based on polynomial basis or some of its variants. For those field degrees where neither irreducible trinomials ...

Abstract: Quantum computers pose a significant threat to modern cryptographic systems by efficiently solving problems such as integer factorization through Shor’s algorithm. Homomorphic encryption (HE ...

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

Number theoretic transform (NTT) is widely recognized as the most efficient method for computing polynomial multiplication with high dimension and integral coefficients, due to its quasilinear ...

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 ...

Add a description, image, and links to the polynomial-multiplication topic page so that developers can more easily learn about it.