Dynamic File Deletion Algorithm Selection for Secure Data Erasure
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing file deletion methods do not provide a dynamic selection of data erasing algorithms based on file parameters and user criteria, leading to potential data recovery and lack of centralized control, especially in mobile storage devices.
Innovation Solution
A system for permanent data deletion that dynamically forms deletion algorithms based on file parameters such as extension, size, location, and user-defined criteria, using a database of rules and an algorithm forming unit to select and execute appropriate operations for secure file erasure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If standard OS deletion methods are used, then files become invisible and space is freed, but data remains on storage and can be recovered by special utilities
Solution Approach 1:
The system dynamically selects deletion algorithms based on file parameters (extension, size, location) and user criteria, adapting the deletion approach rather than using a fixed method. This allows optimization between speed and security for each specific file
Solution Approach 2:
The system changes parameters such as number of overwriting passes, type of overwriting data (zeros, random bytes), and deletion methodology based on file characteristics and security requirements, transforming a static deletion process into a variable one
2Reliability
If multi-pass erasing algorithms are used, then data restoration probability decreases, but deletion time increases
Solution Approach 1:
The system varies the number of overwriting passes and type of overwriting data based on file parameters and user-defined criteria, allowing flexible adjustment between security and speed requirements for different files
Solution Approach 2:
The deletion algorithm is dynamically formed and selected based on real-time analysis of file characteristics, enabling the system to adapt the intensity and duration of deletion operations to match actual security needs
3Ease of operation
If a fixed deletion algorithm is used for all files, then the system is simple to operate, but it cannot adapt to different file types and security requirements
Solution Approach 1:
The system automatically analyzes file parameters and selects appropriate deletion algorithms without requiring user intervention, making the complex adaptive system as easy to use as a simple one while providing intelligent adaptation
Solution Approach 2:
The system dynamically forms deletion algorithms based on file characteristics and user criteria, automatically adapting to different file types and security requirements without manual configuration
4Reliability
If centralized control is implemented, then deletion policy compliance is improved, but system complexity increases
Solution Approach 1:
The system provides centralized control with feedback mechanisms that monitor and enforce deletion policies across the network, ensuring compliance while managing complexity through automated policy application
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A system for permanent data deletion is provided. The file deletion system consists of a permanent deletion unit, an analysis module, a database of rules for forming deletion algorithm and an algorithm forming unit. A file to be deleted is passed into the system and the system permanently deletes the file. The system dynamically forms the deletion algorithm based on algorithm forming rules. The rules are selected from the database according to file parameters and user criteria. The file parameters are determined by the analysis module. A user has an access to algorithm forming rules and can edit the rules. Algorithm forming rules can be based on an arbitrary number of complex conditions.