Parallelization of Symmetric and Asymmetric security Algorithms for MultiCore Architectures

Symmetric and Asymmetric algorithms are complex that requires large number of mathematical computations to be done. The sequential execution of the algorithms would require a considerable amount of execution time. This may not feasible for most of the applications that require faster rate of encryption and decryption to match the required data flow. The objective of this work is to optimize the execution of Symmetric and Asymmetric algorithms at code level that is to be implemented in a MultiCore environment. In this work, code level parallelism is preferred since it can work on any architecture without any modifications. Hence, our objective is to parallelize the existing security algorithms, so that the proposed algorithm can enhance the power of MultiCore architectures thereby it leads to less run time complexity. In this work the time complexity of the most popular algorithms for parallelization since it is predominantly used in all Network Protocols and Applications. The work focuses on enhancing the performance of these algorithms by parallelizing code so that it can utilize more than one processor in MultiCore architecture efficiently for its execution.