A Variant RSA Acceleration with Parallelization
This work addresses the time penalty in RSA encryption for secure communication systems, offering a practical improvement with parallelization, though it appears incremental as it builds on existing RSA concepts.
The paper tackles the computational inefficiency of standard RSA encryption by developing a parallel algorithm (PMKRSA) that splits plaintext into chunks and encrypts them with multiple key-pairs, resulting in significantly reduced encryption and decryption times, such as 0.0009s for encryption and 0.0618s for decryption with a CPU+GPU version on 100 MB files.
The standard RSA relies on multiple big-number modular exponentiation operations and longer key-length is required for better protection. This imposes a hefty time penalty for encryption and decryption. In this study, we analyzed and developed an improved parallel algorithm (PMKRSA) based on the idea of splitting the plaintext into multiple chunks and encrypt the chunks using multiple key-pairs. The algorithm in our new scheme is so natural for parallelized implementation that we also investigated its parallelization in a GPU environment. In the following, the structure of our new scheme is outlined, and its correctness is proved mathematically. Then, with the algorithm implemented and optimized on both CPU and CPU+GPU platforms, we showed that our algorithm shortens the computational time considerably, and it has a security advantage over the standard RSA as it is invulnerable to the common attacks. Finally, we also proved the feasibility of using our algorithm to encrypt large files through simulation. The results show that over the set of file size: 1 MB, 10 MB, 25 MB, 50 MB, 100 MB, the average encryption and decryption time of the CPU version is 0.2476s and 9.4476s, and for the CPU+GPU version, it is 0.0009s and 0.0618s, respectively.