.png){kind=icon}
.png){kind=icon}
Return
Algorithms for Inversion Mod pk
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2020.2970411.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article describes and analyzes all existing algorithms for computing x = a(-1) omod pk THORN for a prime p, and also introduces a new algorithm based on the exact solution of linear equations using p-adic expansions. The algorithm starts with the initial value c = a(-1) omod pTHORN and iteratively computes the digits of the inverse x = a(-1) omod pk THORN in base p. The mod 2 version of the algorithm is more efficient than all existing algorithms for small values of k. Moreover, it stands out as being the only one that works for any p, any k, and digit-by-digit. While the new algorithm is asymptotically worse off, it requires the minimal number of arithmetic operations (just a single addition) per step, as compared to all existing algorithms.
Keywords:
Number-theoretic algorithms
computer arithmetic
multiplicative inverse
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K