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

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

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

This repo implements the Fast Fourier Transform (FFT) to multiply two polynomials efficiently. While the naive method of multiplying polynomials takes quadratic time, this divide-and-conquer approach ...

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