Modular Exponentiation by m-Numeral System 


Vol. 18,  No. 1, pp. 1-6, Feb.  2011
10.3745/KIPSTC.2011.18.1.1


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

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals