Method and system for immediately eliminating dynamically encrypted mobile storage information

Abstract

The invention belongs to the technical field of information security, and particularly relates to a dynamic encryption mobile storage information instant elimination method and system. Firstly, a processing node is dynamically selected by adopting a security level based on a processing token, so that the security and pertinence of a data processing process are ensured; and secondly, the data is accurately positioned by using a nonlinear dynamic hash algorithm, so that the accuracy of data processing is improved, and the data security is enhanced as the difficulty of prediction and recovery is increased by the hash algorithm. And furthermore, the encrypted data is managed through the asynchronous processing queue, so that the continuity and the high efficiency of data processing are ensured. And finally, the master control node integrates processing results according to an optimization algorithm, and formulates an efficient data deletion sequence, so that efficient and safe data immediate deletion is realized. On the whole, through technical innovation, the speed and accuracy of data processing are improved while the high safety standard is guaranteed, and the risk of data leakage is effectively prevented.

Description

Technical Field

[0001] The present invention belongs to the technical field of information security, and particularly relates to a method and system for instantaneously eliminating dynamically encrypted mobile storage information. Background Art

[0002] In today's rapidly developing information technology era, data security and privacy protection have become extremely concerned issues for the public and enterprises. With the popularization of big data and cloud computing technologies, more and more sensitive information is stored on various mobile storage devices and remote servers. The security of these storage media is directly related to the protection of personal privacy and corporate secrets. Therefore, how to securely and efficiently delete sensitive data stored on these devices to prevent data leakage is an important challenge in the field of data security.

[0003] Traditional data deletion methods usually include physical destruction, formatting the storage medium, or using standard data erasure software. However, these methods often cannot completely delete the data, or the deletion process lacks flexibility and security. Physical destruction is thorough but is not environmentally friendly and is costly. Formatting and using erasure software cannot guarantee that the data is completely irrecoverable, especially in the face of advanced data recovery technologies.

[0004] In addition, with the development of encryption technologies, dynamic encryption has become an effective means of protecting data security. However, traditional encryption methods still face many limitations and challenges when performing deletion operations, such as key management during the encryption process, inaccurate data positioning, and low efficiency in deleting encrypted data. Summary of the Invention

[0005] (1) Technical Problems to be Solved

[0006] The present invention mainly aims at the above problems and proposes a method and system for instantaneously eliminating dynamically encrypted mobile storage information. The purpose is to solve the technical problems of insufficient data security and low deletion efficiency in traditional data deletion methods. By introducing dynamic encryption and instant elimination technologies, efficient and secure management and deletion of sensitive information in mobile storage devices are achieved.

[0007] (2) Technical Solutions

[0008] To achieve the above object, the first aspect of the present invention provides a method for instantaneously eliminating dynamically encrypted mobile storage information, including the following steps:

[0009] After receiving a deletion instruction, add it to a processing queue;

[0010] Extract the deletion instruction to be processed from the processing queue and generate a processing token related thereto;

[0011] Identify and select a group of processing nodes by using the security level corresponding to the processing token;

[0012] Distribute instructions with the processing token to the selected processing nodes, where each node is responsible for different parts of data processing;

[0013] Each processing node performs a data location operation according to the received token, and this operation locates the data based on a non-linear dynamic hashing algorithm;

[0014] The located data is encrypted by each node according to a predetermined security policy;

[0015] The encrypted data is returned to the master node again through an asynchronous processing queue;

[0016] The master node collects all the encrypted data and determines the final data deletion sequence according to an optimization algorithm;

[0017] Execute the data deletion operation, and update the status and record the log of the relevant nodes.

[0018] Furthermore, the generation steps of the processing token include:

[0019] Generate a unique identifier based on a time stamp according to the received deletion instruction;

[0020] Encrypt the unique identifier with a preset security key to generate a processing token;

[0021] Bind the processing token to the deletion instruction.

[0022] Furthermore, the non-linear dynamic hashing algorithm includes the following steps:

[0023] Initialize a basic hashing function;

[0024] Dynamically select a combination of one or more hashing functions according to the security level of the processing token to form a primary hashing result;

[0025] Combine the primary hashing result with a time stamp and a random number, and perform confusion in the hashing space through a non-linear function to generate a secondary hashing result;

[0026] Determine the specific location of the data and the processing node according to the secondary hashing result and the predefined data mapping rules;

[0027] Each processing node uses this secondary hashing result to locate the data part it is responsible for processing.

[0028] Furthermore, the data encryption processing steps include:

