Polynomial moduloreduction algorithms are one of the fundamental issues of computer algebra, and widely used in coding algorithms and cryptographic system design.
多项式模归约算法是计算机代数中的基本问题之一,在编码算法和密码体制设计中有着广泛应用。
2
Generally, this problem is reduced to quadratic residue problem of modulo a big prime number. But this reduction is not applicable to Optimal Extension Fields (OEF).