A Fast Parallel Modular Exponentiation Algorithm
| Autor: | Khaled A. Fathy, Hazem M. Bahig, A. A. Ragab |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Modular exponentiation
Multidisciplinary Computer science Cloud systems Spigot algorithm Parallel algorithm 0102 computer and information sciences 02 engineering and technology Parallel computing 01 natural sciences Running time 010201 computation theory & mathematics Scalability 0202 electrical engineering electronic engineering information engineering Cryptosystem 020201 artificial intelligence & image processing Algorithm Exponentiation by squaring |
| Zdroj: | Arabian Journal for Science and Engineering. 43:903-911 |
| ISSN: | 2191-4281 2193-567X |
| DOI: | 10.1007/s13369-017-2797-3 |
| Popis: | 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^{12}$$ to $$2^{20}$$ bits. The results show that our work has a fast running time and more scalable than previous works. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink