Loading…

High-Performance Noninvasive Side-Channel Attack Resistant ECC Coprocessor for GF(2m )

Elliptic curve cryptography (ECC) is one of the most popular public key cryptosystems in recent years due to its higher security strength and lower resource consumption. However, the noninvasive side-channel attacks (SCAs) have been proved to be a big threat to ECC systems in many previous researche...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on industrial electronics (1982) 2017-01, Vol.64 (1), p.727-738
Main Authors: Liao, Kai, Cui, Xiaoxin, Liao, Nan, Wang, Tian, Yu, Dunshan, Cui, Xiaole
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-c291t-7d6a8034e8081ce8e51ebb1ff6b241ff430d82341ec959468124b825882201d43
cites cdi_FETCH-LOGICAL-c291t-7d6a8034e8081ce8e51ebb1ff6b241ff430d82341ec959468124b825882201d43
container_end_page 738
container_issue 1
container_start_page 727
container_title IEEE transactions on industrial electronics (1982)
container_volume 64
creator Liao, Kai
Cui, Xiaoxin
Liao, Nan
Wang, Tian
Yu, Dunshan
Cui, Xiaole
description Elliptic curve cryptography (ECC) is one of the most popular public key cryptosystems in recent years due to its higher security strength and lower resource consumption. However, the noninvasive side-channel attacks (SCAs) have been proved to be a big threat to ECC systems in many previous researches. In this paper, we propose a low-area-time-product ECC coprocessor for GF(2 m ) with the ability to resist most of the existing noninvasive SCAs. The basic countermeasures are relied on the underlying finite field arithmetics in randomized Montgomery domain, which can blind the intermediate value in the iterations of scalar multiplication to prevent the adversaries from cracking the private key by statistical methods. Meanwhile, we optimize the modular division and modular multiplication algorithms to fix the operating time to resist some certain timing attacks, and the Montgomery Ladder algorithm makes the coprocessor immune against simple SCAs. To efficiently implement our coprocessor, we present a hybrid operation sequence which merely needs one multiplication module and one division module to complete the entire operations. The synthesis results indicate that our design is superior to other related works in area-time product (ATP) and the extra overhead paid for the countermeasures is less than 5%.
doi_str_mv 10.1109/TIE.2016.2610402
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_proquest_journals_1848269952</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7589008</ieee_id><sourcerecordid>1848269952</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-7d6a8034e8081ce8e51ebb1ff6b241ff430d82341ec959468124b825882201d43</originalsourceid><addsrcrecordid>eNo9kM1LwzAYxoMoOKd3wUvAix4636RJmxxH2RcMFZ1eQ9q-dZ1bO5Nu4H9vxoan5_J8vO-PkFsGA8ZAPy1mowEHlgx4wkAAPyM9JmUaaS3UOekBT1UEIJJLcuX9CoAJyWSPfE7rr2X0iq5q3cY2BdLntqmbvfX1Hul7XWKULW3T4JoOu84W3_QNfe0723R0lGU0a7euLdD71tFQQSfjB76hj9fkorJrjzcn7ZOP8WiRTaP5y2SWDedRwTXrorRMrIJYoALFClQoGeY5q6ok5yKIiKFUPBYMCy21SBTjIldcKsXDr6WI--T-2Buu-Nmh78yq3bkmTBqmhOKJ1pIHFxxdhWu9d1iZras31v0aBuZAzwR65kDPnOiFyN0xUiPivz2VSgOo-A87_Ghz</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1848269952</pqid></control><display><type>article</type><title>High-Performance Noninvasive Side-Channel Attack Resistant ECC Coprocessor for GF(2m )</title><source>IEEE Xplore (Online service)</source><creator>Liao, Kai ; Cui, Xiaoxin ; Liao, Nan ; Wang, Tian ; Yu, Dunshan ; Cui, Xiaole</creator><creatorcontrib>Liao, Kai ; Cui, Xiaoxin ; Liao, Nan ; Wang, Tian ; Yu, Dunshan ; Cui, Xiaole</creatorcontrib><description>Elliptic curve cryptography (ECC) is one of the most popular public key cryptosystems in recent years due to its higher security strength and lower resource consumption. However, the noninvasive side-channel attacks (SCAs) have been proved to be a big threat to ECC systems in many previous researches. In this paper, we propose a low-area-time-product ECC coprocessor for GF(2 m ) with the ability to resist most of the existing noninvasive SCAs. The basic countermeasures are relied on the underlying finite field arithmetics in randomized Montgomery domain, which can blind the intermediate value in the iterations of scalar multiplication to prevent the adversaries from cracking the private key by statistical methods. Meanwhile, we optimize the modular division and modular multiplication algorithms to fix the operating time to resist some certain timing attacks, and the Montgomery Ladder algorithm makes the coprocessor immune against simple SCAs. To efficiently implement our coprocessor, we present a hybrid operation sequence which merely needs one multiplication module and one division module to complete the entire operations. The synthesis results indicate that our design is superior to other related works in area-time product (ATP) and the extra overhead paid for the countermeasures is less than 5%.</description><identifier>ISSN: 0278-0046</identifier><identifier>EISSN: 1557-9948</identifier><identifier>DOI: 10.1109/TIE.2016.2610402</identifier><identifier>CODEN: ITIED6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithm design and analysis ; Binary finite field arithmetic ; Computer systems ; Coprocessors ; Cryptography ; Data encryption ; Dividing (mathematics) ; Elliptic curve cryptography ; elliptic curve cryptography (ECC) ; Galois fields ; hybrid operation sequence ; Multiplication ; Multiplication &amp; division ; noninvasive side-channel attack (SCA) ; randomized Montgomery operation ; Resists ; Side-channel attacks ; Statistical methods</subject><ispartof>IEEE transactions on industrial electronics (1982), 2017-01, Vol.64 (1), p.727-738</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-7d6a8034e8081ce8e51ebb1ff6b241ff430d82341ec959468124b825882201d43</citedby><cites>FETCH-LOGICAL-c291t-7d6a8034e8081ce8e51ebb1ff6b241ff430d82341ec959468124b825882201d43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7589008$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Liao, Kai</creatorcontrib><creatorcontrib>Cui, Xiaoxin</creatorcontrib><creatorcontrib>Liao, Nan</creatorcontrib><creatorcontrib>Wang, Tian</creatorcontrib><creatorcontrib>Yu, Dunshan</creatorcontrib><creatorcontrib>Cui, Xiaole</creatorcontrib><title>High-Performance Noninvasive Side-Channel Attack Resistant ECC Coprocessor for GF(2m )</title><title>IEEE transactions on industrial electronics (1982)</title><addtitle>TIE</addtitle><description>Elliptic curve cryptography (ECC) is one of the most popular public key cryptosystems in recent years due to its higher security strength and lower resource consumption. However, the noninvasive side-channel attacks (SCAs) have been proved to be a big threat to ECC systems in many previous researches. In this paper, we propose a low-area-time-product ECC coprocessor for GF(2 m ) with the ability to resist most of the existing noninvasive SCAs. The basic countermeasures are relied on the underlying finite field arithmetics in randomized Montgomery domain, which can blind the intermediate value in the iterations of scalar multiplication to prevent the adversaries from cracking the private key by statistical methods. Meanwhile, we optimize the modular division and modular multiplication algorithms to fix the operating time to resist some certain timing attacks, and the Montgomery Ladder algorithm makes the coprocessor immune against simple SCAs. To efficiently implement our coprocessor, we present a hybrid operation sequence which merely needs one multiplication module and one division module to complete the entire operations. The synthesis results indicate that our design is superior to other related works in area-time product (ATP) and the extra overhead paid for the countermeasures is less than 5%.</description><subject>Algorithm design and analysis</subject><subject>Binary finite field arithmetic</subject><subject>Computer systems</subject><subject>Coprocessors</subject><subject>Cryptography</subject><subject>Data encryption</subject><subject>Dividing (mathematics)</subject><subject>Elliptic curve cryptography</subject><subject>elliptic curve cryptography (ECC)</subject><subject>Galois fields</subject><subject>hybrid operation sequence</subject><subject>Multiplication</subject><subject>Multiplication &amp; division</subject><subject>noninvasive side-channel attack (SCA)</subject><subject>randomized Montgomery operation</subject><subject>Resists</subject><subject>Side-channel attacks</subject><subject>Statistical methods</subject><issn>0278-0046</issn><issn>1557-9948</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNo9kM1LwzAYxoMoOKd3wUvAix4636RJmxxH2RcMFZ1eQ9q-dZ1bO5Nu4H9vxoan5_J8vO-PkFsGA8ZAPy1mowEHlgx4wkAAPyM9JmUaaS3UOekBT1UEIJJLcuX9CoAJyWSPfE7rr2X0iq5q3cY2BdLntqmbvfX1Hul7XWKULW3T4JoOu84W3_QNfe0723R0lGU0a7euLdD71tFQQSfjB76hj9fkorJrjzcn7ZOP8WiRTaP5y2SWDedRwTXrorRMrIJYoALFClQoGeY5q6ok5yKIiKFUPBYMCy21SBTjIldcKsXDr6WI--T-2Buu-Nmh78yq3bkmTBqmhOKJ1pIHFxxdhWu9d1iZras31v0aBuZAzwR65kDPnOiFyN0xUiPivz2VSgOo-A87_Ghz</recordid><startdate>201701</startdate><enddate>201701</enddate><creator>Liao, Kai</creator><creator>Cui, Xiaoxin</creator><creator>Liao, Nan</creator><creator>Wang, Tian</creator><creator>Yu, Dunshan</creator><creator>Cui, Xiaole</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></search><sort><creationdate>201701</creationdate><title>High-Performance Noninvasive Side-Channel Attack Resistant ECC Coprocessor for GF(2m )</title><author>Liao, Kai ; Cui, Xiaoxin ; Liao, Nan ; Wang, Tian ; Yu, Dunshan ; Cui, Xiaole</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-7d6a8034e8081ce8e51ebb1ff6b241ff430d82341ec959468124b825882201d43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithm design and analysis</topic><topic>Binary finite field arithmetic</topic><topic>Computer systems</topic><topic>Coprocessors</topic><topic>Cryptography</topic><topic>Data encryption</topic><topic>Dividing (mathematics)</topic><topic>Elliptic curve cryptography</topic><topic>elliptic curve cryptography (ECC)</topic><topic>Galois fields</topic><topic>hybrid operation sequence</topic><topic>Multiplication</topic><topic>Multiplication &amp; division</topic><topic>noninvasive side-channel attack (SCA)</topic><topic>randomized Montgomery operation</topic><topic>Resists</topic><topic>Side-channel attacks</topic><topic>Statistical methods</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liao, Kai</creatorcontrib><creatorcontrib>Cui, Xiaoxin</creatorcontrib><creatorcontrib>Liao, Nan</creatorcontrib><creatorcontrib>Wang, Tian</creatorcontrib><creatorcontrib>Yu, Dunshan</creatorcontrib><creatorcontrib>Cui, Xiaole</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><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on industrial electronics (1982)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liao, Kai</au><au>Cui, Xiaoxin</au><au>Liao, Nan</au><au>Wang, Tian</au><au>Yu, Dunshan</au><au>Cui, Xiaole</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>High-Performance Noninvasive Side-Channel Attack Resistant ECC Coprocessor for GF(2m )</atitle><jtitle>IEEE transactions on industrial electronics (1982)</jtitle><stitle>TIE</stitle><date>2017-01</date><risdate>2017</risdate><volume>64</volume><issue>1</issue><spage>727</spage><epage>738</epage><pages>727-738</pages><issn>0278-0046</issn><eissn>1557-9948</eissn><coden>ITIED6</coden><abstract>Elliptic curve cryptography (ECC) is one of the most popular public key cryptosystems in recent years due to its higher security strength and lower resource consumption. However, the noninvasive side-channel attacks (SCAs) have been proved to be a big threat to ECC systems in many previous researches. In this paper, we propose a low-area-time-product ECC coprocessor for GF(2 m ) with the ability to resist most of the existing noninvasive SCAs. The basic countermeasures are relied on the underlying finite field arithmetics in randomized Montgomery domain, which can blind the intermediate value in the iterations of scalar multiplication to prevent the adversaries from cracking the private key by statistical methods. Meanwhile, we optimize the modular division and modular multiplication algorithms to fix the operating time to resist some certain timing attacks, and the Montgomery Ladder algorithm makes the coprocessor immune against simple SCAs. To efficiently implement our coprocessor, we present a hybrid operation sequence which merely needs one multiplication module and one division module to complete the entire operations. The synthesis results indicate that our design is superior to other related works in area-time product (ATP) and the extra overhead paid for the countermeasures is less than 5%.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIE.2016.2610402</doi><tpages>12</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0278-0046
ispartof IEEE transactions on industrial electronics (1982), 2017-01, Vol.64 (1), p.727-738
issn 0278-0046
1557-9948
language eng
recordid cdi_proquest_journals_1848269952
source IEEE Xplore (Online service)
subjects Algorithm design and analysis
Binary finite field arithmetic
Computer systems
Coprocessors
Cryptography
Data encryption
Dividing (mathematics)
Elliptic curve cryptography
elliptic curve cryptography (ECC)
Galois fields
hybrid operation sequence
Multiplication
Multiplication & division
noninvasive side-channel attack (SCA)
randomized Montgomery operation
Resists
Side-channel attacks
Statistical methods
title High-Performance Noninvasive Side-Channel Attack Resistant ECC Coprocessor for GF(2m )
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T19%3A56%3A21IST&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=High-Performance%20Noninvasive%20Side-Channel%20Attack%20Resistant%20ECC%20Coprocessor%20for%20GF(2m%20)&rft.jtitle=IEEE%20transactions%20on%20industrial%20electronics%20(1982)&rft.au=Liao,%20Kai&rft.date=2017-01&rft.volume=64&rft.issue=1&rft.spage=727&rft.epage=738&rft.pages=727-738&rft.issn=0278-0046&rft.eissn=1557-9948&rft.coden=ITIED6&rft_id=info:doi/10.1109/TIE.2016.2610402&rft_dat=%3Cproquest_ieee_%3E1848269952%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c291t-7d6a8034e8081ce8e51ebb1ff6b241ff430d82341ec959468124b825882201d43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1848269952&rft_id=info:pmid/&rft_ieee_id=7589008&rfr_iscdi=true