A Fast Parallel Modular Exponentiation Algorithm

作者：Fathy Khaled A; Bahig Hazem M^*; Ragab A A

来源：ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2018, 43(2): 903-911.

DOI：10.1007/s13369-017-2797-3

• Binary method
• Modular exponentiation
• Multiplication algorithm
• Parallel algorithm
• Scalability

Modular exponentiation is a fundamental and most time-consuming operation in several public-key cryptosystems such as the RSA cryptosystem. In this paper, we propose two new parallel algorithms. The first one is a fast parallel algorithm to multiply n numbers of a large number of bits. Then we use it to design a fast parallel algorithm for the modular exponentiation. We implement the parallel modular exponentiation algorithm on Google cloud system using a machine with 32 processors. We measured the performance of the proposed algorithm on data size from to bits. The results show that our work has a fast running time and more scalable than previous works.

• 出版日期2018-2