[0029] Determine the type and strength of the encryption algorithm using the security level parsed from the processing token;

[0030] Perform multiple rounds of encryption on the located data, with each round processed using a different key;

[0031] After the encryption is completed, send the digest information of the encrypted data back to the master node.

[0032] Furthermore, the data deletion operation steps include:

[0033] Determine the deletion priority of the data according to the processing result of the encrypted data;

[0034] Use the data erasure algorithm to process the high-priority data first;

[0035] After the data erasure is completed, reset the security of the processing node to clear all temporarily stored sensitive information.

[0036] Furthermore, before selecting a processing node, it further includes verifying the security certificate and historical processing records of each processing node.

[0037] Furthermore, the method further includes: performing real-time backups on the operations executed by each processing node, and reassigning tasks to other backup nodes when a node failure is detected.

[0038] Furthermore, the steps for defining and classifying the security level of the processing token include:

[0039] Conduct a preliminary assessment based on the sensitivity level of the data and the security of the storage environment, and classify the data into three security levels: low, medium, and high;

[0040] Define a set of security parameters for each security level, including but not limited to the complexity of the hash function, the strength of the encryption algorithm, the key length, and its lifecycle;

[0041] Allocate the received deletion instructions to the corresponding security levels according to the sensitivity of the data involved;

[0042] Based on the allocated security level, generate a unique identifier containing a timestamp, encrypt it with a preset security key, and form a processing token for this level.

[0043] Furthermore, the state update and logging steps include:

[0044] Automatically record logs before and after each processing node executes the data deletion operation. The logs include the deletion instruction reception time, processing start time, processing end time, data deletion time, and deletion result;

[0045] Encrypt the log content using an encryption algorithm with the same or higher security level as data deletion;

[0046] Set the retention time of the log, with the minimum retention time being no less than one year;

[0047] Log data is stored on a dedicated secure server. After the log retention period expires, use a predetermined data erasure algorithm to completely delete the log information;

[0048] Strictly control log access, allowing only authorized security personnel to access, and all access behaviors are also recorded in the log.

[0049] To achieve the above object, the second aspect of the present invention provides a dynamic encryption mobile storage information instant elimination system, including the following modules:

[0050] A deletion instruction receiving module, which is used to add the received deletion instruction to the processing queue after receiving it;

[0051] A processing token generation module, which is used to extract the deletion instruction to be processed from the processing queue and generate a processing token related to it;

[0052] A processing node selection module, which is used to identify and select a group of processing nodes by using the security level corresponding to the processing token;

[0053] An instruction distribution module, which is used to distribute the instruction with the processing token to the selected processing nodes, where each node is responsible for different parts of the data processing;

[0054] A data location module, and each processing node performs a data location operation according to the received token, and this operation locates the data based on a non-linear dynamic hashing algorithm;

[0055] A data encryption processing module, and each processing node encrypts the located data according to a predetermined security policy;

[0056] An asynchronous processing queue module, which returns the encrypted data to the main control node again through the asynchronous processing queue;

[0057] A data collection and optimization module, and the main control node collects all the encrypted data and determines the final data deletion sequence according to the optimization algorithm;

[0058] A data deletion execution module, which executes the data deletion operation and updates the status and records the log of the relevant nodes;

[0059] The processing token generation module includes:

[0060] A timestamp generator, which is used to generate a unique identifier based on the timestamp according to the received deletion instruction;

[0061] An encryption module that encrypts the unique identifier with a preset security key to generate a processing token;

[0062] A binding module that binds the processing token to the deletion instruction.

[0063] (III) Beneficial effects

[0064] Compared with the prior art, a method and system for instant elimination of dynamically encrypted mobile storage information provided by the present invention significantly improve the security and efficiency of data deletion by integrating a dynamic hashing algorithm and a distributed processing node strategy. First, processing nodes are dynamically selected based on the security level of the processing token to ensure the security and pertinence of the data processing process. Second, a non-linear dynamic hashing algorithm is used to accurately locate the data, which not only improves the accuracy of data processing but also enhances data security because this hashing algorithm increases the difficulty of prediction and recovery. Third, the encrypted data is managed through an asynchronous processing queue to ensure the continuity and efficiency of data processing. Finally, the master control node integrates the processing results according to the optimization algorithm and formulates an efficient data deletion sequence, thereby realizing efficient and secure instant data deletion. Overall, through technological innovation, the present invention achieves the improvement of the speed and accuracy of data processing while ensuring high security standards, effectively preventing the risk of data leakage. Description of the drawings

