中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
Fast symmetric pairing revisited
Author: Zhang, Xusheng (1) ; Wang, Kunpeng (2)
Conference Name: 6th International Conference on Pairing-Based Cryptography, Pairing 2013
Conference Date: November 22, 2013 - November 24, 2013
Issued Date: 2014
Conference Place: Beijing, China
Publish Place: Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany
Indexed Type: EI
ISSN: 3029743
Department: (1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
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.
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.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16607
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Zhang, Xusheng ,Wang, Kunpeng . Fast symmetric pairing revisited[C]. 见:6th International Conference on Pairing-Based Cryptography, Pairing 2013. Beijing, China. November 22, 2013 - November 24, 2013.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zhang, Xusheng (1)]'s Articles
[Wang, Kunpeng (2)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zhang, Xusheng (1)]‘s Articles
[Wang, Kunpeng (2)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace