QQ客服 官方微博 反馈留言

	Faster pairing computation on genus 2 hyperelliptic curves
	Tang, Chunming ; Xu, Maozhi ; Qi, Yanfeng
	2011
关键词	Cryptography Genus 2 hyperelliptic curves Pairing-based cryptography Efficiently computable endomorphisms Pairing computation ABELIAN-VARIETIES DIFFIE-HELLMAN EFFICIENT IMPLEMENTATION PROTOCOL
英文摘要	In this paper, new efficient pairings on genus 2 hyperelliptic curves of the form C: y(2) = x(5) + ax with embedding degree k satisfying 41k are constructed, that is an improvement for the results of Fan et al. (2008) [10]. Then a variant of Miller's algorithm is given to compute our pairings. In this algorithm, we just need to evaluate the Miller function at two divisors for each loop iteration. However, Fan et al. had to compute the Miller function at four divisors. Moreover, compared with Fan et al.'s algorithm, the exponentiation calculation is simplified. We finally analyze the computational complexity of our pairings, which shows that our algorithm can save 2036m operations in the base field or be 34.1% faster than Fan et al.'s algorithm. The experimental result shows that our pairing can achieve a better performance. (C) 2011 Elsevier B.V. All rights reserved.; Computer Science, Information Systems; SCI(E); EI; 1; ARTICLE; 10; 494-499; 111
语种	英语
出处	EI ; SCI
出版者	information processing letters
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/157605]
专题	数学科学学院
推荐引用方式 GB/T 7714	Tang, Chunming,Xu, Maozhi,Qi, Yanfeng. Faster pairing computation on genus 2 hyperelliptic curves. 2011-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。