By Topic

High Performance Point-Multiplication for Conic Curves Cryptosystem Based on Standard NAF Algorithm and Chinese Remainder Theorem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yongnan Li ; State Key Lab. of Software Dev. Environ., Beihang Univ., Beijing, China ; Limin Xiao ; Zifeng Wang ; Hongyun Tian

This paper presents parallel point-multiplication on conic curves based on standard NAF algorithm and Chinese Remainder Theorem. All analysis of parallel methodologies should take advantage of the basic parallel algorithms of conic curves cryptosystem in our previous works. We employ standard NAF algorithm to parallel the point-multiplication over finite field Fp by adopting the pipeline technique to compute point-addition and point-double respectively. The expression of point-addition over ring Zn is deduced to declare that the parallel methodology over finite field Fp could be used over ring Zn. The operation of point-multiplication over ring Zn is paralleled by partitioning the operation into two different finite fields based on Chinese Remainder Theorem and then combining the two temporary parameters to get the final result. After that, a quantitative performance contrast is made between sequential algorithm and parallel algorithm to show our approaches allow speeding up the point-multiplication on conic curves and reduce the time complexity. Additionally, the parallel method of paralleling point-multiplication over ring Zn introduced in this paper is also more efficient than an old parallel algorithm we proposed before.

Published in:

Information Science and Applications (ICISA), 2011 International Conference on

Date of Conference:

26-29 April 2011