Research Article

3D(4 X 4 X 4) - Playfair Cipher

by  Amandeep Kaur, Harsh Kumar Verma, Ravindra Kumar Singh
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 51 - Issue 2
Published: August 2012
Authors: Amandeep Kaur, Harsh Kumar Verma, Ravindra Kumar Singh
10.5120/8017-1286
PDF

Amandeep Kaur, Harsh Kumar Verma, Ravindra Kumar Singh . 3D(4 X 4 X 4) - Playfair Cipher. International Journal of Computer Applications. 51, 2 (August 2012), 36-38. DOI=10.5120/8017-1286

                        @article{ 10.5120/8017-1286,
                        author  = { Amandeep Kaur,Harsh Kumar Verma,Ravindra Kumar Singh },
                        title   = { 3D(4 X 4 X 4) - Playfair Cipher },
                        journal = { International Journal of Computer Applications },
                        year    = { 2012 },
                        volume  = { 51 },
                        number  = { 2 },
                        pages   = { 36-38 },
                        doi     = { 10.5120/8017-1286 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2012
                        %A Amandeep Kaur
                        %A Harsh Kumar Verma
                        %A Ravindra Kumar Singh
                        %T 3D(4 X 4 X 4) - Playfair Cipher%T 
                        %J International Journal of Computer Applications
                        %V 51
                        %N 2
                        %P 36-38
                        %R 10.5120/8017-1286
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

The theme of this research is to provide security for the data that contains alphabets numerals and special characters during its transmission. However because of the drawbacks inherent in the classical Playfair cipher which adversely affects the security, this research proposed 3D-Playfair Cipher (4 X 4 X 4 Playfair cipher) which works on trigraph rather than using digraph which eliminates the fact that a diagram and its reverse will encrypt in a similar fashion. 3D-Playfair cipher supports all 26 alphabets {A-Z}, 10 digits {0-9} and 28 special characters { ! " # $ % & ' ( ) * + , - . / : ; < = > ? @ [ ] ^ _ | } which eliminate the limitation of classical Playfair in which "i" and "j" both character cannot appear at the same time. 3D-Playfair enhances the security by increasing complexity. Various types of cryptography attacks have been taken under consideration for original Playfair cipher but not vulnerable for this proposed cipher.

References
  • William Stallings, Cryptography and Network Security Principles and Practice. Second edition, Pearson Education.
  • Schnier B, Applied cryptography: protocols, algorithms and source code in C. New York: John Wiley and sons, 1996.
  • Menezes AJ, Oorschot PCV, Vanstone SA, Handbook of applied cryptography. Boca Raton, Florida, USA: CRC Press; 1997.
  • Johannes A. Buchmann, Introduction to Cryptography. Second Edition, Springer –Verlag NY, LLC, 2001.
  • Behrouz A. Forouzan, Cryptography and Network Security. Special Indian Edition, The McGraw- Hill companies, New Delhi, 2007.
  • Dhiren R. Patel, Information Security Theory and Practice. First Edition, Prentice-Hall of India Private Limited, 2008.
  • Keith Harrison, Bill Munro and Tim Spiller, Security through uncertainty. P Laboratories, February, 2007.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

3D Playfair cipher trigraph

Powered by PhDFocusTM