A note on asynchronous multi-exponentiation algorithm using binary representation

Da-Zhi Sun

Chinese︱Feedback︱Save this page

• Elaborating Academic Views 　　　　 • Exchanging Innovative Ideas
• Protecting Intellectual Properties 　　• Fast Sharing Science Papers

Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China

Home > Papers

A note on asynchronous multi-exponentiation algorithm using binary representation

Da-Zhi Sun * #

School of Computer Science and Technology, Tianjin University, Tianjin 300072

*Correspondence author

#Submitted by

Subject:

Funding: China Postdoctoral Science Foundation Special Funded Project （No.No. 200902043）, National Natural Science Foundation of China （No.No. 61003306）, Specialized Research Fund for the Doctoral Program of Higher Education Funded the New Teacher Project （No.No. 200800561044）

Opened online:17 January 2012

Accepted by: none

Citation: Da-Zhi Sun.A note on asynchronous multi-exponentiation algorithm using binary representation[OL]. [17 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4460711

A basic but expensive operation in implementations of several famous public-key cryptosystems is the computation of the multi-exponentiation in a certain finite multiplication group. In 2007, Yang et al. presented an interesting asynchronous multi-exponentiation algorithm called the SUt method, which uses the binary representations for the exponents. In this note, we analyze the computational efficiency of the SUt method by modeling the scanning process as a Markov chain. It shows that their computational efficiency result is incorrect. Moreover, we make a performance comparison among the published techniques and show the performance of a modified sliding window method is better than that of the SUt method, when there are 4 or more additional registers. We hope that our research will be convenient to the development of the cryptographic devices.

Keywords:Cryptography; Multi-exponentiation; Algorithm analysis; Markov chain

For this paper

● PDF (0B)
● Revision 0 　　
● Print this paper
● Recommend this paper to a friend
● Add to my favorite list

Saved Papers

Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded	226
Bookmarked	0
Recommend	7
Comments	Array

Submit your papers

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.

	Check out RSS, or use RSS reader to subscribe this item

Saved Papers