一种新的重模剩余类环中元素逆的求法

A new method of solving the polynomial inverse in repeat module polynomial ring

在研究重模多项式加密算法中,需要求重模多项式的逆多项式。本文给出了数模为素数幂的重模多项式环上逆元素的存在性判断方法,及一个新的求逆算法。

For researching the encrypt algorithm based on repeat module polynomial ring, it need to solve the inverse of element in the ring. In this paper, we propose an inverse existence judgment for the element in the repeat module polynomial ring which has the prime module and bringing forward an algorithm to carry out solving of the inverse.