Abstract | ||
---|---|---|
We propose efficient strategies for calculating point tripling on Hessian $$8M+5S$$8M+5S, Jacobi-intersection $$7M+5S$$7M+5S, Edwards $$8M+5S$$8M+5S and Huff $$10M+5S$$10M+5S curves, together with a fast quintupling formula on Edwards curves. M is the cost of a field multiplication and S is the cost of a field squaring. To get the best speeds for single-scalar multiplication without regarding perstored points, computational cost between different double-base representation algorithms with various forms of curves is analyzed. Generally speaking, tree-based approach achieves best timings on inverted Edwards curves; yet under exceptional environment, near optimal controlled approach also worths being considered. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1007/978-3-319-38898-4_12 | Inscrypt |
Keywords | Field | DocType |
Elliptic curves, Scalar multiplication, Point arithmetic, Double-base number system | Discrete mathematics,Scalar multiplication,Family of curves,Hessian matrix,Multiplication,Elliptic curve,Mathematics,Edwards curve | Conference |
Volume | ISSN | Citations |
9589 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 12 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Weixuan Li | 1 | 0 | 1.01 |
Wei Yu | 2 | 9 | 5.26 |
Kunpeng Wang | 3 | 15 | 6.71 |