Loading…

Dual-Basis Superserial Multipliers for Secure Applications and Lightweight Cryptographic Architectures

Cryptographic algorithms utilize finite-field arithmetic operations in their computations. Due to the constraints of the nodes which benefit from the security and privacy advantages of these algorithms in sensitive applications, these algorithms need to be lightweight. One of the well-known bases us...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2014-02, Vol.61 (2), p.125-129
Main Authors: Bayat-Sarmadi, Siavash, Kermani, Mehran Mozaffari, Azarderakhsh, Reza, Chiou-Yng Lee
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-c394t-e9193dab824e198227c1bbeb7e13a50d7b1ef7ac3bd492c1581fb7b4987c22103
cites cdi_FETCH-LOGICAL-c394t-e9193dab824e198227c1bbeb7e13a50d7b1ef7ac3bd492c1581fb7b4987c22103
container_end_page 129
container_issue 2
container_start_page 125
container_title IEEE transactions on circuits and systems. II, Express briefs
container_volume 61
creator Bayat-Sarmadi, Siavash
Kermani, Mehran Mozaffari
Azarderakhsh, Reza
Chiou-Yng Lee
description Cryptographic algorithms utilize finite-field arithmetic operations in their computations. Due to the constraints of the nodes which benefit from the security and privacy advantages of these algorithms in sensitive applications, these algorithms need to be lightweight. One of the well-known bases used in sensitive computations is dual basis (DB). In this brief, we present low-complexity superserial architectures for the DB multiplication over GF(2 m ). To the best of our knowledge, this is the first time that such a multiplier is proposed in the open literature. We have performed complexity analysis for the proposed lightweight architectures, and the results show that the hardware complexity of the proposed superserial multiplier is reduced compared with that of regular serial multipliers. This has been also confirmed through our application-specific integrated circuit hardware- and time-equivalent estimations. The proposed superserial architecture is a step forward toward efficient and lightweight cryptographic algorithms and is suitable for constrained implementations of cryptographic primitives in applications such as smart cards, handheld devices, life-critical wearable and implantable medical devices, and constrained nodes in the blooming notion of Internet of nano-Things.
doi_str_mv 10.1109/TCSII.2013.2291075
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_6684293</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6684293</ieee_id><sourcerecordid>3229434331</sourcerecordid><originalsourceid>FETCH-LOGICAL-c394t-e9193dab824e198227c1bbeb7e13a50d7b1ef7ac3bd492c1581fb7b4987c22103</originalsourceid><addsrcrecordid>eNpdkE1PwzAMhisEEmPwB-ASiQuXjjhJm-Y4ytekIQ4b5yrN3C1T15akFdq_J2OIAxfbsp7Xsp4ougY6AaDqfpkvZrMJo8AnjCmgMjmJRpAkWcylgtPDLFQspZDn0YX3W0qZopyNoupx0HX8oL31ZDF06Dw6q2vyNtS97WobFqRqHVmgGRySaRd2Rve2bTzRzYrM7XrTf-Ghktztu75dO91trCFTZza2R9OHnL-Mzipde7z67ePo4_lpmb_G8_eXWT6dx4Yr0ceoQPGVLjMmEFTGmDRQllhKBK4TupIlYCW14eVKKGYgyaAqZSlUJg1jQPk4ujve7Vz7OaDvi531ButaN9gOvggaQKSQggjo7T902w6uCd8FikJGMynSQLEjZVzrvcOq6JzdabcvgBYH9cWP-uKgvvhVH0I3x5BFxL9AmmaCKc6_AVC2gQw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1501808746</pqid></control><display><type>article</type><title>Dual-Basis Superserial Multipliers for Secure Applications and Lightweight Cryptographic Architectures</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Bayat-Sarmadi, Siavash ; Kermani, Mehran Mozaffari ; Azarderakhsh, Reza ; Chiou-Yng Lee</creator><creatorcontrib>Bayat-Sarmadi, Siavash ; Kermani, Mehran Mozaffari ; Azarderakhsh, Reza ; Chiou-Yng Lee</creatorcontrib><description>Cryptographic algorithms utilize finite-field arithmetic operations in their computations. Due to the constraints of the nodes which benefit from the security and privacy advantages of these algorithms in sensitive applications, these algorithms need to be lightweight. One of the well-known bases used in sensitive computations is dual basis (DB). In this brief, we present low-complexity superserial architectures for the DB multiplication over GF(2 m ). To the best of our knowledge, this is the first time that such a multiplier is proposed in the open literature. We have performed complexity analysis for the proposed lightweight architectures, and the results show that the hardware complexity of the proposed superserial multiplier is reduced compared with that of regular serial multipliers. This has been also confirmed through our application-specific integrated circuit hardware- and time-equivalent estimations. The proposed superserial architecture is a step forward toward efficient and lightweight cryptographic algorithms and is suitable for constrained implementations of cryptographic primitives in applications such as smart cards, handheld devices, life-critical wearable and implantable medical devices, and constrained nodes in the blooming notion of Internet of nano-Things.</description><identifier>ISSN: 1549-7747</identifier><identifier>EISSN: 1558-3791</identifier><identifier>DOI: 10.1109/TCSII.2013.2291075</identifier><identifier>CODEN: ICSPE5</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Architecture ; Complexity theory ; Computer architecture ; Crypto-systems ; Cryptography ; finite-field multiplication ; Hardware ; Lightweight ; lightweight cryptographic algorithms ; Medical devices ; Medical equipment ; Multipliers ; Noise levels ; Polynomials ; Registers ; security ; superserial ; Very large scale integration ; Weight reduction</subject><ispartof>IEEE transactions on circuits and systems. II, Express briefs, 2014-02, Vol.61 (2), p.125-129</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Feb 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c394t-e9193dab824e198227c1bbeb7e13a50d7b1ef7ac3bd492c1581fb7b4987c22103</citedby><cites>FETCH-LOGICAL-c394t-e9193dab824e198227c1bbeb7e13a50d7b1ef7ac3bd492c1581fb7b4987c22103</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6684293$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27903,27904,54774</link.rule.ids></links><search><creatorcontrib>Bayat-Sarmadi, Siavash</creatorcontrib><creatorcontrib>Kermani, Mehran Mozaffari</creatorcontrib><creatorcontrib>Azarderakhsh, Reza</creatorcontrib><creatorcontrib>Chiou-Yng Lee</creatorcontrib><title>Dual-Basis Superserial Multipliers for Secure Applications and Lightweight Cryptographic Architectures</title><title>IEEE transactions on circuits and systems. II, Express briefs</title><addtitle>TCSII</addtitle><description>Cryptographic algorithms utilize finite-field arithmetic operations in their computations. Due to the constraints of the nodes which benefit from the security and privacy advantages of these algorithms in sensitive applications, these algorithms need to be lightweight. One of the well-known bases used in sensitive computations is dual basis (DB). In this brief, we present low-complexity superserial architectures for the DB multiplication over GF(2 m ). To the best of our knowledge, this is the first time that such a multiplier is proposed in the open literature. We have performed complexity analysis for the proposed lightweight architectures, and the results show that the hardware complexity of the proposed superserial multiplier is reduced compared with that of regular serial multipliers. This has been also confirmed through our application-specific integrated circuit hardware- and time-equivalent estimations. The proposed superserial architecture is a step forward toward efficient and lightweight cryptographic algorithms and is suitable for constrained implementations of cryptographic primitives in applications such as smart cards, handheld devices, life-critical wearable and implantable medical devices, and constrained nodes in the blooming notion of Internet of nano-Things.</description><subject>Algorithms</subject><subject>Architecture</subject><subject>Complexity theory</subject><subject>Computer architecture</subject><subject>Crypto-systems</subject><subject>Cryptography</subject><subject>finite-field multiplication</subject><subject>Hardware</subject><subject>Lightweight</subject><subject>lightweight cryptographic algorithms</subject><subject>Medical devices</subject><subject>Medical equipment</subject><subject>Multipliers</subject><subject>Noise levels</subject><subject>Polynomials</subject><subject>Registers</subject><subject>security</subject><subject>superserial</subject><subject>Very large scale integration</subject><subject>Weight reduction</subject><issn>1549-7747</issn><issn>1558-3791</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNpdkE1PwzAMhisEEmPwB-ASiQuXjjhJm-Y4ytekIQ4b5yrN3C1T15akFdq_J2OIAxfbsp7Xsp4ougY6AaDqfpkvZrMJo8AnjCmgMjmJRpAkWcylgtPDLFQspZDn0YX3W0qZopyNoupx0HX8oL31ZDF06Dw6q2vyNtS97WobFqRqHVmgGRySaRd2Rve2bTzRzYrM7XrTf-Ghktztu75dO91trCFTZza2R9OHnL-Mzipde7z67ePo4_lpmb_G8_eXWT6dx4Yr0ceoQPGVLjMmEFTGmDRQllhKBK4TupIlYCW14eVKKGYgyaAqZSlUJg1jQPk4ujve7Vz7OaDvi531ButaN9gOvggaQKSQggjo7T902w6uCd8FikJGMynSQLEjZVzrvcOq6JzdabcvgBYH9cWP-uKgvvhVH0I3x5BFxL9AmmaCKc6_AVC2gQw</recordid><startdate>20140201</startdate><enddate>20140201</enddate><creator>Bayat-Sarmadi, Siavash</creator><creator>Kermani, Mehran Mozaffari</creator><creator>Azarderakhsh, Reza</creator><creator>Chiou-Yng Lee</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><scope>7SC</scope><scope>F28</scope><scope>FR3</scope><scope>JQ2</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140201</creationdate><title>Dual-Basis Superserial Multipliers for Secure Applications and Lightweight Cryptographic Architectures</title><author>Bayat-Sarmadi, Siavash ; Kermani, Mehran Mozaffari ; Azarderakhsh, Reza ; Chiou-Yng Lee</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c394t-e9193dab824e198227c1bbeb7e13a50d7b1ef7ac3bd492c1581fb7b4987c22103</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Architecture</topic><topic>Complexity theory</topic><topic>Computer architecture</topic><topic>Crypto-systems</topic><topic>Cryptography</topic><topic>finite-field multiplication</topic><topic>Hardware</topic><topic>Lightweight</topic><topic>lightweight cryptographic algorithms</topic><topic>Medical devices</topic><topic>Medical equipment</topic><topic>Multipliers</topic><topic>Noise levels</topic><topic>Polynomials</topic><topic>Registers</topic><topic>security</topic><topic>superserial</topic><topic>Very large scale integration</topic><topic>Weight reduction</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bayat-Sarmadi, Siavash</creatorcontrib><creatorcontrib>Kermani, Mehran Mozaffari</creatorcontrib><creatorcontrib>Azarderakhsh, Reza</creatorcontrib><creatorcontrib>Chiou-Yng Lee</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on circuits and systems. II, Express briefs</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bayat-Sarmadi, Siavash</au><au>Kermani, Mehran Mozaffari</au><au>Azarderakhsh, Reza</au><au>Chiou-Yng Lee</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dual-Basis Superserial Multipliers for Secure Applications and Lightweight Cryptographic Architectures</atitle><jtitle>IEEE transactions on circuits and systems. II, Express briefs</jtitle><stitle>TCSII</stitle><date>2014-02-01</date><risdate>2014</risdate><volume>61</volume><issue>2</issue><spage>125</spage><epage>129</epage><pages>125-129</pages><issn>1549-7747</issn><eissn>1558-3791</eissn><coden>ICSPE5</coden><abstract>Cryptographic algorithms utilize finite-field arithmetic operations in their computations. Due to the constraints of the nodes which benefit from the security and privacy advantages of these algorithms in sensitive applications, these algorithms need to be lightweight. One of the well-known bases used in sensitive computations is dual basis (DB). In this brief, we present low-complexity superserial architectures for the DB multiplication over GF(2 m ). To the best of our knowledge, this is the first time that such a multiplier is proposed in the open literature. We have performed complexity analysis for the proposed lightweight architectures, and the results show that the hardware complexity of the proposed superserial multiplier is reduced compared with that of regular serial multipliers. This has been also confirmed through our application-specific integrated circuit hardware- and time-equivalent estimations. The proposed superserial architecture is a step forward toward efficient and lightweight cryptographic algorithms and is suitable for constrained implementations of cryptographic primitives in applications such as smart cards, handheld devices, life-critical wearable and implantable medical devices, and constrained nodes in the blooming notion of Internet of nano-Things.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCSII.2013.2291075</doi><tpages>5</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1549-7747
ispartof IEEE transactions on circuits and systems. II, Express briefs, 2014-02, Vol.61 (2), p.125-129
issn 1549-7747
1558-3791
language eng
recordid cdi_ieee_primary_6684293
source IEEE Electronic Library (IEL) Journals
subjects Algorithms
Architecture
Complexity theory
Computer architecture
Crypto-systems
Cryptography
finite-field multiplication
Hardware
Lightweight
lightweight cryptographic algorithms
Medical devices
Medical equipment
Multipliers
Noise levels
Polynomials
Registers
security
superserial
Very large scale integration
Weight reduction
title Dual-Basis Superserial Multipliers for Secure Applications and Lightweight Cryptographic Architectures
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T05%3A12%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dual-Basis%20Superserial%20Multipliers%20for%20Secure%20Applications%20and%20Lightweight%20Cryptographic%20Architectures&rft.jtitle=IEEE%20transactions%20on%20circuits%20and%20systems.%20II,%20Express%20briefs&rft.au=Bayat-Sarmadi,%20Siavash&rft.date=2014-02-01&rft.volume=61&rft.issue=2&rft.spage=125&rft.epage=129&rft.pages=125-129&rft.issn=1549-7747&rft.eissn=1558-3791&rft.coden=ICSPE5&rft_id=info:doi/10.1109/TCSII.2013.2291075&rft_dat=%3Cproquest_ieee_%3E3229434331%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c394t-e9193dab824e198227c1bbeb7e13a50d7b1ef7ac3bd492c1581fb7b4987c22103%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1501808746&rft_id=info:pmid/&rft_ieee_id=6684293&rfr_iscdi=true