Novel Algorithm for Secure File Transfer using File Segmentation via Modified K-Means

In the current scenario The Security is most or of at most importance when talking about file transferring in networks. In the thesis, the work has design a new innovative algorithm to securely transfer the data over network. The k - means clustering algorithm, introduced by MacQueen in 1967 is a broadly utilized plan to solve the clustering problem. It classifies a given arrangement of n-information focuses in m-dimensional space into k-clusters whose focuses are gotten by the centroids. The issue with the privacy consideration has been examined, and that is the data is distributed among various gatherings and the disseminated information is to be safeguarded. In this thesis, created chucks or parts of file using the K-Means Clustering Algorithm aims to partition n observations into K clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of a cluster and the individual part is encrypted using the key which is shared between sender and receiver. Further, the bunched records have been encoded by utilizing AES encryption algorithm with the introduction of private key concept covertly shared between the involved parties which gives a superior security state. The term "clustering" is used in several research communities to describe methods for grouping of unlabeled data. These communities have different terminologies and assumptions for the components of the clustering process and the context in which clustering is used.