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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Lecture notes in engineering and computer science Ročník 2242; s. 7
Hlavní autor: Man, Yiu-Kwong
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hong Kong International Association of Engineers 07.07.2021
Témata:
Algorithms
Computation
Quotients
ISSN:2078-0958, 2078-0966
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2078-0958
2078-0966