Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이향숙 | - |
dc.date.accessioned | 2016-08-28T12:08:31Z | - |
dc.date.available | 2016-08-28T12:08:31Z | - |
dc.date.issued | 2011 | - |
dc.identifier.issn | 0938-1279 | - |
dc.identifier.other | OAK-8164 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/222107 | - |
dc.description.abstract | Vercauteren introduced the concept of optimal pairing, which by definition can be computed by using at most (log 2 r)/φ(k) + log 2 k basic Miller iterations, where r is the order of the groups involved and k is the embedding degree Vercauteren (IEEE Trans Inf Theory 56(1):455-461, 2010). Freeman et al. summarized and proposed all of the new constructions of pairing-friendly elliptic curves that currently exist Freeman et al. (J Cryptol 23(2):224-280, 2010). In this paper, we give an optimal pairing for each family of pairing-friendly curves in Freeman et al. (J Cryptol 23(2):224-280, 2010) by taking the Ate or R-ate pairing approach. © 2011 Springer-Verlag. | - |
dc.language | English | - |
dc.title | Optimal pairing computation over families of pairing-friendly elliptic curves | - |
dc.type | Article | - |
dc.relation.issue | 4 | - |
dc.relation.volume | 22 | - |
dc.relation.index | SCIE | - |
dc.relation.index | SCOPUS | - |
dc.relation.startpage | 235 | - |
dc.relation.lastpage | 248 | - |
dc.relation.journaltitle | Applicable Algebra in Engineering, Communications and Computing | - |
dc.identifier.doi | 10.1007/s00200-011-0146-4 | - |
dc.identifier.wosid | WOS:000297221400001 | - |
dc.identifier.scopusid | 2-s2.0-81955168050 | - |
dc.author.google | Eom S.-K. | - |
dc.author.google | Lee H.-S. | - |
dc.author.google | Park C.-M. | - |
dc.contributor.scopusid | 이향숙(34870017000) | - |
dc.date.modifydate | 20230411110859 | - |