본문 바로가기
  • Home

Square-and-Divide Modular Exponentiation

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2013, 18(4), pp.123-129
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

The performance and practicality of cryptosystem for encryption, decryption, and primality test are primarily determined by the implementation efficiency of the modular exponentiation of ab(mod m) .To compute ab(mod m) , the standard binary squaring (square-and-multiply) still seems to be the best choice.the standard binary squaring (square-and-multiply) still seems to be the best choice. However, in large b bits,the preprocessed n-ary,(n≥2)method could be more efficient than binary squaring method. This paper proposes a square-and-divide and unpreprocessed n-ary square-and-divide modular exponentiation method.Results confirmed that the square-and-divide method is the most efficient of trial number in a case where the value of b is adjacent to 2k+2k-1 or to 2k+1. It was also proved that for b out of the beforementioned range, the unpreprocessed n-ary square-and-divide method yields higher efficiency of trial number than the general preprocessed n-ary method.

Citation status

* References for papers published after 2023 are currently being built.