Modular Exponentiation by m-Numeral System


The KIPS Transactions:PartC, Vol. 18, No. 1, pp. 1-6, Feb. 2011
10.3745/KIPSTC.2011.18.1.1,   PDF Download:

Abstract

The performance and practicality of cryptosystem for encryption, decryption, and primality test is primarily determined by the implementation efficiency of the modular exponentiation of α(b)(mod n). To compute α(b)(mod n), the standard binary squaring still seems to be the best choice. But, the d-ary, (d=2,3,4,5,6) method is more efficient in large bits. This paper suggests -numeral system modular exponentiation. This method can be apply to b=0(mod m), 2≤m≤16. And, also suggests the another method that is exit the algorithm in the case of the result is 1 or α.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. U. Lee, "Modular Exponentiation by m-Numeral System," The KIPS Transactions:PartC, vol. 18, no. 1, pp. 1-6, 2011. DOI: 10.3745/KIPSTC.2011.18.1.1.

[ACM Style]
Sang Un Lee. 2011. Modular Exponentiation by m-Numeral System. The KIPS Transactions:PartC, 18, 1, (2011), 1-6. DOI: 10.3745/KIPSTC.2011.18.1.1.