Nguyễn Đình Thúc – ĐH Khoa học tự nhiên
ABSTRACT
In field K, given two polynomials: a(x) = ∑ 0≤i<n aixi; b(x) = ∑ 0≤i<n bixi and m(x) = xn – 1. This paper presents a computational algorithm for polynomial multiplication:u(x) ≡ a(x)b(x) mod m(x) = ∑ 0≤i<n uixi.The coefficients (ui)0≤i<n are determined based on convolution and using the Chinese remainder theorem.
Full text (click here)