9 results for “V. U.K.. Sastry”

Research ArticleOpen accessIn the author namesBlock 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 accessIn the author namesModified 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 accessIn the author namesModified 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 author namesModified Hill Cipher with Key Dependent Permutation and Circular RotationV.U.K. Sastry, V. JanakiIn this study, we have modified the Hill cipher, by including a permutation and circular rotation into the cipher. Here both the permutation and the rotation depend upon the key. From the cryptanalysis and the avalanche effect, discussed in this study, we notice that the strength of the cipher is significant. …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,518 accessesView PDF Cite

Research ArticleOpen accessIn the author namesA 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

Research ArticleOpen accessIn the author namesA Large Block Cipher Using Modular Arithmetic Inverse of a Key Matrix and Mixing of the Key Matrix and the PlaintextV. U.K. Sastry, S. Udaya Kumar, A. Vinaya babuIn this paper, we have developed a block cipher by applying an iterative method. In the process of encryption, we have used a key matrix (K) in which all the elements are binary bits. In the process of decryption, we have utilized the modular arithmetic inverse (K-1). In the process of encryption, the elements of the plaintext and the elements … …Journal of Computer Science, Vol. 2, Issue 9 · 30 Sep 2006 · 6,796 accessesView PDF Cite