Data Encryption and Decryption by Using Hill Cipher Algorithm

Mebratu Fana Bedasa


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 2020

Full Text: PDF
Download the IISTE publication guideline!

To list your conference here. Please contact the administrator of this platform.

Paper submission email:

ISSN (Paper)2224-5774 ISSN (Online)2225-0492

Please add our address "" into your email contact list.

This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.

Copyright ©