Data folding: A new data soft destruction algorithm

Along with the continuous renewal and upgrade of the network storage system, the user has higher and higher demands for the secure and efficient data soft destruction. However, existing methods of data soft destruction usually bring too much destruction overheads. Even more, they are easy to recover, or not flexible enough. In order to achieve the target of destroying data effectively, we propose the algorithm of data folding to realize more efficient data soft destruction, which uses the sequences of data to overwrite itself. The specific steps of the algorithm of data folding includes the data position, the data writing, the data relocation, the data reposition, and the data rewriting. Experiments show that the algorithm of data folding is superior to the existing approaches of data soft destruction based on the idea of data overwriting in terms of the time cost, the difficulty of recovery and the flexibility.