[0065] Figure 1 It is a flowchart of a method for instant elimination of dynamically encrypted mobile storage information disclosed in the present application.

[0066] Figure 2 It is a process diagram of generating a processing token disclosed in the present application.

[0067] Figure 3 It is a diagram of a non-linear dynamic hashing algorithm disclosed in the present application.

[0068] Figure 4 It is a flowchart of data encryption processing disclosed in the present application.

[0069] Figure 5 It is a diagram of the operation steps of data deletion disclosed in the present application.

[0070] Figure 6 It is a flowchart of log recording and status update disclosed in the present application.

[0071] Figure 7 It is an architecture diagram of a system for instant elimination of dynamically encrypted mobile storage information disclosed in the present application. Detailed implementation manners

[0072] The present invention will be described in detail below in conjunction with the accompanying drawings. The technical solutions in the embodiments of the present invention will be clearly and completely described. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0073] As Figure 1 shown, the present invention provides a method for instantaneously eliminating dynamically encrypted mobile storage information, and the method includes the following steps:

[0074] Step S1: After receiving a deletion instruction, add it to a processing queue;

[0075] The deletion instruction can be issued by a user, a system administrator, or an automated program, aiming to securely delete specific data in a storage device. After receiving the deletion instruction, the system adds it to a processing queue to process each deletion request in turn, ensuring that the data deletion operation is orderly and managed according to priorities.

[0076] Step S2: Extract the deletion instruction to be processed from the processing queue and generate a processing token related thereto;

[0077] The processing token is a unique identifier based on a timestamp and is generated by encrypting with a preset security key to ensure its uniqueness and security. The processing token is bound to the deletion instruction and is used for subsequent data processing and encryption operations, thereby ensuring the security and accuracy of the deletion process.

[0078] Step S3: Use the security level corresponding to the processing token to identify and select a group of processing nodes;

[0079] It can be understood that a "processing node" refers to an independent computing unit or server in the system responsible for executing data processing tasks. According to the security level corresponding to the processing token, the system identifies and selects a suitable group of processing nodes, and these nodes will share and execute tasks such as data location and encryption. Each processing node has specific processing capabilities and security certifications.

[0080] Step S4: Distribute the instruction with the processing token to the selected processing nodes, where each node is responsible for different parts of the data processing;

[0081] The data to be processed is divided into several parts and these parts are assigned to different processing nodes. Each node independently processes its own responsible data segment, enhancing data security; because each node only processes a part of the data, no single node can access or recover the complete data, thus effectively preventing data leakage.

[0082] Step S5: Each processing node performs a data location operation based on the received token, which locates data based on a non-linear dynamic hashing algorithm;

[0083] Each processing node receives a token, which is like a key used to find the data to be processed. The node uses a non-linear dynamic hashing algorithm. This algorithm doesn't directly tell you where the data is, but calculates the location of the data through computation. In this way, even if someone peeks at this algorithm, it's very difficult to know the exact location of the data. Each node finds the location of the data it is responsible for in this manner, preparing for subsequent encryption processing.

[0084] Step S6: The located data is encrypted by each node according to a predetermined security policy;

[0085] Step S7: The encrypted data is returned to the master node through the asynchronous processing queue again;

[0086] The "asynchronous processing queue" is a queue used to temporarily store the encrypted data. It allows each processing node to independently and simultaneously return the encrypted data without waiting for the processing of other nodes to complete; the "master node" is the central control unit responsible for managing the entire process. It collects all the encrypted data from the asynchronous processing queue and coordinates subsequent data deletion and status update operations to ensure the efficiency and orderliness of the entire process.

[0087] For example: Suppose you have a folder to be deleted, which contains multiple files. You decide to let three processing nodes help you delete all the files in this folder. First, you tell the three processing nodes to be responsible for different parts of the folder respectively. The three processing nodes each find the files they need to process and encrypt these files. After encryption, the three processing nodes put the encrypted files into a shared box (the asynchronous processing queue). This box is special and allows each processing node to independently and simultaneously put the encrypted files into it without waiting for other processing nodes. As the team leader (the master node), you collect all the encrypted files from this shared box. After collecting all the files, you decide how to delete these files according to an optimization strategy (such as deleting the most sensitive files first) and record the deletion process and results of each file. In this way, even if one processing node is a bit slower, the entire deletion process can still proceed efficiently because other processing nodes don't need to wait for it to complete and can put the files they have processed into the shared box. And as the leader, the master node can monitor the entire process in real time to ensure that all files are finally deleted safely.

