Research Article Open Access

Block Cipher Involving Key Based Random Interlacing and Key Based Random Decomposition

K. Anup Kumar1 and V. U.K. Sastry1
  • 1 , Afganistan
Journal of Computer Science
Volume 6 No. 2, 2010, 133-140

DOI: https://doi.org/10.3844/jcssp.2010.133.140

Submitted On: 16 November 2009 Published On: 28 February 2010

How to Cite: Kumar, K. A. & Sastry, V. U. (2010). Block Cipher Involving Key Based Random Interlacing and Key Based Random Decomposition. Journal of Computer Science, 6(2), 133-140. https://doi.org/10.3844/jcssp.2010.133.140

Abstract

Problem statement: The strength of the block ciphers depend on the degree of confusion and diffusion induced in the cipher. Most of the transformations used for this purpose are well known to every one and can be broken by a crypt analyzer. Therefore, in order to counter attack the crypt analyzer, there is a need for better transformations in addition to the existing one. Approach: We tried to use key based random interlacing and key based random decomposition for this purpose. So that, a crypt analyzer cannot understand how interlacing and decomposition is done in every round unless the key is known. Results: The strength of the cipher is assessed by avalanche effect which is proved to be satisfactory. Conclusion/Recommendations: Key based random interlacing and decomposition can be used for introducing confusion and diffusion in block ciphers. The cryptanalysis carried out in this regard shows that the cipher cannot be broken by any cryptanalytic attack.

  • 1,124 Views
  • 1,512 Downloads
  • 0 Citations

Download

Keywords

  • Encryption
  • decryption
  • key
  • random interlacing
  • random decomposition