Data Encryption and Decryption by Using Hill Cipher Algorithm

The core of Hill-cipher is matrix manipulations. It is a multi-letter cipher, for decryption the inverse of matrix requires and inverse of the matrix doesn’t always exist. Then if the matrix is not invertible then encrypted text cannot be decrypted. However, a drawback of this algorithm is overcome by use of self-repetitive matrix. This matrix if multiplied with itself for a given mod value (i.e. mod value of the matrix is taken after every multiplication) will eventually result in an identity matrix after N multiplications. So, after N+ 1 multiplication the matrix will repeat itself. Hence, it derives its name i.e. self-repetitive matrix. It should be non-singular square matrix. Key words: Hill Cipher Algorithm, Self-Repetitive Matrix and Inverse Matrix DOI: 10.7176/NCS/11-02 Publication date:July 31st 202

ON SUPER (3n+5,2)- EDGE ANTIMAGIC TOTAL LABELING AND IT’S APPLICATION TO CONSTRUCT HILL CHIPER ALGORITHM

Graph labeling can be implemented in solving problems for various fields of life.  One of the application of graph labelling is in security system. Information security is needed to reduce risk, data manipulation, and unauthorized destruction or destruction of information. Cryptographic algorithms that can be used to build security systems, one of the cryptographic algorithms is Hill Cipher. Hill chipper is a cryptographic algorithm that uses a matrix as a key to perform encryption, decryption, and modulo arithmetic. This study discusses the use of Super (3n+5,2)- edge antimagic total labeling to construct the Hill Chiper algorithm. The variation of the edge weight function and the corresponding edge label on the  graph, will make the constructed lock more complicated to hac

Data Encryption and Decryption by Using Hill Cipher Algorithm

The core of Hill-cipher is matrix manipulations. It is a multi-letter cipher, for decryption the inverse of matrix requires and inverse of the matrix doesn’t always exist. Then if the matrix is not invertible then encrypted text cannot be decrypted. However, a drawback of this algorithm is overcome by use of self-repetitive matrix. This matrix if multiplied with itself for a given mod value (i.e. mod value of the matrix is taken after every multiplication) will eventually result in an identity matrix after N multiplications. So, after N+ 1 multiplication the matrix will repeat itself. Hence, it derives its name i.e. self-repetitive matrix. It should be non-singular square matrix. Keywords: Hill Cipher Algorithm, Self-Repetitive Matrix and Inverse Matrix DOI: 10.7176/CTI/10-01 Publication date:July 31st 202

A Realizable Quantum Three-Pass Protocol Authentication Based on Hill-Cipher Algorithm

A realizable quantum three-pass protocol authentication based on Hill-cipher algorithm is presented by encoded and decoded plaintext using classical Hill-cipher algorithm. It is shown that the encoded message transferred to the particles called quantum state where we assumed that a photon is used as a qubit and after the encoded message is transferred into photons, the polarization of each photon is rotated by an angle θj, which is chosen randomly for each qubit. The sender and receiver agree over a Hill-cipher key, the encryption occurs by utilization of the quantum three-pass protocol (QTPP), the decryption will be illustrated, and an example shows how the algorithm will work. Finally, the security of this algorithm is analyzed in detail

AI-Driven Innovations in Cryptography: Enhancing Key Generation and Security

In this paper, we introduce a novel approach for securing confidential data through a symmetric key cryptographic algorithm called the modified Hill Cipher by utilizing rhotrices. We provide a step-by-step procedure to implement this method and elucidate the process through an example. The modified Hill Cipher technique uses AI to generate key rhotrix and incorporates the use of rhotrices and rhotrix algebra to encrypt plain text and decrypt cipher text

Healing the Hill Cipher, Improved Approach to Secure Modified Hill against Zero-plaintext Attack

Hill Cipher is a symmetric cryptosystem that was claimed to suffer from known-plaintext attack for many years. Different methods have been proposed to make this cipher more secure against known attacks. The introduced classic Hill cipher by Tourani and Falahati in 2011 that was devised in two variants and based upon affine transformation, was considered to be more secure against known attacks. Recently, this well modified Hill cipher is claimed to be vulnerable to zero-plaintext attack. In this paper, by using a chaotic map and scrambling methods, a novel cryptosystem based on Tourani and Falahati Hill cipher is presented which overcomes the zero-plaintext attack. The proposed Hill cipher is more reliable and faster

Secured Data Transmission Using Mod-ified LEHS Algorithm in Wireless Sensor Network

Abstract In the ancient block Hill cipher, the cipher text is obtained by multiplying the blocks of the plain text with the key matrix. To strengthen the keymatrix, a double guard Hill cipher was proposed with two key matrices, a private key matrix and its modified key matrix along with permutation. In the ancient block Hill cipher, the cipher text is obtained by multiplying the blocks of the plain text with the key matrix. To strengthen the key matrix, a double guard Hill cipher was proposed with two key matrices, a private key matrix and its modified key matrix along with permutation. In this paper a novel modification is performed to the double guard Hill cipher in order to reduce the number of calculation to obtain the cipher text by using non-square matrices. This modified double guard Hill cipher uses a non-square matrix of order (p × q) as its private keymatrix