ACM Transactions on Mathematical Software (TOMS) | 2019

Verified Newton–Raphson Iteration for Multiplicative Inverses Modulo Powers of Any Base



We identify two faults in a published algorithm for fast computation of multiplicative inverses modulo prime powers. We patch the algorithm and present machine-assisted proofs of correctness of the repair. Our formal proofs also reveal that being prime is an unnecessary demand for the power base, thus attributing a wider scope of applications to the repaired algorithm.

Volume 45
Pages 1 - 7
DOI 10.1145/3301317
Language English
Journal ACM Transactions on Mathematical Software (TOMS)

Full Text