Open AccessMODULAR EXPONENTIATION
Author(s) -
Sorin Iftene
Publication year - 2014
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.2.3.229
Subject(s) - modular exponentiation , exponentiation , primality test , cryptography , computer science , arithmetic , modular design , mathematics , theoretical computer science , public key cryptography , algorithm , discrete mathematics , encryption , computer security , prime number , programming language , mathematical analysis
Exponentiation is a fundamental operation in computational number theory. Primality testing and cryptography are important working fields in which the exponentiation is heavily used. In this paper we survey the most popular methods for modular exponentiation: basic techniques, fixed-exponent techniques, fixed-base techniques, and techniques based on modulus particularities. Some aspects related to parallelism are also discussed.