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 PDFCite
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 PDFCite
Research ArticleOpen accessEvery word in the titleModified 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 PDFCite
Research ArticleOpen accessEvery word in the titleA 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 PDFCite
Research ArticleOpen accessIn the keywordsNew Algorithm for Digital Video EncryptionSamsul Arifin, Wihikanwijna, Tuga Mauritsus et al.This research aims to propose a safe digital video data alternative employing symmetric cryptography and an encryption technique using Partition. The Hill Cipher method requires a square key matrix with an inverse modulo the unimodular matrix is one of the unique matrices with an inverse. The encryption mechanism is modulo matrix multiplication, with shift cipher encryption employed to encrypt defective … …Journal of Computer Science, Vol. 19, Issue 7 · 19 Jun 2023 · 6,395 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMDS Algorithm for EncryptionMani Arora, Derick Engles, Sandeep SharmaMost of the encryption algorithms used today generates huge cipher messages as well as long encryption keys. These approaches require time and are computationally intensive .While sending data packets through the network a compression technique along with cryptography can be applied to reduce the data packet size for better bandwidth utilization and hence faster transmission of data. In this study … …Journal of Computer Science, Vol. 11, Issue 3 · 3 Apr 2015 · 7,295 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMessage Based Random Variable Length Key Encryption AlgorithmHamid Mirvaziri, Kasmiran Jumari Mahamod Ismail, Zurina Mohd HanapiProblem statement: A block ciphers provides confidentiality in cryptography but cryptanalysis of the classical block ciphers demonstrated some old weaknesses grabbing a partial key in any stage of encryption procedure leads to reconstructing the whole key. Exhaustive key search shows that key generation should be indeterminist and random for each round. Matching cipher-text attack shows that larger size of block … …Journal of Computer Science, Vol. 5, Issue 8 · 31 Aug 2009 · 6,804 accessesView PDFCite
Research ArticleOpen accessIn the keywordsThe New Variable-Length Key Symmetric CryptosystemDavood Rezaei Pour, Mohamad Rushdan Md Said, Kamel Ariffin Mohd Atan, Mohamed OthmanProblem statement: In this study, we proposed a new 64-bit block cipher that accepted a variable-length key up to 512 bits, which was suitable for implementation in a variety of environments. Approach: The cipher algorithm was a 16-round Feistel network with a bijective function f and was made up of two key-dependent 16×16 S-boxes, bitwise rotations, and a carefully designed … …Journal of Mathematics and Statistics, Vol. 5, Issue 1 · 31 Mar 2009 · 7,213 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Key Dependent Encryption Algorithm Based on Multiple Bitwise-Shuffling and XOR Variable-Length PartitionsAbdelfatah Aref TamimiThis new algorithm employs shuffling procedures combined with variable-length key-dependent XOR and S-box substitutions to perform lossless image encryption. This algorithm was implemented and tested by performing different permutations of shuffling, XOR encryption and S-box substitution. Empirical analysis using different types of test images of different sizes showed that this new algorithm is effective and resistant to statistical attacks. The … …Journal of Computer Science, Vol. 12, Issue 2 · 26 Mar 2016 · 7,679 accessesView PDFCite