Parallel Algorithms for Cryptosystem on Conic Curves over Finite Field Fp

Existing algorithms in conic curves cryptosystem are all sequential ones. It is important to have fast parallel algorithms to both encrypt and decrypt data for cryptosystem on conic curves. This paper proposes our own parallel algorithms for conic curves cryptosystem over finite field Fp. Our main works are paralleling the basic multiple-precision integer algorithms and the point-addition operation on conic curves over finite field Fp. We also calculate the speedup ratio based on computing the runtime of sequential arithmetic and parallel arithmetic in this cryptosystem. The performance evaluation demonstrates that our methodology could reduce time complexity and improve efficiency for conic curves cryptosystem over finite field Fp.