Compression-RSA: new approach of encryption and decryption method

• Main Authors: Chang, Ee Hung, Arif Mandangan
• Format: Conference or Workshop Item
• Language: English; English
• Published: 2013
• Subjects: TK5101-6720 Telecommunication Including telegraphy, telephone, radio, radar, television
• Online Access: https://eprints.ums.edu.my/id/eprint/30336/1/Compression-RSA_%20New%20Approach%20Of%20Encryption%20And%20Decryption%20Method%20ABSTRACT.pdf; https://eprints.ums.edu.my/id/eprint/30336/2/Compression-RSA%20New%20Approach%20Of%20Encryption%20And%20Decryption%20Method.pdf; https://eprints.ums.edu.my/id/eprint/30336/; https://aip.scitation.org/doi/pdf/10.1063/1.4801103; https://doi.org/10.1063/1.4801103

Rivest-Shamir-Adleman (RSA) cryptosystem is a well known asymmetric cryptosystem and it has been applied in a very wide area. Many researches with different approaches have been carried out in order to improve the security and performance of RSA cryptosystem. The enhancement of the performance of RSA cryptosystem is our main interest. In this paper, we propose a new method to increase the efficiency of RSA by shortening the number of plaintext before it goes under encryption process without affecting the original content of the plaintext. Concept of simple Continued Fraction and the new special relationship between it and Euclidean Algorithm have been applied on this newly proposed method. By reducing the number of plaintext-ciphertext, the encryption-decryption processes of a secret message can be accelerated.