Name
Abstract | ||
|---|---|---|
In this paper, an efficient algorithm for the computationof Tate pairing on general curves is presented. Our approach is to change the binary representation of the involved integer to its non–adjacent form at first, and then pre–organize this form to make further improvement on its efficiency. We also show this algorithm has better performance than BMX and LHC algorithms. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ISECS.2008.34 | ISECS |
Keywords | Field | DocType |
general curve,computationof tate pairing,lhc algorithm,tate pairing computation,adjacent form,binary representation,better performance,efficient algorithm,improved algorithm,involved integer,galois fields,integer,cryptography,large hadron collider,cryptographic protocol,algorithm design and analysis,approximation algorithms | Integer,Approximation algorithm,Finite field,Non-adjacent form,Algorithm design,Computer science,Algorithm,Tate pairing,Computation,Binary number | Conference |
Citations | PageRank | References |
1 | 0.36 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ting Wu | 1 | 120 | 3.90 |
| Min Zhang | 2 | 1 | 0.70 |
| X. Xu | 3 | 129 | 40.35 |
| Rong-bo Wang | 4 | 5 | 4.16 |