| Title: | refinement of millers algorithm over edwards curves |
| Author: | Xu Lei
; Lin Dongdai
|
| Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| Conference Name: | Cryptographers Track held at the RSA Conference (CT-RSA)
|
| Conference Date: | MAR 01-05,
|
| Issued Date: | 2010
|
| Conference Place: | San Francisco, CA
|
| Keyword: | Cryptography
; bilinear pairing
; Miller algorithm
; twisted Edwards curve
|
| Publisher: | TOPICS IN CRYPTOLOGY - CT-RSA 2010, PROCEEDINGS
|
| Publish Place: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| ISSN: | 0302-9743
|
| ISBN: | 978-3-642-11924-8
|
| Department: | Xu, Lei; Lin, Dongdai Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing, Peoples R China.
|
| English Abstract: | 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. |
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/8882
|
| Appears in Collections: | 信息安全国家重点实验室_会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| refinement of millers algorithm over edwards curves.pdf（213KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
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,.
|
|
|
