Institutional Repository
| Fast symmetric pairing revisited | |
| Zhang, Xusheng (1); Wang, Kunpeng (2) | |
| 2014 | |
| Conference Name | 6th International Conference on Pairing-Based Cryptography, Pairing 2013 |
| Pages | 131-148 |
| Conference Date | November 22, 2013 - November 24, 2013 |
| Conference Place | Beijing, China |
| Indexed Type | EI |
| Publish Place | Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany |
| ISSN | 3029743 |
| Department | (1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China |
| English Abstract | During the past decade pairing-based cryptosystems have been through a huge development, and the implementation of bilinear pairings has been improved greatly. Two pairing models, namely symmetric and asymmetric pairings, are widely used and have common cryptographic properties in most cryptosystems. Symmetric pairings are more convenient to construct cryptographic schemes, but asymmetric pairings are more efficient and suitable for implementation due to their flexible embedding degrees. In this paper we revisit symmetric pairings on supersingular elliptic curves over large characteristic fields. We show that a special family of supersingular elliptic curves with embedding degree 3 admits a kind of fast symmetric pairings, whose computational costs might be twice the costs for the current fastest asymmetric pairings. © 2014 Springer International Publishing.; During the past decade pairing-based cryptosystems have been through a huge development, and the implementation of bilinear pairings has been improved greatly. Two pairing models, namely symmetric and asymmetric pairings, are widely used and have common cryptographic properties in most cryptosystems. Symmetric pairings are more convenient to construct cryptographic schemes, but asymmetric pairings are more efficient and suitable for implementation due to their flexible embedding degrees. In this paper we revisit symmetric pairings on supersingular elliptic curves over large characteristic fields. We show that a special family of supersingular elliptic curves with embedding degree 3 admits a kind of fast symmetric pairings, whose computational costs might be twice the costs for the current fastest asymmetric pairings. © 2014 Springer International Publishing. |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16607 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Zhang, Xusheng ,Wang, Kunpeng . Fast symmetric pairing revisited[C]. Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany,2014:131-148. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment