Euclid’s Algorithm and its Role in Solving Modular Multiplicative Inverse

Authors

  • Dev Raj Kandel DipHE Mathematics with Computing, Middlesex University, United Kingdom

DOI:

https://doi.org/10.3126/kdk.v4i1.64567

Keywords:

Algorithm, conjugacy class, data structure, java, modulus, number theory

Abstract

In this article, the prime motivation is to demonstrate how calculating modular multiplicative inverse can be simplified computationally with the help of Euclid’s algorithm, which is usually attributed to finding the Greatest Common Divisor.

Downloads

Download data is not yet available.
Abstract
25
PDF
13

Downloads

Published

2024-04-09

How to Cite

Kandel, D. R. . (2024). Euclid’s Algorithm and its Role in Solving Modular Multiplicative Inverse. Kaumodaki: Journal of Multidisciplinary Studies, 4(1), 85–95. https://doi.org/10.3126/kdk.v4i1.64567

Issue

Section

Articles