An efficient signed digit montgomery multiplication for RSA

  • Authors:
  • Daesung Lim;Nam Su Chang;Sung Yeon Ji;Chang Han Kim;Sangjin Lee;Young-Ho Park

  • Affiliations:
  • Center for Information and Security Technologies (CIST), Korea University, Seoul, Republic of Korea;Center for Information and Security Technologies (CIST), Korea University, Seoul, Republic of Korea;Center for Information and Security Technologies (CIST), Korea University, Seoul, Republic of Korea;Dept. of Information and Security, Semyeong University, Jechon, Republic of Korea;Center for Information and Security Technologies (CIST), Korea University, Seoul, Republic of Korea;Dept. of Information Security Systems, Sejong Cyber University, Seoul, Republic of Korea

  • Venue:
  • Journal of Systems Architecture: the EUROMICRO Journal
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present an efficient Montgomery multiplier using the signed digit number representation suitable for modular exponentiation, which is the main operation of RSA. The multiplier consists of one level of signed digit adder plus multiplexer through a precomputation. We design the multiplier with the improved signed digit adder using SAMSUNG STD 1300.18@mm 1.8V CMOS Standard Cell Library and compare to multipliers with other previous adders. The proposed modular multiplier can be applied to public key cryptosystems based on integer arithmetic such as RSA, DSA or ECC.