Abstract
Hill Cipher cryptographic algorithm is a technique of massage encoding by implementing a matrix of order n*n as a key matrix. The key matrix is a matrix that has a multiplicative inverse. The security of messages measured by the number of processes in encoding. More and more processes in the encoding will lead to the longer time required. So that the massage will be safer. The purpose of this research is to modify the Hill Cipher cryptographic algorithm by using the matrix of Fibonacci numbers generalization whose degree-p and rank-n Qn,p. The Matrix Qn,p is a matrix of order(p+1)*(p+1) and it will be the key matrix in the Hill Cipher cryptographic algorithm.This research showed that any matrix of Fibonacci number generalization Qn,p with p and n are positive integers that be used as a key matrix in the Hill Cipher algorithm. The modification of the Hill Cipher cryptographic algorithm has done with modifying the keys by making the degree (p) and rank (n) of Qn,p as the keys that used in the encryption and decryption process of data (message).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.