Abstract
The Hill Cipher, also known as matrix encryption, uses matrices to encipher and decipher text. Various attacks, such as those found by Jack Levine [235], have been published for this system. This article reviews a few previous results and presents a powerful new attack in which the rows of the matrix can be determined independent of one another, greatly reducing the amount of time needed for decipherment.
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 callSimilar Papers
Disclaimer: 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.
