Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
