refinement of millers algorithm over edwards curves

ISCAS OpenIR > 信息安全国家重点实验室

	refinement of millers algorithm over edwards curves
	Xu Lei; Lin Dongdai
	2010
会议名称	Cryptographers Track held at the RSA Conference (CT-RSA)
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	106-118
会议日期	MAR 01-05,
会议地点	San Francisco, CA
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	TOPICS IN CRYPTOLOGY - CT-RSA 2010, PROCEEDINGS
ISSN	0302-9743
ISBN	978-3-642-11924-8
部门归属	Xu, Lei; Lin, Dongdai Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing, Peoples R China.
摘要	Edwards gave a new form of elliptic curves in I, and these curves were introduced to cryptography by Bernstein and Lange in 2. The Edwards curves enjoy faster addition and doubling operations, so they are very attractive for elliptic curve cryptography. In 2006, Blake, Murty and Xu proposed three refinements to Millers algorithm for computing Weil/Tate pairings over Weierstrass curves. In this paper we extend their method to Edwards curve and propose a, faster algorithm for computing pairings with Edwards coordinates, which comes from the analysis of divisors of rational functions.
关键词	Cryptography Bilinear Pairing Miller Algorithm Twisted Edwards Curve
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8882
专题	信息安全国家重点实验室
推荐引用方式 GB/T 7714	Xu Lei,Lin Dongdai. refinement of millers algorithm over edwards curves[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:TOPICS IN CRYPTOLOGY - CT-RSA 2010, PROCEEDINGS,2010:106-118.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
refinement of miller（213KB）			开放获取	--	请求全文