Key points are not available for this paper at this time.
Security is always a major concern in the field of communication. Advanced encryption standard (AES) and Rivest-Shamir-Adleman (RSA) algorithms are the two popular encryption schemes that guarantee confidentiality and authenticity over an insecure communication channel. There has been trifling cryptanalytic progress against these two algorithms since their advent. This paper presents the fundamental mathematics behind the AES and RSA algorithm along with a brief description of some cryptographic primitives that are commonly used in the field of communication security. It also includes several computational issues as well as the analysis of AES and RSA security aspects against different kinds of attacks including the countermeasures against these attacks.
Hasib et al. (Sat,) studied this question.