Abstract: In the basic operations of the GGH-based post-quantum public-key cryptography scheme, polynomial multiplication consumes a large amount of time in edge-based consumer electronics devices ...

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

Abstract: Polynomial multiplication over finite fields is one of the most significant operations in code-based cryptography, including hamming quasi-cyclic (HQC), which has been selected as a ...