This is a preview and has not been published.

Proposed Hybrid Cryptosystems Based on Modifications of Playfair Cipher and RSA Cryptosystem


  • Saja Mohammed Suhael Department of Mathematics, College of Science for Women, University of Baghdad, Baghdad
  • Zaynab Anwer Ahmed Department of Mathematics, College of Science for women, University of Baghdad, Baghdad, Iraq
  • Abir Jaafer Hussain Computer Science and Mathematics, Liverpool John Moores University, Liverpool, UK



Ciphertext, CRT, Cryptosystem, Plaintext, Playfair cipher, Private and public key, RSA cipher


Cipher security is becoming an important step when transmitting important information through networks. The algorithms of cryptography play major roles in providing security and avoiding hacker attacks. In this work two hybrid cryptosystems have been proposed, that combine a modification of the symmetric cryptosystem Playfair cipher called the modified Playfair cipher and two modifications of the asymmetric cryptosystem RSA called the square of RSA technique and the square RSA with Chinese remainder theorem technique. The proposed hybrid cryptosystems have two layers of encryption and decryption. In the first layer the plaintext is encrypted using modified Playfair to get the cipher text, this cipher text will be encrypted using squared RSA to get the final cipher text. This algorithm achieved higher security to data but suffers from a long computational time. So Chinese remainder theorem has been used in the second hybrid cryptosystem to obtain less encryption and decryption time. The simulation results indicated that using the modified Playfair with the proposed square RSA has improved security. Moreover, using the Chinese remainder theorem achieved less encryption and decryption time in comparison to our first proposed and the standard algorithms.


Download data is not yet available.


Din M, Pal SK, Muttoo SK, Madan S. A Hybrid Computational Intelligence-based Technique for Automatic Cryptanalysis of Playfair Ciphers. Def Sci J. 2020; 70(6): 612–618.

Somsuk K. A new methodology to find private key of RSA based on euler totient function. Baghdad Sci J. 2021; 18(2): 338–348.

Khudhair ZN, Nidhal A, El Abbadii NK. Text Multilevel Encryption Using New Key Exchange Protocol. Baghdad Sci J. 2022; 19(3): 619–630.

Ibraheem NA, Hasan MM. Combining several substitution cipher algorithms using circular queue data structure. Baghdad Sci J. 2020;17(4): 1320–1327.

Amalia Budiman MA, Sitepu R. File text security using Hybrid Cryptosystem with Playfair Cipher Algorithm and Knapsack Naccache-Stern Algorithm. J Phys. 2018; 978(1): 1–8.

Sohail A, Wasiq K, Abir H. Phishing Attacks and Websites Classification Using Machine Learning and Multiple Datasets (A Comparative Analysis), Int Conf Comput. Springer. 2020; 12465: 301–313.

Salih RK, Yousif MS. Hybrid encryption using playfair and RSA cryptosystems. Int J Nonlinear Anal Appl. 2021; 12(2): 2345–2350.

Hemanth PN, Abhinay Raja N, Yadav N. Secure message transfer using RSA algorithm and improved playfair cipher in cloud computing. 2nd Int Conf Converg Technol. (I2CT). IEEE. 2017; 931–936.

Chauhan SS, Singh H, Gurjar RN. Secure Key Exchange using RSA in Extended Playfair Cipher Technique. Int J Comput Appl. 2014; 104(15): 13–19.

Samir R, Abdulkader H, Hussein R. Improved RSA security using Chinese Remainder Theorem and Multiple Keys. Futur Comput Informatics J. 2019; 4(1): 1–9.

Mathur SK, Srivastava S. Extended 16x16 Play-Fair Algorithm for Secure Key Exchange Using RSA Algorithm. Int J Futur Revolut Comput Sci Commun Eng. 2018; 4(2): 496–502.

Balaraman D, Veerasamy M, Balaji V. An Efficient Cryptosystem Using Playfair Cipher Together With Graph Labeling Techniques. J Phys. 2021; 1964(2): 1–15.

Sumarsono, Anshari M, Mujahidah A. Expending technique cryptography for plaintext messages by modifying playfair cipher algorithm with matrix 5 x 19. Int Conf Electr Eng Comput Sci. (ICECOS). IEEE. 2019: 10–13.

Villafuerte RS, Sison AM, Medina RP. I3D-Playfair: An Improved 3D Playfair Cipher Algorithm. IEEE Eurasia Conf IOT, Commun Eng. IEEE. 2019; 538–541.

Challa RK, Gunta VK. A modified symmetric key fully homomorphic encryption scheme based on Read-Muller Code. Baghdad Sci J. 2021; 18(2): 899–906.

Yakub S, Gbolagade K. An improved rsa cryptosystem based on thread and crt. e-Academia . 2017; 6(2): 70–79.

Zakariyau YB, Jibril LM, Usman AM, Garba A. Combined model of 9x9 Playfair and RSA for securing confidential information. J Comput Sci Appl. An Int J Niger Comput Soc. 2015; 22(12): 48–53.

Iqbal Z, Gola KK, Gupta B, and Kandpal M. Dual level security for key exchange using modified RSA public key encryption in playfair technique. Int J Comput Appl. 2015; 111(13): 5–9.

Somsuk K. The new integer factorization algorithm based on Fermat’s Factorization Algorithm and Euler’s theorem. Int J Electr Comput Eng. 2020; 10(2): 1469–1476.

Douglas RS, Maura BP. Cryptography Theory and Practice. fourth edi. Boca Raton: CRC Press, Taylor & Francis Group; 2018: 1–580.