Tunable Balancing of RSA
We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanced according to the application requirements. Our method is a generalisation of using small public exponents and small C...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 292 |
|---|---|
| container_issue | |
| container_start_page | 280 |
| container_title | |
| container_volume | |
| creator | Galbraith, Steven D. Heneghan, Chris McKee, James F. |
| description | We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanced according to the application requirements. Our method is a generalisation of using small public exponents and small Chinese remainder (CRT) private exponents. Our results are most relevant in the case where the cost of private operations must be optimised. We give methods for which the cost of private operations is the same as the previous fastest methods, but where the public operations are significantly faster. The paper gives an analysis of the security of keys generated by our method, and a new birthday attack on low Hamming-weight private exponents. |
| doi_str_mv | 10.1007/11506157_24 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17011456</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17011456</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-b1fd47908d943b587284fd43e31d8d03affa8664e4b838503ad427595211a63e3</originalsourceid><addsrcrecordid>eNpNkDtPw0AQhI-XhAmpaCjTUFAYdm_3XmUS8ZIiIUGoT-fYFwWMbfmg4N_jyBRMs9LMp9VohLhAuEEAc4uoQKMyXvKBOCPFQKgt46HIUCPmROyOxkBqxYaORQYEMneG6VRMU3qHQYRWWsjE5fq7CUVdzRahDs1m12xnbZy9vM7PxUkMdaqmf3ci3u7v1svHfPX88LScr_JOovvKC4wlGwe2dEyFskZaHhyqCEtbAoUYg9WaKy4sWTUYJUujnJKIQQ_YRFyNf7uQNqGO_b5F8l2_-wz9j0cDiKz0wF2PXBqiZlv1vmjbj-QR_H4X_28X-gWow0vp</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Tunable Balancing of RSA</title><source>Springer Books</source><creator>Galbraith, Steven D. ; Heneghan, Chris ; McKee, James F.</creator><contributor>Boyd, Colin ; González Nieto, Juan Manuel</contributor><creatorcontrib>Galbraith, Steven D. ; Heneghan, Chris ; McKee, James F. ; Boyd, Colin ; González Nieto, Juan Manuel</creatorcontrib><description>We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanced according to the application requirements. Our method is a generalisation of using small public exponents and small Chinese remainder (CRT) private exponents. Our results are most relevant in the case where the cost of private operations must be optimised. We give methods for which the cost of private operations is the same as the previous fastest methods, but where the public operations are significantly faster. The paper gives an analysis of the security of keys generated by our method, and a new birthday attack on low Hamming-weight private exponents.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540265473</identifier><identifier>ISBN: 9783540265474</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540316841</identifier><identifier>EISBN: 9783540316848</identifier><identifier>DOI: 10.1007/11506157_24</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Chinese Remainder Theorem ; Computer science; control theory; systems ; Decryption Time ; Exact sciences and technology ; Linearisation Attack ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Public Exponent ; Software ; Springer LNCS</subject><ispartof>Information Security and Privacy, 2005, p.280-292</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11506157_24$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11506157_24$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4048,4049,27924,38254,41441,42510</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17011456$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Boyd, Colin</contributor><contributor>González Nieto, Juan Manuel</contributor><creatorcontrib>Galbraith, Steven D.</creatorcontrib><creatorcontrib>Heneghan, Chris</creatorcontrib><creatorcontrib>McKee, James F.</creatorcontrib><title>Tunable Balancing of RSA</title><title>Information Security and Privacy</title><description>We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanced according to the application requirements. Our method is a generalisation of using small public exponents and small Chinese remainder (CRT) private exponents. Our results are most relevant in the case where the cost of private operations must be optimised. We give methods for which the cost of private operations is the same as the previous fastest methods, but where the public operations are significantly faster. The paper gives an analysis of the security of keys generated by our method, and a new birthday attack on low Hamming-weight private exponents.</description><subject>Applied sciences</subject><subject>Chinese Remainder Theorem</subject><subject>Computer science; control theory; systems</subject><subject>Decryption Time</subject><subject>Exact sciences and technology</subject><subject>Linearisation Attack</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Public Exponent</subject><subject>Software</subject><subject>Springer LNCS</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540265473</isbn><isbn>9783540265474</isbn><isbn>3540316841</isbn><isbn>9783540316848</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkDtPw0AQhI-XhAmpaCjTUFAYdm_3XmUS8ZIiIUGoT-fYFwWMbfmg4N_jyBRMs9LMp9VohLhAuEEAc4uoQKMyXvKBOCPFQKgt46HIUCPmROyOxkBqxYaORQYEMneG6VRMU3qHQYRWWsjE5fq7CUVdzRahDs1m12xnbZy9vM7PxUkMdaqmf3ci3u7v1svHfPX88LScr_JOovvKC4wlGwe2dEyFskZaHhyqCEtbAoUYg9WaKy4sWTUYJUujnJKIQQ_YRFyNf7uQNqGO_b5F8l2_-wz9j0cDiKz0wF2PXBqiZlv1vmjbj-QR_H4X_28X-gWow0vp</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Galbraith, Steven D.</creator><creator>Heneghan, Chris</creator><creator>McKee, James F.</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Tunable Balancing of RSA</title><author>Galbraith, Steven D. ; Heneghan, Chris ; McKee, James F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-b1fd47908d943b587284fd43e31d8d03affa8664e4b838503ad427595211a63e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Chinese Remainder Theorem</topic><topic>Computer science; control theory; systems</topic><topic>Decryption Time</topic><topic>Exact sciences and technology</topic><topic>Linearisation Attack</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Public Exponent</topic><topic>Software</topic><topic>Springer LNCS</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Galbraith, Steven D.</creatorcontrib><creatorcontrib>Heneghan, Chris</creatorcontrib><creatorcontrib>McKee, James F.</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Galbraith, Steven D.</au><au>Heneghan, Chris</au><au>McKee, James F.</au><au>Boyd, Colin</au><au>González Nieto, Juan Manuel</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Tunable Balancing of RSA</atitle><btitle>Information Security and Privacy</btitle><date>2005</date><risdate>2005</risdate><spage>280</spage><epage>292</epage><pages>280-292</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540265473</isbn><isbn>9783540265474</isbn><eisbn>3540316841</eisbn><eisbn>9783540316848</eisbn><abstract>We propose a key generation method for RSA moduli which allows the cost of the public operations (encryption/verifying) and the private operations (decryption/signing) to be balanced according to the application requirements. Our method is a generalisation of using small public exponents and small Chinese remainder (CRT) private exponents. Our results are most relevant in the case where the cost of private operations must be optimised. We give methods for which the cost of private operations is the same as the previous fastest methods, but where the public operations are significantly faster. The paper gives an analysis of the security of keys generated by our method, and a new birthday attack on low Hamming-weight private exponents.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11506157_24</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Information Security and Privacy, 2005, p.280-292 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17011456 |
| source | Springer Books |
| subjects | Applied sciences Chinese Remainder Theorem Computer science control theory systems Decryption Time Exact sciences and technology Linearisation Attack Memory and file management (including protection and security) Memory organisation. Data processing Public Exponent Software Springer LNCS |
| title | Tunable Balancing of RSA |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T05%3A40%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Tunable%20Balancing%20of%20RSA&rft.btitle=Information%20Security%20and%20Privacy&rft.au=Galbraith,%20Steven%20D.&rft.date=2005&rft.spage=280&rft.epage=292&rft.pages=280-292&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540265473&rft.isbn_list=9783540265474&rft_id=info:doi/10.1007/11506157_24&rft_dat=%3Cpascalfrancis_sprin%3E17011456%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540316841&rft.eisbn_list=9783540316848&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |