Super-optimal Pairings

摘要：

In this paper, we construct super-optimal pairings with efficiently computable endomorphisms. We first consider elliptic curves E/F4∶y2=x3+B and construct superoptimal pairings with automorphisms and Frobenius endomorphisms. In the case of (3,k)=1, these super-optimalpairings can be computed using 2 logr/φ(3k) Miller iterations, with k the embedding degree. This Miller loop length is only half of that of optimal pairings. Then we consider elliptic curves EFq∶y2=x3+u6B and give super-optimal pairings with efficiently computable endomorphisms constructed by Galbraith et al. 6. In the case of (6, k)=1, thesesuper-optimal pairings can be computed by 2 log2r/φ(12k)Miller iterations, with k the embedding degree.This Miller loop length is only 1/4 of that of optimal pairings

关键词： Elliptic curves isogeny optimized pairing pairing-based cryptography

作者: Chunming Tang Maozhi Xu Yanfeng Qi

作者单位: School of Mathematical Science, Peking University,Beijing, 100871, China Key Laboratory of Network and Software SecurtiyAssurance, School of Mathematical Sciences, PekingUni School of Mathematical Sciences, Peking University Beijing, 100871, China

会议类型: 国际会议

会议名称: 2011 International Conference on Information System and Computational Intelligence(2011 IEEE信息系统与计算智能国际会议 ICISCI 2011)

会议地点: 哈尔滨

会议语种:英文

页码: 238-242

在线出版日期: 2011-01-18（万方平台首次上网日期，不代表论文的发表时间）