[0088] Step S8: The master node collects all the encrypted data and determines the final data deletion sequence according to the optimization algorithm;

[0089] Step S8: Perform a data deletion operation, and update the status and record the log of the relevant nodes.

[0090] As Figure 2 shown, in step S2, the steps for generating the processing token are as follows: First (step S20), create a unique identifier based on the timestamp according to the received deletion instruction, which ensures that each deletion request is unique; Next (step S21), encrypt this unique identifier with a preset security key to generate a processing token to enhance security and prevent tampering; Finally (step S22), bind the generated processing token to the original deletion instruction so that the corresponding deletion task can be identified and processed during subsequent processing.

[0091] In step S5, the non-linear dynamic hashing algorithm includes the following steps: First (step S50), initialize a basic hashing function; Then (step S51), dynamically select one or more combinations of hashing functions according to the security level of the processing token to generate a preliminary hashing result; Next (step S52), combine this preliminary result with the timestamp and a random number, and perform confusion through a non-linear function to produce a secondary hashing result; Subsequently (step S53), use the secondary hashing result and the predefined data mapping rules to determine the specific location of the data and the corresponding processing nodes; Finally (step S54), each processing node locates the data part it is responsible for processing according to the secondary hashing result. This process ensures the complexity and security of data location, and improves the accuracy and protection intensity of data processing.

[0092] As Figure 3 shown, the specific implementation steps of the non-linear dynamic hashing algorithm include:

[0093] (a) Initialize the basic hashing function as SHA-256;

[0094] (b) Dynamically select a combination of hashing functions according to the security level of the processing token. If the security level is low, use the combination of MD5 and SHA-256. If the security level is high, use the combination of SHA-256 and SHA-3-512;

[0095] (c) Combine the primary hashing result with the current timestamp and a random number generated by a cryptographically secure random number generator;

[0096] (d) Perform confusion through a non-linear function, and this non-linear function is the hyperbolic tangent function (tanh) to increase the degree of confusion in the hashing space;

[0097] (e) Determine the specific location and processing node of the data according to the secondary hash result and the predefined data mapping rules;

[0098] (f) Each processing node uses the secondary hash result to locate the data part it is responsible for processing, ensuring the security and privacy of the data are protected.

[0099] As Figure 4 shown, in step S6, the data encryption processing steps are as follows: First, determine the appropriate encryption algorithm and its strength according to the security level parsed from the processing token. Then, perform multiple rounds of encryption on the located data, using different keys for each round to increase the security of the data. After encryption, send the digest information of the encrypted data back to the master node so that the master node can track and manage these encrypted data.

[0100] For example, assume that the security level parsed from the processing token requires the use of the AES-256 encryption algorithm. The processing node first encrypts the data with one key for the first time, then encrypts it with a second key for the second time, and may also perform a third encryption, each time using a different key. Finally, after encryption is completed, the node generates the digest information (e.g., hash value) of the encrypted data and sends it back to the master node to confirm that the data has been properly encrypted and recorded.

[0101] As Figure 5 shown, in step S9, the data deletion operation steps are as follows: First (step S90), determine which data need to be deleted first according to the processing result of the encrypted data. Then (step S91), use the data erasure algorithm to first process those high-priority data to ensure that these data are completely deleted and cannot be recovered. Finally (step S92), after the data erasure is completed, perform a security reset on the processing node to clear all temporarily stored sensitive information to prevent any residual data from being maliciously recovered or exploited.

[0102] Preferably, the selected data erasure algorithms include, but are not limited to, the DoD 5220.22-M standard erasure, the Gutmann method, or the secure erasure technology based on the guidelines published by NIST, to ensure the complete destruction of the data.

[0103] Preferably, before selecting the processing node, it further includes verifying the security certificate and historical processing records of each processing node.

[0104] Preferably, the method further includes: performing real-time backups of the operations performed by each processing node, and when a node failure is detected, reassigning the tasks to other backup nodes.

[0105] The steps for defining and classifying the security levels of processing tokens are as follows: First, a preliminary assessment is conducted based on the sensitivity of the data and the security of the storage environment, and the data is divided into three security levels: low, medium, and high. Each security level defines a set of security parameters, which may include the complexity of the hash function, the strength of the encryption algorithm, the length of the encryption key, and its lifecycle, etc. After receiving a deletion instruction, based on the sensitivity of the data involved in the instruction, it is assigned to the corresponding security level. Then, based on this security level, a unique identifier containing a timestamp is generated and encrypted using a preset security key to form a processing token corresponding to that level.

