refinement of millers algorithm over edwards curves
文献类型:会议论文
作者 | Xu Lei ; Lin Dongdai |
出版日期 | 2010 |
会议名称 | Cryptographers Track held at the RSA Conference (CT-RSA) |
会议日期 | MAR 01-05, |
会议地点 | San Francisco, CA |
关键词 | Cryptography bilinear pairing Miller algorithm twisted Edwards curve |
页码 | 106-118 |
英文摘要 | 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. |
会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
![]() |
会议录出版者 | TOPICS IN CRYPTOLOGY - CT-RSA 2010, PROCEEDINGS |
会议录出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
ISSN号 | 0302-9743 |
ISBN号 | 978-3-642-11924-8 |
源URL | [http://124.16.136.157/handle/311060/8882] ![]() |
专题 | 软件研究所_信息安全国家重点实验室_会议论文 |
推荐引用方式 GB/T 7714 | Xu Lei,Lin Dongdai. refinement of millers algorithm over edwards curves[C]. 见:Cryptographers Track held at the RSA Conference (CT-RSA). San Francisco, CA. MAR 01-05,. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。