IEEE

Efficient Computation of Modular Multiplicative Inverse w.r.t 2 i

Abstract: Computing Modular multiplicative inverse is an important step in many arithmetic algorithms used in Cryptography. For example, Montgomery modular multiplication [2] is required to find out ...
Scientific Research Publishing

B. Verkhovsky, “Enhanced Euclid Algorithm for Modu- lar Multiplicative Inverse and Its Complexity,” Proceed- ings of 10th International Conference on Systems Re- search ...

ABSTRACT: In certain computational systems the amount of space required to execute an algorithm is even more restrictive than the corresponding time necessary for solution of a problem. In this paper ...
Scientific Research Publishing

J. Hartmanis and R. E. Stearns, “On the Computational Complexity of Algorithms,” Transactions of the Ameri- can Mathematical Society, Vol. 117, No. 5, 1965, pp. 285-306 ...

ABSTRACT: In certain computational systems the amount of space required to execute an algorithm is even more restrictive than the corresponding time necessary for solution of a problem. In this paper ...
GitHub

mod_inverse.qbk

The modular multiplicative inverse of a number /a/ is that number /x/ which satisfies /ax/ = 1 mod /p/. A fast algorithm for computing modular multiplicative inverses based on the extended Euclidean ...
GitHub

[crypto] Modular multiplicative inverse computation - potential consolidation

There might be an opportunity to consolidate. AFAIK, Fermat plus addition chain should be fastest. For our fixed parameter P256 implementation, we invert either modulo p or n. We already have a fixed ...