Abstract
Secured communication of text information is prime importance across the globe. Cryptography is one of the methods to attain security. The Hill cipher is a symmetric encryption algorithm vulnerable to the attack of knownplaintext. This paper proposes a modification to the Hill cipher. In the proposed cryptosystem, a prime circulant matrix is shared as a secret key and a non-singular matrix G is used as a public key such that the determinant of coefficient matrix Gc is zero. Which generates infinite solutions. This makes difficulty to find secret key matrix.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
