IDEAS home Printed from https://ideas.repec.org/a/icf/icfjcs/v7y2013i4p30-38.html
   My bibliography  Save this article

BaseTen Cryptographic Algorithm Based on Playfair Cipher

Author

Listed:
  • Sombir Singh
  • Arvind Kumar

Abstract

Security plays a crucial role in the field of network communication systems. Strong algorithms of variable type key, and applicable to small as well as large messages are required to provide proper security to the communication system. In this paper, the proposed algorithm is of variable type key and is applicable to small as well as large messages. The basic structure is similar to that of Playfair cipher, but the working of the proposed algorithm is completely different. The Playfair key is fixed which has a 5 x 5 matrix and the key length is 25 characters only. But in the BaseTen cryptographic algorithm, the key is 10 x 10 matrix with a key length of n characters. The algorithm can be used for encryption or decryption of messages of different size. The size of the key is not defined in the BaseTen algorithm because the size depends on the system where the algorithm is implemented. The proposed work is called BaseTen because the algorithm is assigned a decimal number which has base 10.

Suggested Citation

  • Sombir Singh & Arvind Kumar, 2013. "BaseTen Cryptographic Algorithm Based on Playfair Cipher," The IUP Journal of Computer Sciences, IUP Publications, vol. 0(4), pages 30-38, October.
    • Handle: RePEc:icf:icfjcs:v:7:y:2013:i:4:p:30-38
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:icf:icfjcs:v:7:y:2013:i:4:p:30-38. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: G R K Murty (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.