摘要
讨论在模n=pk(p是素数)剩余类环R中计算逆元的算法。本文引入可逆元的阶的概念,在对阶的性质进行讨论的基础上,提出计算逆元的逐位消除算法。算法的时间复杂度为O(k2)=O((logpn)2)。
This paper discusses the algorithm on Z（pk） for computing inverse elements, while p is a prime. The paper introduces the concept of order of reversible element and the algorithm called the iterative elimination by bit. The complexity of this algorithm is O（（logpn）2 ）.
出处
《计算机与现代化》
2012年第7期41-43,共3页
Computer and Modernization
关键词
剩余类环
逆元
逐位消除法
remaider class ring
inverse element
iterative elimination by bit
