Parallel computation of the multi-exponentiation for cryptosystems

Chin Chen Chang, Der Chyuan Lou*

*此作品的通信作者

研究成果: 期刊稿件文章同行評審

12 引文 斯高帕斯(Scopus)

摘要

Some methods of fast modular exponentiation have been proposed in the past years. However, there are only a few parallel mechanisms for evaluating the modular multi-exponentiation. In this paper, we propose two efficient parallel algorithms to speed up the computation of the modular multi-exponentiation Πi=1nMiEi (mod N), which is an important but time-consuming arithmetic operation used in many scientific researches and applications, especially in the contemporary cryptosystems. We also show that our two proposed methods are faster than the best known sequential method (the Shamir's method) and parallel method (the Chiou's method). Furthermore, our methods can be implemented easily in the multicomputer systems.

原文英語
頁(從 - 到)9-26
頁數18
期刊International Journal of Computer Mathematics
63
發行號1-2
DOIs
出版狀態已出版 - 1997
對外發佈

指紋

深入研究「Parallel computation of the multi-exponentiation for cryptosystems」主題。共同形成了獨特的指紋。

引用此