A Fast Parallel Modular Exponentiation Algorithm
Fathy, Khaled A.; Bahig, Hazem; Ragab, A. A.;
Abstract
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 2 to 2 bits. The results show that our work has a fast running time and more scalable than previous works. 12 20
Other data
| Title | A Fast Parallel Modular Exponentiation Algorithm | Authors | Fathy, Khaled A.; Bahig, Hazem ; Ragab, A. A. | Keywords | Binary method;Modular exponentiation;Multiplication algorithm;Parallel algorithm;Scalability | Issue Date | 1-Feb-2018 | Publisher | SPRINGER HEIDELBERG | Journal | Arabian Journal for Science and Engineering | Volume | 43 | Start page | 903 | End page | 911 | ISSN | 2193567X | DOI | 10.1007/s13369-017-2797-3 | Scopus ID | 2-s2.0-85040349030 | Web of science ID | WOS:000419864700031 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.