A Neoteric Strategy of Hill Cipher for Analysis of Degenerate Matrices Key

Abstract

The Hill cipher is the principal tester encryption which has certain benefits in secure key encryption. Still, it is unresisting to recognized readable text spasms. An alternative setback is that an unavoidable key matrix is required for decryption and it is not seemly for encrypting a plaintext comprising of nil. The objective of this work is to amend the present Hill cipher to overwhelm these problems. Analysis of earlier outcomes showed that the prevailing Hill algorithms are not yet satisfactory. Specific of these algorithms are quite vulnerable to recognized plaintext. On the added, specific of these algorithms have enhanced alteration attributes and as a result, they are more resistant compared to recognized plaintext attacks.

However, these improved Hill cipher algorithms have the degenerate matrices key problem. Additionally, these algorithms are not suitable for entirely zeroes readable block encryption. In this paper, a Neoteric Strategy of Hill Cipher is proposed which applies to the invertible key matrix. Exploration of the projected algorithm is carried out via non-invertible key matrix approaches that are comparative different to understand. Preceding exploration focused on hill cipher using symmetric/asymmetric key algorithm. When the user encodes the plain text message using the hill cipher technique then the user can do, but when a user decodes the ciphertext message then some vulnerability arises. This analysis put forward to usage the hill cipher act in qualitative approach in evaluating the different vulnerabilities as an inversion of key matrix. In this exploration, a user has no trouble identifying the inversion of the key matrix when a key matrix is invertible for decryption. In previous work, there is a crisis to generate the inverse key matrix when the matrix is non-invertible because when the matrix is non-invertible means it's determinative is zero and in hill cipher determinative shows a vital role in decode. Then when it is zero then how a user can decrypt the message.