Development of an Improved Playfair Cryptosystem Using Rhotrix

Development of an Improved Playfair Cryptosystem Using Rhotrix.

Abstract

Playfair is one of the best-known traditional ciphers but it is limited to different aspects such as white space, numbers, and other printable characters

. The existing technique is based on the use of a 5 × 5 matrix. This algorithm can only allow the text that contains uppercase alphabets only. But many algorithms have been proposed which allow extension of playfair to 6 × 6 matrix, 8 × 8 matrix and 7 × 4 matrix.

This dissertation deals with some of the limitations such as lowercase, numbers, white space and repetition of alphabet in pairs. Proposed modification uses rhotrix which is a new paradigm of matrix theory for rectangular arrays.

This work proposes an improved key matrix formation of the playfair cipher.

The order of the rhotrix will be set to 6 to make it compatible with the [n×(n-1)] mode of rhotrix representation which supports all 26 alphabets in both upper case letters (a-z) as well as lower case letters (a-z), ten digits (0-9), special characters and the extended special characters.

Experimental result produced better Playfair cipher to incorporate randomness and to eliminate the chances of being attacked by frequency testing of character occurrence over an existing 11 × 11 matrix. The system was developed in java because of platform independence and availability.

Introduction

Background of the Study

The security of data transmission is an important problem in communication networks. A communication system is reliable as long as it maintains the integrity, availability, and privacy of data. Data integrity is the protection of data from unauthorized modification, resistance to penetration, and undetected modification.

Therefore, it is important to secure a cryptosystem that provides encryption and decryption to the data. To achieve a secure cryptosystem, Cryptology is essential. Cryptology is the study of cryptography and crypt analysis. Cryptography is the study of information hiding and verification.

It includes the protocols, algorithms and strategies to securely and consistently prevent or delay unauthorized access to sensitive information and enable verifiability of every component in a communication (Saini and Mandal, 2015).

Cryptanalysis is the art of ‘attacking’ cryptosystems in order to ‘crack’ them or at least discover their weaknesses (Stallings, 2011).

When cryptanalysis reveals weaknesses in cryptosystems, cryptographers create more secure cryptosystems. Conversely, as cryptosystems become stronger, cryptanalysts try to discover more powerful methods of attacking them. Thus, cryptography and cryptanalysis are complementary.

References

Abomhara, M., Omar Z. And Othman, O. K. (2010).An Overview of Video Encryption Techniques. International Journal of Computer Theory and Engineering, 2(1), 103-110.
Alam, A, Khalid, S. And Salam, M. (2013). A Modified Version of Playfair Cipher Using 7×4 Matrix, International Journal of Computer Theory and Engineering. 5(4), 626-628.
Ajibade, A. O. (2003), “The Concept of Rhotrix in Mathematical Enrichment,” International Journal of Mathematical Education in Science and Technology, 34 (2), 175-179.
Amandeep, K., Harsh, K.V. and Ravindra, K. S. (2012). 3D (4 X 4 X 4) – Playfair Cipher. International Journal of Computer Applications, 51(2), 36-38.
Ayushi, A. (2010). A Symmetric Key Cryptographic Algorithm. International Journal of Computer Applications, 1(15), 1-4.
Atanassov, K. T. And Shannon, A. G., (1998), Matrix-Tertions and Matrix-Noitrets:Exercises in Mathematical Enrichment.    International   Journal of Math Education in Science and Technology, 29, 898-903.

Comments are closed.

Hey Hi

Don't miss this opportunity

Enter Your Details