Abstract
Hill ciphering can be adapted to produce a coherent ciphertext message for any given plaintext message. This is done by finding a matrix Q that will transform using modular arithmetic, for example, ‘cat’ into ‘dog,’ and ‘dog’ back into ‘cat’. The procedure for choosing the elements of Q involves solving sets of linear Diophantine equations. The existence of Q for any (x, y) pair of plaintext/ciphertext messages is guaranteed as long as the conditions for application of Cramer's Rule are satisfied by the Diophantine equations. The interest of Belkoranic Hill Ciphering lies in its innocent-looking coherent ciphertext.
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.
