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 subelds.Consequently, full extension eld operations have the greatest eect 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 suer 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