A synchronous modular multiplier with variable latency
Modular multiplication is a very important arithmetic operation in cryptography systems and residue-based computation. This paper presents a synchronous modular multiplier that has variable computation latency depending on operand values. The modular reduction operation is based on SRT radix-2 divis...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 321 |
---|---|
container_issue | |
container_start_page | 318 |
container_title | |
container_volume | |
creator | Kuan Jen Lin Yen Hung Lin |
description | Modular multiplication is a very important arithmetic operation in cryptography systems and residue-based computation. This paper presents a synchronous modular multiplier that has variable computation latency depending on operand values. The modular reduction operation is based on SRT radix-2 division. However, the quotient selection function in certain stages is adapted for reducing delay and area. The proposed variable latency design was synthesized and verified with TSMC 0.18 mum technology. It can achieve significant computation time reduction compared to a fixed-latency design, while needing only 4 % larger area. |
doi_str_mv | 10.1109/MWSCAS.2008.4616800 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4616800</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4616800</ieee_id><sourcerecordid>4616800</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-458015b7882237ad20cad2c434e4dce75b5c368344b2c3a94cfbd4fc3710f9de3</originalsourceid><addsrcrecordid>eNo1j0lOwzAYhc0k0ZaeoBtfIMHD72kZRVCQilgUxLJyHEc1cpIqAyi3J4iyeW_xSW9AaENJSikx9y8f-zzbp4wQnYKkUhNygZYUGACjUolLtKBC6IRrY67Q2ij9zyRc_zKYmQJ5i5Z9_0kI44qaBZIZ7qfGHbu2acce1205RtvheoxDOMXgO_wdhiP-sl2wRfQ42sE3brpDN5WNvV-ffYXeHx_e8qdk97p9zrNdEqgSQwJCEyoKpTWb-2zJiJvFAQcPpfNKFMJxqTlAwRy3BlxVlFC5eRupTOn5Cm3-coP3_nDqQm276XD-z38A4ohLIw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A synchronous modular multiplier with variable latency</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kuan Jen Lin ; Yen Hung Lin</creator><creatorcontrib>Kuan Jen Lin ; Yen Hung Lin</creatorcontrib><description>Modular multiplication is a very important arithmetic operation in cryptography systems and residue-based computation. This paper presents a synchronous modular multiplier that has variable computation latency depending on operand values. The modular reduction operation is based on SRT radix-2 division. However, the quotient selection function in certain stages is adapted for reducing delay and area. The proposed variable latency design was synthesized and verified with TSMC 0.18 mum technology. It can achieve significant computation time reduction compared to a fixed-latency design, while needing only 4 % larger area.</description><identifier>ISSN: 1548-3746</identifier><identifier>ISBN: 9781424421664</identifier><identifier>ISBN: 1424421667</identifier><identifier>EISSN: 1558-3899</identifier><identifier>EISBN: 1424421675</identifier><identifier>EISBN: 9781424421671</identifier><identifier>DOI: 10.1109/MWSCAS.2008.4616800</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Cryptography ; Delay ; Equations ; Hardware ; Logic gates ; Signal processing algorithms</subject><ispartof>2008 51st Midwest Symposium on Circuits and Systems, 2008, p.318-321</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4616800$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4616800$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kuan Jen Lin</creatorcontrib><creatorcontrib>Yen Hung Lin</creatorcontrib><title>A synchronous modular multiplier with variable latency</title><title>2008 51st Midwest Symposium on Circuits and Systems</title><addtitle>MWSCAS</addtitle><description>Modular multiplication is a very important arithmetic operation in cryptography systems and residue-based computation. This paper presents a synchronous modular multiplier that has variable computation latency depending on operand values. The modular reduction operation is based on SRT radix-2 division. However, the quotient selection function in certain stages is adapted for reducing delay and area. The proposed variable latency design was synthesized and verified with TSMC 0.18 mum technology. It can achieve significant computation time reduction compared to a fixed-latency design, while needing only 4 % larger area.</description><subject>Algorithm design and analysis</subject><subject>Cryptography</subject><subject>Delay</subject><subject>Equations</subject><subject>Hardware</subject><subject>Logic gates</subject><subject>Signal processing algorithms</subject><issn>1548-3746</issn><issn>1558-3899</issn><isbn>9781424421664</isbn><isbn>1424421667</isbn><isbn>1424421675</isbn><isbn>9781424421671</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j0lOwzAYhc0k0ZaeoBtfIMHD72kZRVCQilgUxLJyHEc1cpIqAyi3J4iyeW_xSW9AaENJSikx9y8f-zzbp4wQnYKkUhNygZYUGACjUolLtKBC6IRrY67Q2ij9zyRc_zKYmQJ5i5Z9_0kI44qaBZIZ7qfGHbu2acce1205RtvheoxDOMXgO_wdhiP-sl2wRfQ42sE3brpDN5WNvV-ffYXeHx_e8qdk97p9zrNdEqgSQwJCEyoKpTWb-2zJiJvFAQcPpfNKFMJxqTlAwRy3BlxVlFC5eRupTOn5Cm3-coP3_nDqQm276XD-z38A4ohLIw</recordid><startdate>200808</startdate><enddate>200808</enddate><creator>Kuan Jen Lin</creator><creator>Yen Hung Lin</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200808</creationdate><title>A synchronous modular multiplier with variable latency</title><author>Kuan Jen Lin ; Yen Hung Lin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-458015b7882237ad20cad2c434e4dce75b5c368344b2c3a94cfbd4fc3710f9de3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithm design and analysis</topic><topic>Cryptography</topic><topic>Delay</topic><topic>Equations</topic><topic>Hardware</topic><topic>Logic gates</topic><topic>Signal processing algorithms</topic><toplevel>online_resources</toplevel><creatorcontrib>Kuan Jen Lin</creatorcontrib><creatorcontrib>Yen Hung Lin</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kuan Jen Lin</au><au>Yen Hung Lin</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A synchronous modular multiplier with variable latency</atitle><btitle>2008 51st Midwest Symposium on Circuits and Systems</btitle><stitle>MWSCAS</stitle><date>2008-08</date><risdate>2008</risdate><spage>318</spage><epage>321</epage><pages>318-321</pages><issn>1548-3746</issn><eissn>1558-3899</eissn><isbn>9781424421664</isbn><isbn>1424421667</isbn><eisbn>1424421675</eisbn><eisbn>9781424421671</eisbn><abstract>Modular multiplication is a very important arithmetic operation in cryptography systems and residue-based computation. This paper presents a synchronous modular multiplier that has variable computation latency depending on operand values. The modular reduction operation is based on SRT radix-2 division. However, the quotient selection function in certain stages is adapted for reducing delay and area. The proposed variable latency design was synthesized and verified with TSMC 0.18 mum technology. It can achieve significant computation time reduction compared to a fixed-latency design, while needing only 4 % larger area.</abstract><pub>IEEE</pub><doi>10.1109/MWSCAS.2008.4616800</doi><tpages>4</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1548-3746 |
ispartof | 2008 51st Midwest Symposium on Circuits and Systems, 2008, p.318-321 |
issn | 1548-3746 1558-3899 |
language | eng |
recordid | cdi_ieee_primary_4616800 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Algorithm design and analysis Cryptography Delay Equations Hardware Logic gates Signal processing algorithms |
title | A synchronous modular multiplier with variable latency |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T09%3A49%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20synchronous%20modular%20multiplier%20with%20variable%20latency&rft.btitle=2008%2051st%20Midwest%20Symposium%20on%20Circuits%20and%20Systems&rft.au=Kuan%20Jen%20Lin&rft.date=2008-08&rft.spage=318&rft.epage=321&rft.pages=318-321&rft.issn=1548-3746&rft.eissn=1558-3899&rft.isbn=9781424421664&rft.isbn_list=1424421667&rft_id=info:doi/10.1109/MWSCAS.2008.4616800&rft_dat=%3Cieee_6IE%3E4616800%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424421675&rft.eisbn_list=9781424421671&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4616800&rfr_iscdi=true |