Loading…
Low-Latency Digit-Serial Systolic Double Basis Multiplier over \mbi GF) Using Subquadratic Toeplitz Matrix-Vector Product Approach
Recently in cryptography and security, the multipliers with subquadratic space complexity for trinomials and some specific pentanomials have been proposed. For such kind of multipliers, alternatively, we use double basis multiplication which combines the polynomial basis and the modified polynomial...
Saved in:
Published in: | IEEE transactions on computers 2014-05, Vol.63 (5), p.1169-1181 |
---|---|
Main Authors: | , , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c982-7fd2d5d7cd995eb077179168ca6c16609976366f1831b5270eb64a5b331cba393 |
---|---|
cites | cdi_FETCH-LOGICAL-c982-7fd2d5d7cd995eb077179168ca6c16609976366f1831b5270eb64a5b331cba393 |
container_end_page | 1181 |
container_issue | 5 |
container_start_page | 1169 |
container_title | IEEE transactions on computers |
container_volume | 63 |
creator | Jeng-Shyang Pan Azarderakhsh, Reza Kermani, Mehran Mozaffari Chiou-Yng Lee Wen-Yo Lee Che Wun Chiou Jim-Min Lin |
description | Recently in cryptography and security, the multipliers with subquadratic space complexity for trinomials and some specific pentanomials have been proposed. For such kind of multipliers, alternatively, we use double basis multiplication which combines the polynomial basis and the modified polynomial basis to develop a new efficient digit-serial systolic multiplier. The proposed multiplier depends on trinomials and almost equally space pentanomials (AESPs), and utilizes the subquadratic Toeplitz matrix-vector product scheme to derive a low-latency digit-serial systolic architecture. If the selected digit-size is d bits, the proposed digit-serial multiplier for both polynomials, i.e., trinomials and AESPs, requires the latency of 2⌈√{ m /d⌉, while traditional ones take at least O(⌈ m /d⌉) clock cycles. Analytical and application-specific integrated circuit (ASIC) synthesis results indicate that both the area and the time × area complexities of our proposed architecture are significantly lower than the existing digit-serial systolic multipliers. |
doi_str_mv | 10.1109/TC.2012.239 |
format | article |
fullrecord | <record><control><sourceid>crossref_ieee_</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TC_2012_239</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6319292</ieee_id><sourcerecordid>10_1109_TC_2012_239</sourcerecordid><originalsourceid>FETCH-LOGICAL-c982-7fd2d5d7cd995eb077179168ca6c16609976366f1831b5270eb64a5b331cba393</originalsourceid><addsrcrecordid>eNo9kDtPwzAAhC0EEqUwMbJ4RcjFj8aJx5LSgpQKpAYmpMhxnGKU1sF2gDLyywkUsdwt3510B8ApwSNCsLjM0xHFhI4oE3tgQKIoRkJEfB8MMCYJEmyMD8GR9y8YY06xGICvzL6jTAa9UVs4NSsT0FI7Ixu43PpgG6Pg1HZlo-GV9MbDRdcE0zZGO2jfenlalwbOZ-fwwZvNCi678rWTlZOhD-ZW92T4hAsZnPlAj1oF6-C9s1WnApy0rbNSPR-Dg1o2Xp_8-RDks-s8vUHZ3fw2nWRIiYSiuK5oFVWxqvpFusRxTGJBeKIkV4RzLETMGec1SRgpIxpjXfKxjErGiColE2wILna1ylnvna6L1pm1dNuC4OLnvSJPi5_3CvpLn-1oo7X-JzkjggrKvgGqAGvC</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Low-Latency Digit-Serial Systolic Double Basis Multiplier over \mbi GF) Using Subquadratic Toeplitz Matrix-Vector Product Approach</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Jeng-Shyang Pan ; Azarderakhsh, Reza ; Kermani, Mehran Mozaffari ; Chiou-Yng Lee ; Wen-Yo Lee ; Che Wun Chiou ; Jim-Min Lin</creator><creatorcontrib>Jeng-Shyang Pan ; Azarderakhsh, Reza ; Kermani, Mehran Mozaffari ; Chiou-Yng Lee ; Wen-Yo Lee ; Che Wun Chiou ; Jim-Min Lin</creatorcontrib><description>Recently in cryptography and security, the multipliers with subquadratic space complexity for trinomials and some specific pentanomials have been proposed. For such kind of multipliers, alternatively, we use double basis multiplication which combines the polynomial basis and the modified polynomial basis to develop a new efficient digit-serial systolic multiplier. The proposed multiplier depends on trinomials and almost equally space pentanomials (AESPs), and utilizes the subquadratic Toeplitz matrix-vector product scheme to derive a low-latency digit-serial systolic architecture. If the selected digit-size is d bits, the proposed digit-serial multiplier for both polynomials, i.e., trinomials and AESPs, requires the latency of 2⌈√{ m /d⌉, while traditional ones take at least O(⌈ m /d⌉) clock cycles. Analytical and application-specific integrated circuit (ASIC) synthesis results indicate that both the area and the time × area complexities of our proposed architecture are significantly lower than the existing digit-serial systolic multipliers.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/TC.2012.239</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>IEEE</publisher><subject>Clocks ; Complexity theory ; Computer architecture ; digit-serial systolic multiplier ; double basis ; Educational institutions ; Electronic mail ; elliptic curve cryptography ; Polynomials ; Subquadratic Toeplitz matrix-vector product ; Vectors</subject><ispartof>IEEE transactions on computers, 2014-05, Vol.63 (5), p.1169-1181</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c982-7fd2d5d7cd995eb077179168ca6c16609976366f1831b5270eb64a5b331cba393</citedby><cites>FETCH-LOGICAL-c982-7fd2d5d7cd995eb077179168ca6c16609976366f1831b5270eb64a5b331cba393</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6319292$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27923,27924,54795</link.rule.ids></links><search><creatorcontrib>Jeng-Shyang Pan</creatorcontrib><creatorcontrib>Azarderakhsh, Reza</creatorcontrib><creatorcontrib>Kermani, Mehran Mozaffari</creatorcontrib><creatorcontrib>Chiou-Yng Lee</creatorcontrib><creatorcontrib>Wen-Yo Lee</creatorcontrib><creatorcontrib>Che Wun Chiou</creatorcontrib><creatorcontrib>Jim-Min Lin</creatorcontrib><title>Low-Latency Digit-Serial Systolic Double Basis Multiplier over \mbi GF) Using Subquadratic Toeplitz Matrix-Vector Product Approach</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>Recently in cryptography and security, the multipliers with subquadratic space complexity for trinomials and some specific pentanomials have been proposed. For such kind of multipliers, alternatively, we use double basis multiplication which combines the polynomial basis and the modified polynomial basis to develop a new efficient digit-serial systolic multiplier. The proposed multiplier depends on trinomials and almost equally space pentanomials (AESPs), and utilizes the subquadratic Toeplitz matrix-vector product scheme to derive a low-latency digit-serial systolic architecture. If the selected digit-size is d bits, the proposed digit-serial multiplier for both polynomials, i.e., trinomials and AESPs, requires the latency of 2⌈√{ m /d⌉, while traditional ones take at least O(⌈ m /d⌉) clock cycles. Analytical and application-specific integrated circuit (ASIC) synthesis results indicate that both the area and the time × area complexities of our proposed architecture are significantly lower than the existing digit-serial systolic multipliers.</description><subject>Clocks</subject><subject>Complexity theory</subject><subject>Computer architecture</subject><subject>digit-serial systolic multiplier</subject><subject>double basis</subject><subject>Educational institutions</subject><subject>Electronic mail</subject><subject>elliptic curve cryptography</subject><subject>Polynomials</subject><subject>Subquadratic Toeplitz matrix-vector product</subject><subject>Vectors</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNo9kDtPwzAAhC0EEqUwMbJ4RcjFj8aJx5LSgpQKpAYmpMhxnGKU1sF2gDLyywkUsdwt3510B8ApwSNCsLjM0xHFhI4oE3tgQKIoRkJEfB8MMCYJEmyMD8GR9y8YY06xGICvzL6jTAa9UVs4NSsT0FI7Ixu43PpgG6Pg1HZlo-GV9MbDRdcE0zZGO2jfenlalwbOZ-fwwZvNCi678rWTlZOhD-ZW92T4hAsZnPlAj1oF6-C9s1WnApy0rbNSPR-Dg1o2Xp_8-RDks-s8vUHZ3fw2nWRIiYSiuK5oFVWxqvpFusRxTGJBeKIkV4RzLETMGec1SRgpIxpjXfKxjErGiColE2wILna1ylnvna6L1pm1dNuC4OLnvSJPi5_3CvpLn-1oo7X-JzkjggrKvgGqAGvC</recordid><startdate>201405</startdate><enddate>201405</enddate><creator>Jeng-Shyang Pan</creator><creator>Azarderakhsh, Reza</creator><creator>Kermani, Mehran Mozaffari</creator><creator>Chiou-Yng Lee</creator><creator>Wen-Yo Lee</creator><creator>Che Wun Chiou</creator><creator>Jim-Min Lin</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>201405</creationdate><title>Low-Latency Digit-Serial Systolic Double Basis Multiplier over \mbi GF) Using Subquadratic Toeplitz Matrix-Vector Product Approach</title><author>Jeng-Shyang Pan ; Azarderakhsh, Reza ; Kermani, Mehran Mozaffari ; Chiou-Yng Lee ; Wen-Yo Lee ; Che Wun Chiou ; Jim-Min Lin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c982-7fd2d5d7cd995eb077179168ca6c16609976366f1831b5270eb64a5b331cba393</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Clocks</topic><topic>Complexity theory</topic><topic>Computer architecture</topic><topic>digit-serial systolic multiplier</topic><topic>double basis</topic><topic>Educational institutions</topic><topic>Electronic mail</topic><topic>elliptic curve cryptography</topic><topic>Polynomials</topic><topic>Subquadratic Toeplitz matrix-vector product</topic><topic>Vectors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jeng-Shyang Pan</creatorcontrib><creatorcontrib>Azarderakhsh, Reza</creatorcontrib><creatorcontrib>Kermani, Mehran Mozaffari</creatorcontrib><creatorcontrib>Chiou-Yng Lee</creatorcontrib><creatorcontrib>Wen-Yo Lee</creatorcontrib><creatorcontrib>Che Wun Chiou</creatorcontrib><creatorcontrib>Jim-Min Lin</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jeng-Shyang Pan</au><au>Azarderakhsh, Reza</au><au>Kermani, Mehran Mozaffari</au><au>Chiou-Yng Lee</au><au>Wen-Yo Lee</au><au>Che Wun Chiou</au><au>Jim-Min Lin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Low-Latency Digit-Serial Systolic Double Basis Multiplier over \mbi GF) Using Subquadratic Toeplitz Matrix-Vector Product Approach</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>2014-05</date><risdate>2014</risdate><volume>63</volume><issue>5</issue><spage>1169</spage><epage>1181</epage><pages>1169-1181</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>Recently in cryptography and security, the multipliers with subquadratic space complexity for trinomials and some specific pentanomials have been proposed. For such kind of multipliers, alternatively, we use double basis multiplication which combines the polynomial basis and the modified polynomial basis to develop a new efficient digit-serial systolic multiplier. The proposed multiplier depends on trinomials and almost equally space pentanomials (AESPs), and utilizes the subquadratic Toeplitz matrix-vector product scheme to derive a low-latency digit-serial systolic architecture. If the selected digit-size is d bits, the proposed digit-serial multiplier for both polynomials, i.e., trinomials and AESPs, requires the latency of 2⌈√{ m /d⌉, while traditional ones take at least O(⌈ m /d⌉) clock cycles. Analytical and application-specific integrated circuit (ASIC) synthesis results indicate that both the area and the time × area complexities of our proposed architecture are significantly lower than the existing digit-serial systolic multipliers.</abstract><pub>IEEE</pub><doi>10.1109/TC.2012.239</doi><tpages>13</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0018-9340 |
ispartof | IEEE transactions on computers, 2014-05, Vol.63 (5), p.1169-1181 |
issn | 0018-9340 1557-9956 |
language | eng |
recordid | cdi_crossref_primary_10_1109_TC_2012_239 |
source | IEEE Electronic Library (IEL) Journals |
subjects | Clocks Complexity theory Computer architecture digit-serial systolic multiplier double basis Educational institutions Electronic mail elliptic curve cryptography Polynomials Subquadratic Toeplitz matrix-vector product Vectors |
title | Low-Latency Digit-Serial Systolic Double Basis Multiplier over \mbi GF) Using Subquadratic Toeplitz Matrix-Vector Product Approach |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T11%3A59%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Low-Latency%20Digit-Serial%20Systolic%20Double%20Basis%20Multiplier%20over%20%5Cmbi%20GF)%20Using%20Subquadratic%20Toeplitz%20Matrix-Vector%20Product%20Approach&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Jeng-Shyang%20Pan&rft.date=2014-05&rft.volume=63&rft.issue=5&rft.spage=1169&rft.epage=1181&rft.pages=1169-1181&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/TC.2012.239&rft_dat=%3Ccrossref_ieee_%3E10_1109_TC_2012_239%3C/crossref_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c982-7fd2d5d7cd995eb077179168ca6c16609976366f1831b5270eb64a5b331cba393%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6319292&rfr_iscdi=true |