An efficient signed digit montgomery multiplication for RSA

Daesung Lim, Nam Su Chang, Sung Yeon Ji, Chang Han Kim, Sangjin Lee, Young Ho Park

Research output: Contribution to journalArticle

5 Citations (Scopus)

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

Original languageEnglish
Pages (from-to)355-362
Number of pages8
JournalJournal of Systems Architecture
Volume55
Issue number7-9
DOIs
Publication statusPublished - 2009 Jul

Keywords

  • Montgomery multiplication
  • Signed digit adder
  • Signed digit number representation

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'An efficient signed digit montgomery multiplication for RSA'. Together they form a unique fingerprint.

  • Cite this