Parallel Architectures, Algorithms and Programming, International Symposium on (2010)
Dalian, Liaoning China
Dec. 18, 2010 to Dec. 20, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2010.28
Cryptosystem on conic curves, which is a new developing cryptography, becomes more widespread in these days. It is important to explore fast parallel algorithms to both encrypt and decrypt information in conic curves cryptosystem. Point-multiplication is the key operation for constructing security protocol in conic curves cryptosystem. There is no existing research focused on paralleling point-multiplication for conic curves cryptosystem. This paper presents parallel computation of point-multiplication for conic curves cryptosystem over finite field Fp and ring Zn. Research in this paper is based on our previous works about several parallel algorithms for conic curves cryptosystem. The parallel technique of point-multiplication is computing point-addition and point-double respectively. The performance evaluation demonstrates that our methodology could improve efficiency for conic curves cryptosystem over finite field Fp and ring Zn.
conic curves cryptosystem, ring Zn, finite field Fp, point-multiplication, parallel algorithm
L. Xiao and Y. Li, "Parallel Point-Multiplication for Conic Curves Cryptosystem," Parallel Architectures, Algorithms and Programming, International Symposium on(PAAP), Dalian, Liaoning China, 2010, pp. 116-120.