[0106] As Figure 6 shown, the steps for status update and logging are as follows:

[0107] Before and after each processing node executes the data deletion operation, logs are automatically recorded. The log content includes the deletion instruction reception time, processing start time, processing end time, data deletion time, and deletion result, ensuring that each step of the operation is detailedly recorded. To ensure the security of the logs, the log content is encrypted using an encryption algorithm that is at least as equal or higher than the algorithm used during data deletion to prevent unauthorized access or tampering of the log information.

[0108] The retention time of the logs is also set to ensure that the logs are stored for at least one year for auditing and tracing when necessary. All log data is stored on a dedicated secure server, and only authorized security personnel can access these logs, and each access will be recorded, further enhancing the security and traceability of the logs.

[0109] After the log retention period expires, the log information is completely deleted using a predetermined data erasure algorithm to ensure that this information cannot be recovered or leaked. This complete set of processes ensures the transparency, security, and traceability of the data deletion operation.

[0110] To further demonstrate the superiority of a dynamic encryption mobile storage information instant elimination method provided by the present invention, the present invention also provides a dynamic encryption mobile storage information instant elimination system, as Figure 7 shown, the system includes:

[0111] A deletion instruction reception module, which is used to add the received deletion instruction to the processing queue after receiving it;

[0112] A processing token generation module, which is used to extract the deletion instruction to be processed from the processing queue and generate a processing token related to it;

[0113] A processing node selection module, which is used to identify and select a group of processing nodes by using the security level corresponding to the processing token;

[0114] An instruction distribution module for distributing instructions with processing tokens to selected processing nodes, where each node is responsible for different parts of data processing;

[0115] A data location module, where each processing node performs a data location operation according to the received token, and this operation locates data based on a non-linear dynamic hashing algorithm;

[0116] A data encryption processing module, where each processing node encrypts the located data according to a predetermined security policy;

[0117] An asynchronous processing queue module for returning the encrypted data to the master node again through the asynchronous processing queue;

[0118] A data collection and optimization module, where the master node collects all the encrypted data and determines the final data deletion sequence according to an optimization algorithm;

[0119] A data deletion execution module for performing the data deletion operation and updating the status and logging of relevant nodes;

[0120] The processing token generation module includes:

[0121] A timestamp generator for generating a unique identifier based on a timestamp according to the received deletion instruction;

[0122] An encryption module for encrypting the unique identifier with a preset security key to generate a processing token;

[0123] A binding module for binding the processing token to the deletion instruction.

[0124] In the description of the present invention, a large number of specific details are set forth. It will be understood, however, that embodiments of the present invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description. Similarly, it should be understood that, in order to streamline the disclosure of the present invention and assist in understanding one or more of the various inventive aspects, in the foregoing description of the exemplary embodiments of the present invention, the various features of the present invention are sometimes grouped together in a single embodiment, figure, or description thereof. However, the disclosed method should not be construed as reflecting an intention that the claimed invention requires more features than are expressly recited in each claim. Rather, as reflected by the claims, the inventive aspects lie in less than all the features of the single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into the detailed description, with each claim standing on its own as a separate embodiment of the present invention. It should be noted that, without conflict, the embodiments and features in the present application may be combined with each other. The present invention is not limited to any single aspect, nor to any single embodiment, nor to any arbitrary combination and / or permutation of these aspects and / or embodiments. Moreover, each aspect and / or embodiment of the present invention may be used alone or in combination with one or more other aspects and / or their embodiments.

[0125] The foregoing is only a preferred embodiment of the present invention, and it should be pointed out that for those of ordinary skill in the art, without departing from the technical principle of the present invention, several improvements and modifications can be made, and these improvements and modifications should also be regarded as the protection scope of the present invention.

Claims

1. A method for instant elimination of dynamically encrypted mobile storage information, characterized in that: The steps include: After receiving the deletion instruction, it is added to a processing queue; Extract the pending deletion instruction from the processing queue and generate a processing token associated therewith; Using the security level corresponding to the processing token, identifying and selecting a group of processing nodes; Distribute instructions with processing tokens to selected processing nodes, where each node is responsible for a different part of data processing; Each processing node performs a data location operation based on the received token, which locates the data based on a nonlinear dynamic hashing algorithm; The located data is encrypted by each node according to the predetermined security policy; The encrypted data is returned to the master node again through the asynchronous processing queue; The master node collects all encrypted data and determines the final data deletion sequence according to the optimization algorithm; Execute data deletion operations and update and log the status of related nodes.

