今天是2024年12月18日 星期三 bsnc 退出

Avoiding Full Extension Field Arithmetic in Pairing Computations

http://www.firstlight.cn2010/3/16

[作者] Craig Costello Colin Boyd Juan Manuel Gonzalez Nieto Kenneth Koon-Ho Wong

[单位] Information Security Institute,Queensland University of Technology

[摘要] The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of operations in Fpk dominates the complexi…

[关键词] Pairings Miller's algorithm Tate pairing ate pairing

The most costly operations encountered in pairing computations are those that take

place in the full extension field Fpk . At high levels of security, the complexity of operations in Fpk dominates the complexity of the operations that occur in the lower degree sub elds.Consequently, full extension eld operations have the greatest e ect on the runtime of Miller's algorithm. Many recent optimizations in the literature have focussed on improving the overall operation count by presenting new explicit formulas that reduce the number of subfield operations encountered throughout an iteration of Miller's algorithm. Unfortunately, almost all of these

improvements tend to su er for larger embedding degrees where the expensive extension eld

operations far outweigh the operations in the smaller subfields.

存档附件原文地址

原文发布时间:2010/3/16

引用本文:

Craig Costello;Colin Boyd;Juan Manuel Gonzalez Nieto;Kenneth Koon-Ho Wong .Avoiding Full Extension Field Arithmetic in Pairing Computations http://bsnc.firstlight.cn/View.aspx?infoid=910383&cb=daiyingying
发布时间:2010/3/16.检索时间:2024/12/18

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...