A High-Performance and Low-Cost Montgomery Modular Multiplication Based on Redundant Binary Representation

In this brief, Redundant Binary Representation (RBR) is applied in Montgomery modular multiplication (MMM) to eliminate the long carry chain and realize parallel computation. A novel MMM algorithm based on RBR is proposed. Based on the proposed algorithm, different sizes of high-performance and low-...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2021-07, Vol.68 (7), p.2660-2664
Hauptverfasser: Li, Bing, Wang, Jinlei, Ding, Guocheng, Fu, Haisheng, Lei, Bingjie, Yang, Haitao, Bi, Jiangang, Lei, Shaochong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2664
container_issue 7
container_start_page 2660
container_title IEEE transactions on circuits and systems. II, Express briefs
container_volume 68
creator Li, Bing
Wang, Jinlei
Ding, Guocheng
Fu, Haisheng
Lei, Bingjie
Yang, Haitao
Bi, Jiangang
Lei, Shaochong
description In this brief, Redundant Binary Representation (RBR) is applied in Montgomery modular multiplication (MMM) to eliminate the long carry chain and realize parallel computation. A novel MMM algorithm based on RBR is proposed. Based on the proposed algorithm, different sizes of high-performance and low-cost Montgomery multipliers are implemented in TSMC CMOS process technology. The experimental results demonstrate that our design has significant advantages in terms of performance, area and Area-Time-Product over previous researches. It's worth mentioning that our 8192-bit Montgomery multiplier (TMSC 65nm) with 603MHz working frequency and 878.1K equivalent gates can complete the MMM in only 3403ns.
doi_str_mv 10.1109/TCSII.2021.3053630
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_9333592</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9333592</ieee_id><sourcerecordid>2546693723</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-fc9235d1e9e6f7480ecc8f68c0eaf21dc0b48c20314e0e1f00da7fe68815101a3</originalsourceid><addsrcrecordid>eNo9kMtOwzAQRSMEEqXwA7CxxDplbOflZYmAVmoFKmUdGWdcUqV2sBMh_h73IVZzF_fMjE4U3VKYUAriYV2-z-cTBoxOOKQ843AWjWiaFjHPBT3f50TEeZ7kl9GV91sAJoCzUbSdklmz-Yrf0GnrdtIoJNLUZGF_4tL6niyt6Td2h-43xHpopSPLoe2brm2U7BtryKP0WJMQVlgPppamJ4-NkQFYYefQo-kPxevoQsvW481pjqOP56d1OYsXry_zcrqIFRNpH2slGE9rigIznScFoFKFzgoFKDWjtYLPpFAMOE0QkGqAWuYas6KgKQUq-Ti6P-7tnP0e0PfV1g7OhJMVS5MsEzxnPLTYsaWc9d6hrjrX7MLXFYVq77Q6OK32TquT0wDdHaEGEf8BwTlPw9N_Taxz6Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2546693723</pqid></control><display><type>article</type><title>A High-Performance and Low-Cost Montgomery Modular Multiplication Based on Redundant Binary Representation</title><source>IEEE Electronic Library (IEL)</source><creator>Li, Bing ; Wang, Jinlei ; Ding, Guocheng ; Fu, Haisheng ; Lei, Bingjie ; Yang, Haitao ; Bi, Jiangang ; Lei, Shaochong</creator><creatorcontrib>Li, Bing ; Wang, Jinlei ; Ding, Guocheng ; Fu, Haisheng ; Lei, Bingjie ; Yang, Haitao ; Bi, Jiangang ; Lei, Shaochong</creatorcontrib><description>In this brief, Redundant Binary Representation (RBR) is applied in Montgomery modular multiplication (MMM) to eliminate the long carry chain and realize parallel computation. A novel MMM algorithm based on RBR is proposed. Based on the proposed algorithm, different sizes of high-performance and low-cost Montgomery multipliers are implemented in TSMC CMOS process technology. The experimental results demonstrate that our design has significant advantages in terms of performance, area and Area-Time-Product over previous researches. It's worth mentioning that our 8192-bit Montgomery multiplier (TMSC 65nm) with 603MHz working frequency and 878.1K equivalent gates can complete the MMM in only 3403ns.</description><identifier>ISSN: 1549-7747</identifier><identifier>EISSN: 1558-3791</identifier><identifier>DOI: 10.1109/TCSII.2021.3053630</identifier><identifier>CODEN: ICSPE5</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Adders ; Algorithms ; ASIC ; Circuits and systems ; CMOS ; Delays ; ECC ; Elliptic curve cryptography ; Hardware ; Low cost ; Montgomery modular multiplication ; Multiplication ; Parallel processing ; Power systems ; redundant binary representation ; Representations ; RSA</subject><ispartof>IEEE transactions on circuits and systems. II, Express briefs, 2021-07, Vol.68 (7), p.2660-2664</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-fc9235d1e9e6f7480ecc8f68c0eaf21dc0b48c20314e0e1f00da7fe68815101a3</citedby><cites>FETCH-LOGICAL-c295t-fc9235d1e9e6f7480ecc8f68c0eaf21dc0b48c20314e0e1f00da7fe68815101a3</cites><orcidid>0000-0002-0113-5500 ; 0000-0002-4214-6863 ; 0000-0003-1400-4689</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9333592$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9333592$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Li, Bing</creatorcontrib><creatorcontrib>Wang, Jinlei</creatorcontrib><creatorcontrib>Ding, Guocheng</creatorcontrib><creatorcontrib>Fu, Haisheng</creatorcontrib><creatorcontrib>Lei, Bingjie</creatorcontrib><creatorcontrib>Yang, Haitao</creatorcontrib><creatorcontrib>Bi, Jiangang</creatorcontrib><creatorcontrib>Lei, Shaochong</creatorcontrib><title>A High-Performance and Low-Cost Montgomery Modular Multiplication Based on Redundant Binary Representation</title><title>IEEE transactions on circuits and systems. II, Express briefs</title><addtitle>TCSII</addtitle><description>In this brief, Redundant Binary Representation (RBR) is applied in Montgomery modular multiplication (MMM) to eliminate the long carry chain and realize parallel computation. A novel MMM algorithm based on RBR is proposed. Based on the proposed algorithm, different sizes of high-performance and low-cost Montgomery multipliers are implemented in TSMC CMOS process technology. The experimental results demonstrate that our design has significant advantages in terms of performance, area and Area-Time-Product over previous researches. It's worth mentioning that our 8192-bit Montgomery multiplier (TMSC 65nm) with 603MHz working frequency and 878.1K equivalent gates can complete the MMM in only 3403ns.</description><subject>Adders</subject><subject>Algorithms</subject><subject>ASIC</subject><subject>Circuits and systems</subject><subject>CMOS</subject><subject>Delays</subject><subject>ECC</subject><subject>Elliptic curve cryptography</subject><subject>Hardware</subject><subject>Low cost</subject><subject>Montgomery modular multiplication</subject><subject>Multiplication</subject><subject>Parallel processing</subject><subject>Power systems</subject><subject>redundant binary representation</subject><subject>Representations</subject><subject>RSA</subject><issn>1549-7747</issn><issn>1558-3791</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMtOwzAQRSMEEqXwA7CxxDplbOflZYmAVmoFKmUdGWdcUqV2sBMh_h73IVZzF_fMjE4U3VKYUAriYV2-z-cTBoxOOKQ843AWjWiaFjHPBT3f50TEeZ7kl9GV91sAJoCzUbSdklmz-Yrf0GnrdtIoJNLUZGF_4tL6niyt6Td2h-43xHpopSPLoe2brm2U7BtryKP0WJMQVlgPppamJ4-NkQFYYefQo-kPxevoQsvW481pjqOP56d1OYsXry_zcrqIFRNpH2slGE9rigIznScFoFKFzgoFKDWjtYLPpFAMOE0QkGqAWuYas6KgKQUq-Ti6P-7tnP0e0PfV1g7OhJMVS5MsEzxnPLTYsaWc9d6hrjrX7MLXFYVq77Q6OK32TquT0wDdHaEGEf8BwTlPw9N_Taxz6Q</recordid><startdate>20210701</startdate><enddate>20210701</enddate><creator>Li, Bing</creator><creator>Wang, Jinlei</creator><creator>Ding, Guocheng</creator><creator>Fu, Haisheng</creator><creator>Lei, Bingjie</creator><creator>Yang, Haitao</creator><creator>Bi, Jiangang</creator><creator>Lei, Shaochong</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-0113-5500</orcidid><orcidid>https://orcid.org/0000-0002-4214-6863</orcidid><orcidid>https://orcid.org/0000-0003-1400-4689</orcidid></search><sort><creationdate>20210701</creationdate><title>A High-Performance and Low-Cost Montgomery Modular Multiplication Based on Redundant Binary Representation</title><author>Li, Bing ; Wang, Jinlei ; Ding, Guocheng ; Fu, Haisheng ; Lei, Bingjie ; Yang, Haitao ; Bi, Jiangang ; Lei, Shaochong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-fc9235d1e9e6f7480ecc8f68c0eaf21dc0b48c20314e0e1f00da7fe68815101a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Adders</topic><topic>Algorithms</topic><topic>ASIC</topic><topic>Circuits and systems</topic><topic>CMOS</topic><topic>Delays</topic><topic>ECC</topic><topic>Elliptic curve cryptography</topic><topic>Hardware</topic><topic>Low cost</topic><topic>Montgomery modular multiplication</topic><topic>Multiplication</topic><topic>Parallel processing</topic><topic>Power systems</topic><topic>redundant binary representation</topic><topic>Representations</topic><topic>RSA</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Bing</creatorcontrib><creatorcontrib>Wang, Jinlei</creatorcontrib><creatorcontrib>Ding, Guocheng</creatorcontrib><creatorcontrib>Fu, Haisheng</creatorcontrib><creatorcontrib>Lei, Bingjie</creatorcontrib><creatorcontrib>Yang, Haitao</creatorcontrib><creatorcontrib>Bi, Jiangang</creatorcontrib><creatorcontrib>Lei, Shaochong</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on circuits and systems. II, Express briefs</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Li, Bing</au><au>Wang, Jinlei</au><au>Ding, Guocheng</au><au>Fu, Haisheng</au><au>Lei, Bingjie</au><au>Yang, Haitao</au><au>Bi, Jiangang</au><au>Lei, Shaochong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A High-Performance and Low-Cost Montgomery Modular Multiplication Based on Redundant Binary Representation</atitle><jtitle>IEEE transactions on circuits and systems. II, Express briefs</jtitle><stitle>TCSII</stitle><date>2021-07-01</date><risdate>2021</risdate><volume>68</volume><issue>7</issue><spage>2660</spage><epage>2664</epage><pages>2660-2664</pages><issn>1549-7747</issn><eissn>1558-3791</eissn><coden>ICSPE5</coden><abstract>In this brief, Redundant Binary Representation (RBR) is applied in Montgomery modular multiplication (MMM) to eliminate the long carry chain and realize parallel computation. A novel MMM algorithm based on RBR is proposed. Based on the proposed algorithm, different sizes of high-performance and low-cost Montgomery multipliers are implemented in TSMC CMOS process technology. The experimental results demonstrate that our design has significant advantages in terms of performance, area and Area-Time-Product over previous researches. It's worth mentioning that our 8192-bit Montgomery multiplier (TMSC 65nm) with 603MHz working frequency and 878.1K equivalent gates can complete the MMM in only 3403ns.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCSII.2021.3053630</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0002-0113-5500</orcidid><orcidid>https://orcid.org/0000-0002-4214-6863</orcidid><orcidid>https://orcid.org/0000-0003-1400-4689</orcidid></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1549-7747
ispartof IEEE transactions on circuits and systems. II, Express briefs, 2021-07, Vol.68 (7), p.2660-2664
issn 1549-7747
1558-3791
language eng
recordid cdi_ieee_primary_9333592
source IEEE Electronic Library (IEL)
subjects Adders
Algorithms
ASIC
Circuits and systems
CMOS
Delays
ECC
Elliptic curve cryptography
Hardware
Low cost
Montgomery modular multiplication
Multiplication
Parallel processing
Power systems
redundant binary representation
Representations
RSA
title A High-Performance and Low-Cost Montgomery Modular Multiplication Based on Redundant Binary Representation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T18%3A53%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20High-Performance%20and%20Low-Cost%20Montgomery%20Modular%20Multiplication%20Based%20on%20Redundant%20Binary%20Representation&rft.jtitle=IEEE%20transactions%20on%20circuits%20and%20systems.%20II,%20Express%20briefs&rft.au=Li,%20Bing&rft.date=2021-07-01&rft.volume=68&rft.issue=7&rft.spage=2660&rft.epage=2664&rft.pages=2660-2664&rft.issn=1549-7747&rft.eissn=1558-3791&rft.coden=ICSPE5&rft_id=info:doi/10.1109/TCSII.2021.3053630&rft_dat=%3Cproquest_RIE%3E2546693723%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2546693723&rft_id=info:pmid/&rft_ieee_id=9333592&rfr_iscdi=true