This paper is published in Volume 5, Issue 5, 2020
Area
Mathematics and Computer Science
Author
Zin Mar Win
Co-authors
Khin Mar Cho
Org/Univ
University of Computer Studies, Myitkyina, Myanmar, Myanmar (Burma)
Pub. Date
18 May, 2020
Paper ID
V5I5-1139
Publisher
Keywords
Learning Aid, Modulo Operation, Remainder, Modular Exponentiation, Calculator

Citationsacebook

IEEE
Zin Mar Win, Khin Mar Cho. Three methods of finding remainder on the operation of modular exponentiation by using calculator, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARnD.com.

APA
Zin Mar Win, Khin Mar Cho (2020). Three methods of finding remainder on the operation of modular exponentiation by using calculator. International Journal of Advance Research, Ideas and Innovations in Technology, 5(5) www.IJARnD.com.

MLA
Zin Mar Win, Khin Mar Cho. "Three methods of finding remainder on the operation of modular exponentiation by using calculator." International Journal of Advance Research, Ideas and Innovations in Technology 5.5 (2020). www.IJARnD.com.

Abstract

The primary purpose of this paper is that the contents of the paper were to become a learning aid for the learners. Learning aids enhance one's learning abilities and help to increase one's learning potential. They may include books, diagram, computer, recordings, notes, strategies, or any other appropriate items. In this paper we would review the types of modulo operations and represent the knowledge which we have been known with the easiest ways. The modulo operation is finding of the remainder when dividing. The modulus operator abbreviated “mod” or “%” in many programming languages is useful in a variety of circumstances. It is commonly used to take a randomly generated number and reduce that number to a random number on a smaller range, and it can also quickly tell us if one number is a factor of another. If we wanted to know if a number was odd or even, we could use modulus to quickly tell us by asking for the remainder of the number when divided by 2. Modular exponentiation is a type of exponentiation performed over a modulus. The operation of modular exponentiation calculates the remainder c when an integer b rose to the eth power, bᵉ, is divided by a positive integer m such as c = be mod m [1]. It is useful in computer science, especially in the field of public-key cryptography. The modulo operation is important for cryptography because it can act as a one-way function that the output obscures the input. In this paper we discuss the three methods of finding the remainder in the modular exponentiation based on the formula by using a calculator.
Paper PDF