Randomized Approach for Block Cipher Encryption

  • Srinivasan Nagaraj
  • D. S. V. P. Raju
  • Kishore Bhamidipati
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 199)

Abstract

In cryptography, a substitution block cipher is a method of encryption by which units of plain text are replaced with cipher text according to a regular system. The receiver deciphers the text by performing an inverse substitution. If the cipher operates on single blocks, it is termed as simple substitution block cipher. The proposed method that considers a random matrix which is chosen from the length of the given input text. Here the input text is stored in the matrices which are selected with minimum cost. There on the series of operations are performed and cipher text is produced, in decryption inverse matrix is calculated and the operations are performed in order to generate the plain text. As we are using random matrix and then the inverse matrix calculation is performed which adds more security for cracking the key. Thus, the cipher text obtained is very difficult to be broken without knowing the key, which provides high security.

Keywords

key length random matrix minimum cost encryption decryption 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Introduction to Cryptography–Ranjan Bose. Tata Mc-Grew–Hill Publisher Ltd. (2001)Google Scholar
  2. 2.
    Koblitz, N.: A course in number theory and Cryptography. Springer-Verlag, New York, Inc. (1994)Google Scholar
  3. 3.
    Nalani, N., Raghavendra Rao, G.: Cryptanalysis of Simplified Data Encryption Standard via Optimisation Heuristics. IJCSNS 6(1B) (January 2006)Google Scholar
  4. 4.
    Simmons, S.: Algebric Crypto analysis of Simplified AES. Proquest Science Journals 33(4), 305 (2009)MATHMathSciNetGoogle Scholar
  5. 5.
    Ravi, S., Knight, K.: Attacking Letter Substitution Ciphers with Integer Programming. Proquest Science Journals 33(4), 321 (2009)MATHGoogle Scholar
  6. 6.
    Kumar, A., Kumar, A.: Development of New Cryptographic Construct using Palmprint Based Fuzzyvoult. EURASIP Journal on Adv. In Signal Processing 21, 234–238 (2009)Google Scholar
  7. 7.
    Wang, B., Wu, Q., Hu, Y.: A Knapsack Based Probabilistic Encryption Scheme (March 2007), http://www.citeseer.ist.psu.edu
  8. 8.
    Bluekrypt 2009: Cryptographic Key length RecommendationsGoogle Scholar
  9. 9.
    Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo random number generator. SIAM J. Compute. 15(2), 364–383 (1986)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Brics: Universally comparable notions of key exchange and secure channels. LNCS. Springer, Berlin (March 2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Srinivasan Nagaraj
    • 1
  • D. S. V. P. Raju
    • 2
  • Kishore Bhamidipati
    • 3
  1. 1.Dept. of CSEGMRITRajamIndia
  2. 2.Andhra UniversityVisakhapatnamIndia
  3. 3.Dept. of CSEMITManipalIndia

Personalised recommendations