2. A method for instant elimination of dynamically encrypted mobile storage information according to claim 1, characterized in that: The steps to process token generation include: Generate a timestamp-based unique identifier based on the received deletion instruction; Encrypt the unique identifier with a preset security key to generate a processing token; Bind a processing token to a delete instruction.

3. A method for instant elimination of dynamically encrypted mobile storage information according to claim 1, characterized in that: The nonlinear dynamic hashing algorithm comprises the following steps: Initialize a basic hash function; dynamically selecting a combination of one or more hash functions to form a primary hash result based on a security level of a processing token; Combine the primary hash result with a timestamp and a random number, and confuse them in the hash space through a non-linear function to generate a secondary hash result; Determine the specific location and processing node of the data based on the secondary hash result and predefined data mapping rules; Each processing node uses the secondary hash result to locate the portion of the data that it is responsible for processing.

4. A method for instant elimination of dynamically encrypted mobile storage information according to claim 1, characterized in that: The data encryption process steps include: Determine the type and strength of the encryption algorithm using the security level parsed from the processing token; Perform multiple rounds of encryption on the located data, using a different key for each round; After encryption is completed, the summary information of the encrypted data is sent back to the master node.

5. A method for instant elimination of dynamically encrypted mobile storage information according to claim 1, characterized in that: The steps to delete data include: Determine the data deletion priority based on the encrypted data processing result; Use data erasure algorithms to process high-priority data first; After the data wipe is complete, a security reset is performed on the processing node to clear all temporarily stored sensitive information.

6. A method for instant elimination of dynamically encrypted mobile storage information according to claim 1, characterized in that: Before selecting a processing node, it further includes verifying the security certificate and historical processing record of each processing node.

7. A method for instant elimination of dynamically encrypted mobile storage information according to claim 1, characterized in that: The method also includes backing up the operations performed by each processing node in real time and reallocating tasks to other backup nodes when a node failure is detected.

8. A method for instant elimination of dynamically encrypted mobile storage information according to claim 1, characterized in that: The steps to define and classify the security levels of processing tokens include: Conduct a preliminary assessment based on the sensitivity of the data and the security of the storage environment, and classify the data into three security levels: low, medium, and high. A set of security parameters is defined for each security level, including but not limited to the complexity of the hash function, the strength of the encryption algorithm, the key length and its life cycle; Assigning received deletion instructions to corresponding security levels according to the sensitivity of the data involved; Based on the assigned security level, a unique identifier containing a timestamp is generated and encrypted with a preset security key to form a processing token for that level.

9. A method for instant elimination of dynamically encrypted mobile storage information according to claim 1, characterized in that: The status update and log recording steps include: Before and after each processing node executes the data deletion operation, a log is automatically recorded, which includes the deletion instruction reception time, processing start time, processing end time, data deletion time and deletion result; Encrypt the log contents, using an encryption algorithm with the same or higher security level as data deletion; Set the log retention period, with the minimum retention period being no less than one year; Log data is stored on a dedicated secure server. After the log retention period expires, the log information is completely deleted using a predetermined data erasure algorithm. Log access is strictly controlled, and only authorized security personnel are allowed access. All access behaviors are also recorded in the log.

10. A system for instant elimination of dynamically encrypted mobile storage information, characterized in that: Includes the following modules: A deletion instruction receiving module is used to add the deletion instruction to the processing queue after receiving the deletion instruction; A processing token generation module is used to extract the pending deletion instruction from the processing queue and generate a processing token associated therewith; A processing node selection module, for identifying and selecting a group of processing nodes using a security level corresponding to a processing token; An instruction distribution module, for distributing instructions with processing tokens to selected processing nodes, wherein each node is responsible for processing a different part of the data; Data location module, each processing node performs a data location operation based on the received token, which locates the data based on a nonlinear dynamic hashing algorithm; Data encryption processing module, each processing node encrypts the located data according to the predetermined security policy; The asynchronous processing queue module returns the encrypted data to the master control node through the asynchronous processing queue again; Data collection and optimization module: the master control node collects all encrypted data and determines the final data deletion sequence according to the optimization algorithm; Data deletion execution module, which executes data deletion operations and updates and logs the status of related nodes; The processing token generation module includes: A timestamp generator, used to generate a timestamp-based unique identifier according to the received deletion instruction; An encryption module, encrypting the unique identifier with a preset security key to generate a processing token; Binding module, binds the processing token to the delete instruction.

Images