Dynamic File Deletion Algorithm for Irreversible Data Erasure
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for deleting files do not reliably prevent data restoration, as they either simplify the analysis process for restoration utilities or fail to wipe free space on data storage devices, leaving deleted files accessible to hackers.
Innovation Solution
A method and system that dynamically form a deletion algorithm to overwrite files and free space on data storage devices with a structured pattern, simulating the presence of files to confuse restoration utilities and ensure irreversible deletion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If ordinary deletion method is used to mark files as deleted, then file system speed is improved, but files can be restored by specialized utilities
Solution Approach 1:
The system performs preliminary actions by analyzing the file system structure and deletion patterns before actual deletion occurs. It pre-calculates the optimal deletion strategy, identifies all recoverable file locations, and prepares the sequence of operations needed to permanently eliminate restoration possibilities while maintaining efficient file system performance.
Solution Approach 2:
The deletion method dynamically adapts to different file system types (NTFS, FAT32, exFAT) and deletion scenarios. The system adjusts its analysis and deletion strategy in real-time based on the specific file system structure, file types, and deletion patterns encountered, rather than using a static deletion approach.
2Reliability
If repeated deletion with mashing is performed to prevent restoration, then deletion reliability is improved, but deletion time increases significantly
Solution Approach 1:
The system applies partial mashing operations selectively rather than performing complete repeated deletions on all files. It identifies critical file regions that need mashing to prevent restoration while leaving other regions untouched, thereby achieving sufficient deletion reliability with reduced time expenditure.
Solution Approach 2:
The deletion method dynamically changes operational parameters such as mashing intensity, number of passes, and affected regions based on file characteristics and security requirements. This allows the system to achieve effective deletion with optimized time consumption by adjusting parameters rather than applying fixed repeated deletion procedures.
3Duration of action of stationary object
If free space is not wiped during deletion, then device resource lifetime is extended, but deleted files remain accessible to hackers
Solution Approach 1:
The system extracts and processes only the specific regions containing deleted file data rather than wiping the entire free space. It identifies and targets only the necessary sectors and clusters where deleted files may be recovered, leaving the rest of the free space intact to minimize wear on the storage device while still preventing data restoration.
Data Source
AI summary
Disclosed herein are systems and methods for deleting files. In one aspect, an exemplary method comprises, obtaining at least initial data about a file to be deleted in accordance with an instruction to remove the file from a data storage device, analyzing the file to be deleted and the data storage device to determine at least deletion parameters of the file to be deleted, performing a dynamic formation of a deletion algorithm, wherein the formation further includes the formation of a structure for writing and a determination of a location for the writing during the deletion of the file in accordance with the determined deletion parameters and rules of formation, and deleting the file by applying the deletion algorithm.