On Computing Modular Multiplicative Inverse

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 succe...

Full description

Saved in:
Bibliographic Details
Published in:Lecture notes in engineering and computer science Vol. 2242; p. 7
Main Author: Man, Yiu-Kwong
Format: Journal Article
Language:English
Published: Hong Kong International Association of Engineers 07.07.2021
Subjects:
Algorithms
Computation
Quotients
ISSN:2078-0958, 2078-0966
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2078-0958
2078-0966