计算机与现代化Issue(7):41-43,3.DOI:10.3969/j.issn.1006-2475.2012.07.011
在Z(pk)中计算逆元的逐位消除算法
Iterative Elimination Algorithm on Z(pk) for Computing Inverse Elements
摘要
Abstract
This paper discusses the algorithm on Z( p ) 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).关键词
剩余类环/逆元/逐位消除法Key words
remaider class ring/ inverse element/ iterative elimination by bit分类
信息技术与安全科学引用本文复制引用
刘萍..在Z(pk)中计算逆元的逐位消除算法[J].计算机与现代化,2012,(7):41-43,3.