A New Method for Securing Elliptic Scalar Multiplication Against Side-Channel Attacks
This paper presents a new method for elliptic scalar multiplication with protection against side-channel attacks. We first point out some potential security flaws often overlooked in most previous algorithms and then present a simple ±1-signed encoding scheme that can be used to enhance the security...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 300 |
|---|---|
| container_issue | |
| container_start_page | 289 |
| container_title | |
| container_volume | 3108 |
| creator | Lim, Chae Hoon |
| description | This paper presents a new method for elliptic scalar multiplication with protection against side-channel attacks. We first point out some potential security flaws often overlooked in most previous algorithms and then present a simple ±1-signed encoding scheme that can be used to enhance the security and performance of existing algorithms. In particular, we propose and analyze concrete signed binary and window algorithms based on the proposed ±1-signed encoding. The security of window-family algorithms against a DPA-style attack is also discussed with some possible countermeasures. |
| doi_str_mv | 10.1007/978-3-540-27800-9_25 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_15993569</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3087596_31_299</sourcerecordid><originalsourceid>FETCH-LOGICAL-p272t-2c3397a90fe98e78bf2fe7ee726e604ea9638e50e6099d7d7c2ce9829b63c5053</originalsourceid><addsrcrecordid>eNotkE1v4yAQhtlPNe3mH_TApUe6wNjGc4yi9EPqxyHbMyJk3LD12i4QVfvvS9JyQbw8MzAPY-dKXiopzW80rQBRV1Jo00op0Or6CzuFkhwD9ZXNVKOUAKjwG5sX_ninwWD9nc0kSC3QVPCTzbAgJZX1CZun9FeWpQxKrGbsacEf6I3fU96NW96Nka_J72MYnvmq78OUg-dr73oX-f2-z2Hqg3c5jANfPLswpMzXYUtiuXPDQD1f5Oz8S_rFfnSuTzT_3M_Y09Xqz_JG3D1e3y4Xd2LSRmehPQAah7IjbMm0m053ZIiMbqiRFTlsoKValgPi1myN176QGjcN-DIOnLGLj76TS-WTXXSDD8lOMfxz8b9VNSLUDRZOf3BpOoxG0W7G8SVZJe1Bti3yLNiizx7d2oPsUgSfzeP4uqeULR2qPA05ut7v3JQpJguyNTU2FpTV5bl3vrt8Wg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3087596_31_299</pqid></control><display><type>book_chapter</type><title>A New Method for Securing Elliptic Scalar Multiplication Against Side-Channel Attacks</title><source>Springer Books</source><creator>Lim, Chae Hoon</creator><contributor>Wang, Huaxiong ; Varadharajan, Vijay ; Pieprzyk, Josef ; Pieprzyk, Josef ; Varadharajan, Vijay ; Wang, Huaxiong</contributor><creatorcontrib>Lim, Chae Hoon ; Wang, Huaxiong ; Varadharajan, Vijay ; Pieprzyk, Josef ; Pieprzyk, Josef ; Varadharajan, Vijay ; Wang, Huaxiong</creatorcontrib><description>This paper presents a new method for elliptic scalar multiplication with protection against side-channel attacks. We first point out some potential security flaws often overlooked in most previous algorithms and then present a simple ±1-signed encoding scheme that can be used to enhance the security and performance of existing algorithms. In particular, we propose and analyze concrete signed binary and window algorithms based on the proposed ±1-signed encoding. The security of window-family algorithms against a DPA-style attack is also discussed with some possible countermeasures.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540223795</identifier><identifier>ISBN: 3540223797</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540278001</identifier><identifier>EISBN: 9783540278009</identifier><identifier>DOI: 10.1007/978-3-540-27800-9_25</identifier><identifier>OCLC: 934979505</identifier><identifier>LCCallNum: QA268</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Binary Algorithm ; Computer science; control theory; systems ; Elliptic Curve ; Elliptic Curve Cryptosystems ; Exact sciences and technology ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Smart Card ; Software ; Window Algorithm</subject><ispartof>Information Security and Privacy, 2004, Vol.3108, p.289-300</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3087596-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-27800-9_25$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-27800-9_25$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15993569$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Wang, Huaxiong</contributor><contributor>Varadharajan, Vijay</contributor><contributor>Pieprzyk, Josef</contributor><contributor>Pieprzyk, Josef</contributor><contributor>Varadharajan, Vijay</contributor><contributor>Wang, Huaxiong</contributor><creatorcontrib>Lim, Chae Hoon</creatorcontrib><title>A New Method for Securing Elliptic Scalar Multiplication Against Side-Channel Attacks</title><title>Information Security and Privacy</title><description>This paper presents a new method for elliptic scalar multiplication with protection against side-channel attacks. We first point out some potential security flaws often overlooked in most previous algorithms and then present a simple ±1-signed encoding scheme that can be used to enhance the security and performance of existing algorithms. In particular, we propose and analyze concrete signed binary and window algorithms based on the proposed ±1-signed encoding. The security of window-family algorithms against a DPA-style attack is also discussed with some possible countermeasures.</description><subject>Applied sciences</subject><subject>Binary Algorithm</subject><subject>Computer science; control theory; systems</subject><subject>Elliptic Curve</subject><subject>Elliptic Curve Cryptosystems</subject><subject>Exact sciences and technology</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Smart Card</subject><subject>Software</subject><subject>Window Algorithm</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540223795</isbn><isbn>3540223797</isbn><isbn>3540278001</isbn><isbn>9783540278009</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2004</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkE1v4yAQhtlPNe3mH_TApUe6wNjGc4yi9EPqxyHbMyJk3LD12i4QVfvvS9JyQbw8MzAPY-dKXiopzW80rQBRV1Jo00op0Or6CzuFkhwD9ZXNVKOUAKjwG5sX_ninwWD9nc0kSC3QVPCTzbAgJZX1CZun9FeWpQxKrGbsacEf6I3fU96NW96Nka_J72MYnvmq78OUg-dr73oX-f2-z2Hqg3c5jANfPLswpMzXYUtiuXPDQD1f5Oz8S_rFfnSuTzT_3M_Y09Xqz_JG3D1e3y4Xd2LSRmehPQAah7IjbMm0m053ZIiMbqiRFTlsoKValgPi1myN176QGjcN-DIOnLGLj76TS-WTXXSDD8lOMfxz8b9VNSLUDRZOf3BpOoxG0W7G8SVZJe1Bti3yLNiizx7d2oPsUgSfzeP4uqeULR2qPA05ut7v3JQpJguyNTU2FpTV5bl3vrt8Wg</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Lim, Chae Hoon</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>A New Method for Securing Elliptic Scalar Multiplication Against Side-Channel Attacks</title><author>Lim, Chae Hoon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p272t-2c3397a90fe98e78bf2fe7ee726e604ea9638e50e6099d7d7c2ce9829b63c5053</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Binary Algorithm</topic><topic>Computer science; control theory; systems</topic><topic>Elliptic Curve</topic><topic>Elliptic Curve Cryptosystems</topic><topic>Exact sciences and technology</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Smart Card</topic><topic>Software</topic><topic>Window Algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lim, Chae Hoon</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lim, Chae Hoon</au><au>Wang, Huaxiong</au><au>Varadharajan, Vijay</au><au>Pieprzyk, Josef</au><au>Pieprzyk, Josef</au><au>Varadharajan, Vijay</au><au>Wang, Huaxiong</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>A New Method for Securing Elliptic Scalar Multiplication Against Side-Channel Attacks</atitle><btitle>Information Security and Privacy</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2004</date><risdate>2004</risdate><volume>3108</volume><spage>289</spage><epage>300</epage><pages>289-300</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540223795</isbn><isbn>3540223797</isbn><eisbn>3540278001</eisbn><eisbn>9783540278009</eisbn><abstract>This paper presents a new method for elliptic scalar multiplication with protection against side-channel attacks. We first point out some potential security flaws often overlooked in most previous algorithms and then present a simple ±1-signed encoding scheme that can be used to enhance the security and performance of existing algorithms. In particular, we propose and analyze concrete signed binary and window algorithms based on the proposed ±1-signed encoding. The security of window-family algorithms against a DPA-style attack is also discussed with some possible countermeasures.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-27800-9_25</doi><oclcid>934979505</oclcid><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Information Security and Privacy, 2004, Vol.3108, p.289-300 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_15993569 |
| source | Springer Books |
| subjects | Applied sciences Binary Algorithm Computer science control theory systems Elliptic Curve Elliptic Curve Cryptosystems Exact sciences and technology Memory and file management (including protection and security) Memory organisation. Data processing Smart Card Software Window Algorithm |
| title | A New Method for Securing Elliptic Scalar Multiplication Against Side-Channel Attacks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T20%3A27%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=A%20New%20Method%20for%20Securing%20Elliptic%20Scalar%20Multiplication%20Against%20Side-Channel%20Attacks&rft.btitle=Information%20Security%20and%20Privacy&rft.au=Lim,%20Chae%20Hoon&rft.date=2004&rft.volume=3108&rft.spage=289&rft.epage=300&rft.pages=289-300&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540223795&rft.isbn_list=3540223797&rft_id=info:doi/10.1007/978-3-540-27800-9_25&rft_dat=%3Cproquest_pasca%3EEBC3087596_31_299%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540278001&rft.eisbn_list=9783540278009&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3087596_31_299&rft_id=info:pmid/&rfr_iscdi=true |