| Title | Encryption algorithm based on knight’s tour and n-neighbourhood addition |
| Publication Type | Conference Paper |
| Year of Publication | 2020 |
| Authors | Bisht, K., Deshmukh, M. |
| Conference Name | 2020 7th International Conference on Signal Processing and Integrated Networks (SPIN) |
| Date Published | feb |
| Keywords | composability, cover images, cryptography, cyber physical systems, digital images, efficient encryption, Encryption, encryption algorithm, image encryption, image processing, knight tour matrix, Knight's Tour Problem, Knight’s Tour Matrix, Knight’s Tour Problem (KTP), KT matrix, matrix algebra, Matrix converters, n-neighborhood addition, n-neighbourhood addition, Partitioning algorithms, pubcrawl, Resiliency, Signal processing, Signal processing algorithms |
| Abstract | This paper presents a new algorithm for image encryption by extending the Knight's Tour Problem (KTP). The idea behind the proposed algorithm is to generate a Knight Tour (KT) matrix (m,n) and then divide the image according to the size of knight tour matrix into several sub matrices. Finally, apply n-neighborhood addition modulo encryption algorithm according to the solution of KT matrix over each m x n partition of the image. The proposed algorithm provides image encryption without using the cover images. Results obtained from experiments have shown that the proposed algorithm is efficient, simple and does not disclose any information from encrypted image. |
| DOI | 10.1109/SPIN48934.2020.9071013 |
| Citation Key | bisht_encryption_2020 |
Encryption algorithm based on knight’s tour and n-neighbourhood addition