Database Field Permutation for Encryption-Free Data Protection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data protection methods, particularly encryption, are vulnerable to decryption by hackers, and the success of decryption is easily identifiable, while the connections between data points remain exposed, making them susceptible to unauthorized access and misuse.
Innovation Solution
A permutation-based data protection system using modular arithmetic reorders database fields without altering their content, hiding relationships between data points, rendering the connections indistinguishable from random permutations, thus providing enhanced security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If encryption is used to protect data, then data security is improved, but processing speed and accessibility deteriorate
Solution Approach 1:
The patent extracts the security function from traditional encryption methods and implements it through cryptographic hash functions that generate fixed-length digests. This extraction allows security protection without the computational overhead of conventional encryption, thereby maintaining data security while improving processing speed.
Solution Approach 2:
The patent replaces the mechanical encryption system with a mathematical hash function system. Instead of using complex encryption algorithms that require heavy computational resources, the system uses hash functions that rapidly generate unique digital fingerprints of data, achieving security without sacrificing processing speed.
2Reliability
If encryption is used to protect data, then data security is improved, but system complexity increases
Solution Approach 1:
The patent extracts only the essential security verification function from complex encryption systems, using hash functions that provide security through mathematical properties rather than complex algorithmic structures. This simplifies the system while maintaining security.
Solution Approach 2:
The patent changes the security approach from parameter-based encryption (keys, algorithms) to structure-based hashing (fixed-length digests, collision resistance). This parameter change fundamentally simplifies the system architecture while preserving security through mathematical properties of hash functions.
3Reliability
If verification protocols are implemented to ensure data integrity, then data reliability is improved, but processing time increases
Solution Approach 1:
The patent applies preliminary action by generating cryptographic hash values in advance during data creation or storage. When verification is needed, the pre-computed hash can be quickly compared against a new hash of the received data, eliminating the need for time-consuming verification protocols and significantly reducing processing time while maintaining data integrity.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A permutation algorithm using modular arithmetic is applied to the cells of one or more specific fields of a database or other file type. This permutation reorders the cells of the specific field (s) without altering content of any individual cell, thereby hiding relationships between cells of the permuted field (s) and the other information in the associated records. The permutation algorithm may use modular addition and modular subtraction, in either order. Different permutation algorithms may use varying numbers of parameters. To locate a specific cell in a permuted field, the parameter(s) from the permutation, an identification of the specific record associated with the cell, and an identification of the specific permuted field are applied in a modular arithmetic operation. A specific record with which a specific cell in a permuted field is associated may be obtained by an inverse modular arithmetic operation.