Comparative Analysis of Encryption Algorithms

 the vulnerable nature of some sensitive and classified information such as health and bank related data has undoubtedly caused serious havoc to individuals who should enjoy the privacy and confidentiality of their information. In an attempt to guarantee absolute security of information from one source to another and also to prevent confidential information from being revealed to unauthorized people, encryption algorithms are being used to achieve this. Encryption algorithms are basically useful for securing and protecting data being transmitted from one end to another from any form of vulnerability. Over the years, researchers have adopted some of these algorithms to ensure privacy of information in banking, health and military. Some of these algorithms are varied in terms of efficiency, accuracy, reliability and response time whenever they are used for data protection. In an attempt to carry out a comparative assessment, we considered Rivest-Shamir-Adleman (RSA), Advanced Encryption Standard (AES) and Data Encryption Standard (DES) algorithms. Since there is skepticism on which of the algorithms is more reliable, dependable and functional when considering features that characterized their variation, this work therefore, attempts to do a comparative assessment of each of the encryption algorithms to ascertain the best using the stated metrics. The implementation was carried out with C#. The results obtained from the experimentation revealed that AES uses the lowest time for encryption while RSA consumes longest encryption time. Also, AES algorithm is considered the most efficient of all the three algorithms based on the metrics used for the evaluation. Few of the results obtained are presented in this paper

An Efficient Implementation of Multi-Prime RSA on DSP Processor

Recently multi-prime RSA has been proposed to speed up RSA implementations. Both 2-prime and multi-prime implementations require squaring reduction and multiplication reduction of multi-precision integers. Montgomery reduction algorithm is the most efficient way to do squaring and multiplication reductions. In this paper, we present a new method to implement the Montgomery squaring reduction, which speeds up squaring reduction by 10-15% for various key sizes. Furthermore, a multi-prime 1024-bit RSA signing operation is implemented on TI TMS320C6201 DSP processor with the new reduction method. As the result, signing operation can be finished within 6ms, which is about twice faster than the RSA implementation in [11] on the same DSP platform