DC Field | Value | Language |
---|---|---|
dc.contributor.author | Roh, Dongyoung | ko |
dc.contributor.author | Kim, I Yeol | ko |
dc.contributor.author | Hahn, Sang Geun | ko |
dc.date.accessioned | 2018-02-21T05:34:14Z | - |
dc.date.available | 2018-02-21T05:34:14Z | - |
dc.date.created | 2018-01-29 | - |
dc.date.created | 2018-01-29 | - |
dc.date.created | 2018-01-29 | - |
dc.date.issued | 2018-01 | - |
dc.identifier.citation | APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, v.29, no.1, pp.41 - 57 | - |
dc.identifier.issn | 0938-1279 | - |
dc.identifier.uri | http://hdl.handle.net/10203/240094 | - |
dc.description.abstract | There are many variants of the computational Diffie-Hellman problem that are necessary to provide security of many cryptographic schemes. Two of them are the square Diffie-Hellman problem and the square root Diffie-Hellman problem. Recently, the first and third authors proved that these two problems are polynomial-time equivalent under a certain condition (Roh and Hahn in Des Codes Cryptogr 62(2): 179-187, 2011). In this paper, we generalize this result. We introduce the l-th power Diffie-Hellman problem and the l-th root Diffie-Hellman problem and show that these two problems are polynomial-time equivalent for l = O(log p) under a condition similar to that of Roh and Hahn (2011), where p is the order of the underlying group. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.subject | SIGNATURE SCHEMES | - |
dc.title | The l-th power Diffie-Hellman problem and the l-th root Diffie-Hellman problem | - |
dc.type | Article | - |
dc.identifier.wosid | 000419962700003 | - |
dc.identifier.scopusid | 2-s2.0-85019913061 | - |
dc.type.rims | ART | - |
dc.citation.volume | 29 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 41 | - |
dc.citation.endingpage | 57 | - |
dc.citation.publicationname | APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | - |
dc.identifier.doi | 10.1007/s00200-017-0321-3 | - |
dc.contributor.localauthor | Hahn, Sang Geun | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Discrete logarithm problem | - |
dc.subject.keywordAuthor | Computational Diffie-Hellman problem | - |
dc.subject.keywordAuthor | Square Diffie-Hellman problem | - |
dc.subject.keywordAuthor | Square root Diffie-Hellman problem | - |
dc.subject.keywordAuthor | l-th power Diffie-Hellman problem | - |
dc.subject.keywordAuthor | l-th root Diffie-Hellman problem | - |
dc.subject.keywordPlus | SIGNATURE SCHEMES | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.