Abstract | ||
---|---|---|
This paper makes a comparison of three parallel point-multiplication algorithms on conic curves over ring Zn. We propose one algorithm for paralleling point-multiplication by utilizing Chinese Remainder Theorem to divide point-multiplication over ring Zn into two different point-multiplications over finite field and to compute them respectively. Time complexity and speedup ratio of this parallel algorithm are computed on the basis of our previous research about the basic parallel algorithms in conic curves cryptosystem. A quantitative performance analysis is made to compare this algorithm with two other algorithms we designed before. The performance comparison demonstrates that the algorithm presented in this paper can reduce time complexity of pointmultiplication on conic curves over ring Zn and it is more efficient than the preceding ones. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1007/978-3-642-24669-2_5 | ICA3PP (2) |
Keywords | Field | DocType |
parallel algorithm,paralleling point-multiplication,ring zn,basic parallel algorithm,quantitative performance analysis,conic curves cryptosystem,performance comparison,conic curve,parallel point-multiplication algorithm,time complexity,chinese remainder theorem | Finite field,Mathematical optimization,Multiplication algorithm,Family of curves,Parallel algorithm,Computer science,Parallel computing,Algorithm,Cryptosystem,Time complexity,Conic section,Speedup | Conference |
Volume | ISSN | Citations |
7017 | 0302-9743 | 2 |
PageRank | References | Authors |
0.40 | 3 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yongnan Li | 1 | 26 | 8.35 |
Limin Xiao | 2 | 107 | 28.51 |
Guangjun Qin | 3 | 5 | 3.95 |
Xiuqiao Li | 4 | 51 | 5.74 |
Songsong Lei | 5 | 2 | 0.40 |