An efficient signed digit montgomery multiplication for RSA

  • Lim, Daesung
  • Chang, Nam Su
  • Ji, Sung Yeon
  • Kim, Chang Han
  • Lee, Sangjin
  • 외 1명
Citations

WEB OF SCIENCE

7
Citations

SCOPUS

8

초록

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 130 0.18 mu m 1.8 V 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. (C) 2009 Elsevier B.V. All rights reserved.

키워드

Montgomery multiplicationSigned digit adderSigned digit number representationREDUNDANTALGORITHM
제목
An efficient signed digit montgomery multiplication for RSA
저자
Lim, DaesungChang, Nam SuJi, Sung YeonKim, Chang HanLee, SangjinPark, Young-Ho
DOI
10.1016/j.sysarc.2009.04.001
발행일
2009-07
유형
Article
저널명
Journal of Systems Architecture
55
7-9
페이지
355 ~ 362