Speeding up Multi-exponentiation on Multicore System
Fathy, Khaled A.; Bahig, Hazem; Farag, M.;
Abstract
A public key cryptosystem is a basic tool to protect data security. Most public key cryptosystem schemes include time
consuming operations such as the modular multi exponentiation. To address this problem, a new parallel algorithm for
the modular multi exponentiation is introduced. The proposed algorithm is based on parallelizing the binary method.
The experimental study on a multicore system shows that the running time of the proposed algorithm is smaller than
the previous parallel algorithm in the cases of large data sizes under different number of processors. The percentage of
improvement is up to 55% compared with the previous algorithm.
consuming operations such as the modular multi exponentiation. To address this problem, a new parallel algorithm for
the modular multi exponentiation is introduced. The proposed algorithm is based on parallelizing the binary method.
The experimental study on a multicore system shows that the running time of the proposed algorithm is smaller than
the previous parallel algorithm in the cases of large data sizes under different number of processors. The percentage of
improvement is up to 55% compared with the previous algorithm.
Other data
| Title | Speeding up Multi-exponentiation on Multicore System | Authors | Fathy, Khaled A.; Bahig, Hazem ; Farag, M. | Keywords | parallel algorithm;modular exponentiation;RSA | Issue Date | 2018 | Publisher | Egyptian Knowledge Bank | Journal | JOURNAL OF THE EGYPTIAN MATHEMATICAL SOCIETY | Volume | 26 | Issue | 2 | Start page | 235 | End page | 244 | DOI | 10.21608/JOEMS.2018.2540.1008 |
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.