Abstract

Conic curves cryptosystem is a new technology for achieving information security. Point-addition and point double are fundamental operations in conic curves cryptosystem over ring Zn. There is no existing research about the parallel computation for conic curves cryptosystem over ringZn. This paper proposes parallel algorithms of point-addition and point-double for cryptosystem on conic curves over ringZn. Additionally, we present a methodology to simplify the operation of computing greatest common factor by replacing it using two reduction operations in this cryptosystem. Research in this paper is based on our previous works about parallel algorithms for conic curves cryptosystem over finite field Fp. We design the parallel algorithms by analyzing basic multiple precision algorithms used in these operations. The performance evaluation demonstrates that our methodology could improve efficiency for conic curves cryptosystem over ring Zn.

Full Text
Paper version not known

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 call

Disclaimer: 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.