Answers are grounded in this paper and cite their sources.
In this paper an efficient and secure approach has been proposed for the image data. It includes the combination of kmeans based and RC6 based encryption and decryption mechanism. K-means provides proper data aggregation with the coverage of highest adjacent pixels with the edges in the similar group. K-means has been applied on the array based data on the adjacent pixel values for the aggregation with the edges. It is calculated based on the similarity score based on the distance algorithms. It provides the grouping and correlates the cluster groups with the adjacent pixels. The output value of the k-means approach will then applied to the RC6 for the encryption process. RC6 algorithm has been applied on the cluster group for the efficient encryption with the bitwise shuffling and XOR mechanism repetition. The results indicate in terms of time that our approach provides the cryptography process in better way.
No takes yet. Share an insight, caveat, or question.
Patil et al. (2019) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: