Research Article

A Simple Algebraic Model based Polyalphabetic Substitution Cipher

by  Sukalyan Som, Sabyasachi Ghosh
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 39 - Issue 8
Published: February 2012
Authors: Sukalyan Som, Sabyasachi Ghosh
10.5120/4844-7111
PDF

Sukalyan Som, Sabyasachi Ghosh . A Simple Algebraic Model based Polyalphabetic Substitution Cipher. International Journal of Computer Applications. 39, 8 (February 2012), 53-56. DOI=10.5120/4844-7111

                        @article{ 10.5120/4844-7111,
                        author  = { Sukalyan Som,Sabyasachi Ghosh },
                        title   = { A Simple Algebraic Model based Polyalphabetic Substitution Cipher },
                        journal = { International Journal of Computer Applications },
                        year    = { 2012 },
                        volume  = { 39 },
                        number  = { 8 },
                        pages   = { 53-56 },
                        doi     = { 10.5120/4844-7111 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2012
                        %A Sukalyan Som
                        %A Sabyasachi Ghosh
                        %T A Simple Algebraic Model based Polyalphabetic Substitution Cipher%T 
                        %J International Journal of Computer Applications
                        %V 39
                        %N 8
                        %P 53-56
                        %R 10.5120/4844-7111
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

Cryptography is considered to be a disciple of science of achieving security by converting sensitive information to an un-interpretable form such that it cannot be interpreted by anyone except the transmitter and intended recipient. An innumerable set of cryptographic schemes persist in which each of it has its own affirmative and feeble characteristics. In this paper we have we have developed a traditional or character oriented Polyalphabetic cipher by using a simple algebraic equation. In this we made use of iteration process and introduced a key K0 obtained by permuting the elements of a given key seed value. This key strengthens the cipher and it does not allow the cipher to be broken by the known plain text attack. The cryptanalysis performed clearly indicates that the cipher is a strong one.

References
  • Bement A. L. et. al. (2004), Standards for Security Categorization of Federal Information and Information Systems, Computer Security Division, Information Technology Laboratory, National Institute of Standards and Technology Gaithersburg, MD 20899-8900.
  • Ayushi, (2010), A Symmetric Key Cryptographic Algorithm, International Journal of Computer Applications (0975 - 8887) Volume 1. No. 15.
  • Atul Kahate, (2008) Cryptography and Network Security, Tata McGraw-Hill Education, pg. 47.
  • Ijaz Ali Shoukat , Kamalrulnizam Abu Bakar and Mohsin Iftikhar, “A Survey about the Latest Trends and Research Issues of Cryptographic Elements”, p 141, International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 2, May 2011, ISSN 1694 0814.
  • Sukalyan Som, Saikat Ghosh, “A Survey of Traditional or Character Oriented Symmetric Key Cryptography”, International Journal of Advanced Research in Computer Science, Vol. 2, No. 4, July-August 2011
  • R. Venkateswaran, Dr. V. Sundaram, “Information Security: Text Encryption and Decryption with Poly Substitution Method and Combining the Features of Cryptography”, p28-30, International Journal of Computer Applications, Vol. 3, No. 7, June 2010.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Polyalphabetic substitution variable length key stream bit-ratio test frequency test

Powered by PhDFocusTM