An efficient signed digit montgomery multiplication for RSA
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lim, Daesung | - |
dc.contributor.author | Chang, Nam Su | - |
dc.contributor.author | Ji, Sung Yeon | - |
dc.contributor.author | Kim, Chang Han | - |
dc.contributor.author | Lee, Sangjin | - |
dc.contributor.author | Park, Young-Ho | - |
dc.date.accessioned | 2021-09-08T16:02:04Z | - |
dc.date.available | 2021-09-08T16:02:04Z | - |
dc.date.created | 2021-06-10 | - |
dc.date.issued | 2009-07 | - |
dc.identifier.issn | 1383-7621 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/119798 | - |
dc.description.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 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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.subject | REDUNDANT | - |
dc.subject | ALGORITHM | - |
dc.title | An efficient signed digit montgomery multiplication for RSA | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Sangjin | - |
dc.identifier.doi | 10.1016/j.sysarc.2009.04.001 | - |
dc.identifier.scopusid | 2-s2.0-70349312626 | - |
dc.identifier.wosid | 000271358800001 | - |
dc.identifier.bibliographicCitation | JOURNAL OF SYSTEMS ARCHITECTURE, v.55, no.7-9, pp.355 - 362 | - |
dc.relation.isPartOf | JOURNAL OF SYSTEMS ARCHITECTURE | - |
dc.citation.title | JOURNAL OF SYSTEMS ARCHITECTURE | - |
dc.citation.volume | 55 | - |
dc.citation.number | 7-9 | - |
dc.citation.startPage | 355 | - |
dc.citation.endPage | 362 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.subject.keywordPlus | REDUNDANT | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordAuthor | Montgomery multiplication | - |
dc.subject.keywordAuthor | Signed digit adder | - |
dc.subject.keywordAuthor | Signed digit number representation | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.