On computing modular multiplicative inverse

Research output: Chapter in Book/Report/Conference proceedingChapters

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the World Congress on Engineering 2021
EditorsS. I. AO, Len GELMAN, David WL HUKINS, A. M. KORSUNSKY
Place of PublicationHong Kong
PublisherNewswood Limited
Pages7-9
ISBN (Electronic)9789881404923
Publication statusPublished - 2021

Citation

Man, 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.

Keywords

  • Modular multiplicative inverse
  • Euclidean Algorithm
  • Extended Euclidean Algorithm
  • Chinese Remainder Theorem

Fingerprint

Dive into the research topics of 'On computing modular multiplicative inverse'. Together they form a unique fingerprint.