4 articles for “interlacing”

Set a search alert

Research ArticleOpen accessEvery word in the titleBlock Cipher Involving Key Based Random Interlacing and Key Based Random DecompositionK. Anup Kumar, V. U.K. SastryProblem 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 … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,004 accessesView PDF Cite

Research ArticleOpen accessEvery word in the titleModified Hill Cipher for a Large Block of Plaintext with Interlacing and IterationV. U.K. Sastry, N. R. ShankarIn this research, we have developed a large block cipher by modifying the Hill cipher. In this, we have introduced interlacing of the binary bits of the plaintext as the primary concept leading to confusion. This process is strengthened by using iteration. The cryptanalysis and avalanche effect mentioned in this research clearly exhibit the strength of the cipher. …Journal of Computer Science, Vol. 4, Issue 1 · 31 Jan 2008 · 7,150 accessesView PDF Cite

Research ArticleOpen accessEvery word in the titleModified Hill Cipher with Interlacing and IterationV. U.K.. Sastry, N. Ravi ShankarIn this research, we have developed a block cipher by taking a large key matrix of size nxn and a plaintext matrix containing n rows and two columns. In this, the plaintext column vectors, perated by the key matrix are thoroughly interlaced at each stage of the iteration. As a typical example, we have taken the key in the form … …Journal of Computer Science, Vol. 3, Issue 11 · 30 Nov 2007 · 7,353 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Block Cipher Using Linear CongruencesV. U.K. Sastry, V. JanakiWe have developed a block cipher by using modular arithmetic inverse and linear congruences. The cipher contains a key matrix called the outer key. It also includes another key, which contains a set of constants involved in the linear congruences. This key is called as inner key. The cryptanalysis carried out in this paper indicates that the cipher cannot be … …Journal of Computer Science, Vol. 3, Issue 7 · 31 Jul 2007 · 7,013 accessesView PDF Cite