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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Lecture notes in engineering and computer science Jg. 2242; S. 7
1. Verfasser: Man, Yiu-Kwong
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hong Kong International Association of Engineers 07.07.2021
Schlagworte:
Algorithms
Computation
Quotients
ISSN:2078-0958, 2078-0966
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2078-0958
2078-0966