Author:
Prashant ,MD Sohail Haque ,Amrinder Kaur ,Pankaj Yadav
Abstract
In today’s digitized era, where the whole world is interconnected and every information about individuals are collected, it is important to process and store the data such that it is safe from unauthorized access. Encryption is used to turn the plain text into cipher text which makes the data unreadable, thus maintaining its confidentiality and integrity. Among the several encryption methods available, Advanced Encryption Standard (AES) and Rivest Shamir Adleman (RSA) are popularly used due to their effectiveness and efficiency. However, alternative encryption techniques exist, each offers different level of security and performance. This study presents a thorough comparative analysis of AES and RSA alongside other encryption methods to assess their suitability for secure communication. Factors such as encryption strength, computational complexity, key management, scalability, and versatility are examined to provide a comprehensive understanding of each technique's strengths and weaknesses. By scrutinizing these aspects, this research aims to offer insights for decision-makers in selecting the most suitable encryption method tailored to specific requirements and constraints.
Reference14 articles.
1. Daemen, J., & Rijmen, V. (2002). The design of Rijndael: AES - the Advanced Encryption Standard. Springer Science & Business Media.
2. Rivest, R. L., Shamir, A., & Adleman, L. M. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.
3. Bernstein, D. J. (2007). The ChaCha stream cipher. In New Stream Cipher Designs (pp. 90-171). Springer, Berlin, Heidelberg.
4. Schneier, B. (1994). Description of a new variable-length key, 64-bit block cipher (Blowfish). In Fast Software Encryption (pp. 191-204). Springer, Berlin, Heidelberg.
5. Lange, T., & Bernstein, D. J. (2006). Faster addition and doubling on elliptic curves. In Advances in Cryptology-EUROCRYPT 2006 (pp. 29-50). Springer, Berlin, Heidelberg.