A scalable dual mode arithmetic unit for public key cryptosystems

Elliptic curve cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the sizes of these systems is increasing as security requirements become more demanding due to cryptanalytic advances. At cur...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Crowe, F., Daly, A., Marnane, W.
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 573 Vol. 1
container_issue
container_start_page 568
container_title
container_volume 1
creator Crowe, F.
Daly, A.
Marnane, W.
description Elliptic curve cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the sizes of these systems is increasing as security requirements become more demanding due to cryptanalytic advances. At current security levels of 80 bits, the corresponding key sizes for ECC and RSA are J60 and 1,024 bits respectively. Although the ECC key size is attractive for embedded applications, the popularity of RSA means that it will remain in legacy applications for the foreseeable future. This paper proposes a dual mode arithmetic unit capable of supporting the underlying field operations performed by both the ECC and RSA public key schemes. A hardware optimized version of the Montgomery algorithm is employed to perform modular multiplication efficiently. The disparity in key sizes is addressed by combining the dual processors to operate in parallel for ECC or in a pipelined series for RSA.
doi_str_mv 10.1109/ITCC.2005.33
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1428523</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1428523</ieee_id><sourcerecordid>1428523</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-8dbdec44a0317d1bd5ba276e8e67d38578eb32d5af089e2dad1bd973ea8c15413</originalsourceid><addsrcrecordid>eNotj01LxDAURQMiqOPs3LnJH2hN8pomWZbix8DAbMb1kDSvGG1tSdJF_70VvZvLgcuBS8gDZyXnzDwdzm1bCsZkCXBF7piqjRTAJdyQfUqfbAuYytTsljQNTZ0drBuQ-sUOdJw8UhtD_hgxh44u3yHTfop0Xtyw8ReutIvrnKe0poxjuifXvR0S7v97R95fns_tW3E8vR7a5lgErmQutHceu6qyDLjy3HnprFA1aqyVBy2VRgfCS9szbVB4-7sxCtDqjsuKw448_nkDIl7mGEYb1wuvhN6-wQ9gdEfN</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A scalable dual mode arithmetic unit for public key cryptosystems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Crowe, F. ; Daly, A. ; Marnane, W.</creator><creatorcontrib>Crowe, F. ; Daly, A. ; Marnane, W.</creatorcontrib><description>Elliptic curve cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the sizes of these systems is increasing as security requirements become more demanding due to cryptanalytic advances. At current security levels of 80 bits, the corresponding key sizes for ECC and RSA are J60 and 1,024 bits respectively. Although the ECC key size is attractive for embedded applications, the popularity of RSA means that it will remain in legacy applications for the foreseeable future. This paper proposes a dual mode arithmetic unit capable of supporting the underlying field operations performed by both the ECC and RSA public key schemes. A hardware optimized version of the Montgomery algorithm is employed to perform modular multiplication efficiently. The disparity in key sizes is addressed by combining the dual processors to operate in parallel for ECC or in a pipelined series for RSA.</description><identifier>ISBN: 0769523153</identifier><identifier>ISBN: 9780769523156</identifier><identifier>DOI: 10.1109/ITCC.2005.33</identifier><language>eng</language><publisher>IEEE</publisher><subject>Arithmetic ; Elliptic curve cryptography ; Field programmable gate arrays ; Hardware ; Information security ; Logic devices ; National security ; Power system security ; Public key ; Public key cryptography</subject><ispartof>International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II, 2005, Vol.1, p.568-573 Vol. 1</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/1428523$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1428523$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Crowe, F.</creatorcontrib><creatorcontrib>Daly, A.</creatorcontrib><creatorcontrib>Marnane, W.</creatorcontrib><title>A scalable dual mode arithmetic unit for public key cryptosystems</title><title>International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II</title><addtitle>ITCC</addtitle><description>Elliptic curve cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the sizes of these systems is increasing as security requirements become more demanding due to cryptanalytic advances. At current security levels of 80 bits, the corresponding key sizes for ECC and RSA are J60 and 1,024 bits respectively. Although the ECC key size is attractive for embedded applications, the popularity of RSA means that it will remain in legacy applications for the foreseeable future. This paper proposes a dual mode arithmetic unit capable of supporting the underlying field operations performed by both the ECC and RSA public key schemes. A hardware optimized version of the Montgomery algorithm is employed to perform modular multiplication efficiently. The disparity in key sizes is addressed by combining the dual processors to operate in parallel for ECC or in a pipelined series for RSA.</description><subject>Arithmetic</subject><subject>Elliptic curve cryptography</subject><subject>Field programmable gate arrays</subject><subject>Hardware</subject><subject>Information security</subject><subject>Logic devices</subject><subject>National security</subject><subject>Power system security</subject><subject>Public key</subject><subject>Public key cryptography</subject><isbn>0769523153</isbn><isbn>9780769523156</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj01LxDAURQMiqOPs3LnJH2hN8pomWZbix8DAbMb1kDSvGG1tSdJF_70VvZvLgcuBS8gDZyXnzDwdzm1bCsZkCXBF7piqjRTAJdyQfUqfbAuYytTsljQNTZ0drBuQ-sUOdJw8UhtD_hgxh44u3yHTfop0Xtyw8ReutIvrnKe0poxjuifXvR0S7v97R95fns_tW3E8vR7a5lgErmQutHceu6qyDLjy3HnprFA1aqyVBy2VRgfCS9szbVB4-7sxCtDqjsuKw448_nkDIl7mGEYb1wuvhN6-wQ9gdEfN</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Crowe, F.</creator><creator>Daly, A.</creator><creator>Marnane, W.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>A scalable dual mode arithmetic unit for public key cryptosystems</title><author>Crowe, F. ; Daly, A. ; Marnane, W.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-8dbdec44a0317d1bd5ba276e8e67d38578eb32d5af089e2dad1bd973ea8c15413</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Arithmetic</topic><topic>Elliptic curve cryptography</topic><topic>Field programmable gate arrays</topic><topic>Hardware</topic><topic>Information security</topic><topic>Logic devices</topic><topic>National security</topic><topic>Power system security</topic><topic>Public key</topic><topic>Public key cryptography</topic><toplevel>online_resources</toplevel><creatorcontrib>Crowe, F.</creatorcontrib><creatorcontrib>Daly, A.</creatorcontrib><creatorcontrib>Marnane, W.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Crowe, F.</au><au>Daly, A.</au><au>Marnane, W.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A scalable dual mode arithmetic unit for public key cryptosystems</atitle><btitle>International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II</btitle><stitle>ITCC</stitle><date>2005</date><risdate>2005</risdate><volume>1</volume><spage>568</spage><epage>573 Vol. 1</epage><pages>568-573 Vol. 1</pages><isbn>0769523153</isbn><isbn>9780769523156</isbn><abstract>Elliptic curve cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the sizes of these systems is increasing as security requirements become more demanding due to cryptanalytic advances. At current security levels of 80 bits, the corresponding key sizes for ECC and RSA are J60 and 1,024 bits respectively. Although the ECC key size is attractive for embedded applications, the popularity of RSA means that it will remain in legacy applications for the foreseeable future. This paper proposes a dual mode arithmetic unit capable of supporting the underlying field operations performed by both the ECC and RSA public key schemes. A hardware optimized version of the Montgomery algorithm is employed to perform modular multiplication efficiently. The disparity in key sizes is addressed by combining the dual processors to operate in parallel for ECC or in a pipelined series for RSA.</abstract><pub>IEEE</pub><doi>10.1109/ITCC.2005.33</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769523153
ispartof International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II, 2005, Vol.1, p.568-573 Vol. 1
issn
language eng
recordid cdi_ieee_primary_1428523
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Arithmetic
Elliptic curve cryptography
Field programmable gate arrays
Hardware
Information security
Logic devices
National security
Power system security
Public key
Public key cryptography
title A scalable dual mode arithmetic unit for public key cryptosystems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T09%3A57%3A28IST&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%20scalable%20dual%20mode%20arithmetic%20unit%20for%20public%20key%20cryptosystems&rft.btitle=International%20Conference%20on%20Information%20Technology:%20Coding%20and%20Computing%20(ITCC'05)%20-%20Volume%20II&rft.au=Crowe,%20F.&rft.date=2005&rft.volume=1&rft.spage=568&rft.epage=573%20Vol.%201&rft.pages=568-573%20Vol.%201&rft.isbn=0769523153&rft.isbn_list=9780769523156&rft_id=info:doi/10.1109/ITCC.2005.33&rft_dat=%3Cieee_6IE%3E1428523%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1428523&rfr_iscdi=true