首页 | 本学科首页   官方微博 | 高级检索  
     

双基数链算法计算Tate对的一种改进
引用本文:翁江,豆允旗,马传贵.双基数链算法计算Tate对的一种改进[J].电子学报,2012,40(9):1775-1782.
作者姓名:翁江  豆允旗  马传贵
作者单位:信息工程大学信息工程学院,河南郑州,450002
基金项目:国家高技术研究发展计划(863计划)课题
摘    要: 双线性对在基于身份的密码体制中有着广泛的应用.Miller算法是计算双线性对的核心算法.本文在双基数链计算Tate对的基础上给出了一种高效的Miller算法.通过范函数和共轭技巧的应用,减少了Miller算法中有理函数直线和垂线的数量并用共轭代替了求逆运算.结果表明新算法与已有算法相比效率提高了10%以上.

关 键 词:双基数链  Miller算法  Tate对  椭圆曲线
收稿时间:2011-09-20

Refinements of Double-Base Chains Algorithm for Computing Tate Pairing
WENG Jiang , DOU Yun-qi , MA Chuan-gui.Refinements of Double-Base Chains Algorithm for Computing Tate Pairing[J].Acta Electronica Sinica,2012,40(9):1775-1782.
Authors:WENG Jiang  DOU Yun-qi  MA Chuan-gui
Affiliation:(Institute of Information Engineering,Information Engineering University,Zhengzhou,Henan 450002,China)
Abstract:Pairings have been widely used in the study of identity-based cryptosystems (IBC).Miller algorithm is the key of computing pairings.We propose an efficient Miller algorithm computing Tate pairing based on the double-base chain.Through the application of norm function and conjugate technique,our refinements reduce the total number of lines and vertical lines in the rational function,and replace the inverse by its conjugate in Miller algorithm.Results show that the efficiency of our algorithm can be improved by more than 10% compared with the previous method.
Keywords:double-base chains  Miller algorithm  Tate pairing  elliptic curve
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号