Polynomial modulo reduction algorithms are one of the fundamental issues of computer algebra, and widely used in coding algorithms and cryptographic system design.

多项式模归约算法是计算机代数中的基本问题之一，在编码算法和密码体制设计中有着广泛应用。

youdao

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

一般而言，该问题归结为模大素数的二次剩余问题，但这种归结不能用于最优扩域OEF。

youdao