New Generic Design to Expedite Asymmetric Cryptosystems Using Three-levels of Parallelism

Public key cryptosystems depend on complex and time consuming arithmetic operations. Public key cryptosystems require modular operations over large numbers or finite fields. Researchers are working on improving the performance of asymmetric cryptosystems while maintaining the security of the cryptographic algorithms. Parallel computing is the most promising solution to improve the computing power and speed-up these arithmetic operations. In this paper, we propose a generic model to execute any encryption algorithm through a parallelpipelined design. The proposed design is twofold. First, we make use of a number of processors to execute different encryption/decryption steps in parallel. Secondly, complex arithmetic operations could be divided into small simple arithmetic operations that are executed in parallel. Simulation experiments show that parallel implementations of the aggregated signcryption protocol (as a case study) outperforms the sequential performance. The average values of improvement ranges from 47.5% to 80.4% for different number of processors.