IMPLEMENTATION OF TEXT VERIFICATION USING RIVEST SHAMIR ADLEMAN (RSA) METHOD

Abstract

The development of technology and network systems experience a significant increase, especially in the security aspect. Network security has at least two features, specifically authentication and nonrepudiation. Cryptography can be used for information security in the form of confidentiality, data integrity, non-denial, and authentication. To maintain the security of messages in the form of text or words, encryption techniques are usually employed to guarantee the confidentiality of the data. One of the encryption algorithms that is frequently used is the Rivest Shamir Adleman (RSA) cryptographic algorithm. In this study, the RSA algorithm is used as a data protector and uses a texting mechanism as a verification tool. This study aims to create an authenticated message delivery interface by applying the Rivest Shamir Adleman (RSA) cryptographic algorithm to a text. RSA is an asymmetric algorithm that has two dissimilar keys, explicitly the public key and the private key. The two key pairs are used for the encryption and decryption process. The security level of the RSA algorithm is very dependent on the size of the key, because the smaller the key size, the greater the possibility of key combinations that can be broken by checking the combination of keys one by one or better known as Brute Force Attack. The prime numbers generated in the RSA algorithm affect the size of the cipher key.