A simple efficient method for computing modular multiplicative inverse is presented. This approach has the advantage that the backward substitutions commonly adopted for the Extended Euclidean Algorithm (EEA) can be avoided. The modular multiplicative inverse can be computed effectively by the successive quotients obtained in the Euclidean Algorithm (EA). Some illustrative examples are provided. Copyright © 2021 Newswood Limited. All rights reserved.
|Title of host publication||Proceedings of the World Congress on Engineering 2021|
|Editors||S. I. AO, Len GELMAN, David WL HUKINS, A. M. KORSUNSKY|
|Place of Publication||Hong Kong|
|Publication status||Published - 2021|
CitationMan, Y. K. (2021). On computing modular multiplicative inverse. In S. I. Ao, L. Gelman, D. W. L. Hukins, & A. M. Korsunsky (Eds.), Proceedings of the World Congress on Engineering 2021 (pp. 7-9). Hong Kong: Newswood Limited.
- Modular multiplicative inverse
- Euclidean Algorithm
- Extended Euclidean Algorithm
- Chinese Remainder Theorem