A Variant RSA Acceleration with Parallelization

by   Jun-jie Liu, et al.

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.


page 1

page 2

page 3

page 4


Bit-level Parallelization of 3DES Encryption on GPU

Triple DES (3DES) is a standard fundamental encryption algorithm, used i...

A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems

In this paper, we study various parallelization schemes for the Variable...

Distributed Kernel K-Means for Large Scale Clustering

Clustering samples according to an effective metric and/or vector space ...

Gaussian Process Models with Parallelization and GPU acceleration

In this work, we present an extension of Gaussian process (GP) models wi...

Parallel Prony's method with multivariate matrix pencil approach and its numerical aspect

Prony's method is a standard tool exploited for solving many imaging and...

The electromagnetic waves propagation in unmagnetized plasma media using parallelized finite-difference time-domain method

The finite-difference time-domain (FDTD) method has been commonly utiliz...

GPGPU Acceleration of the KAZE Image Feature Extraction Algorithm

The recently proposed open-source KAZE image feature detection and descr...

Please sign up or login with your details

Forgot password? Click here to reset