NPF Code Boundary Encryption for Low-Power Data Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing encryption methods are computationally intensive and power-consuming, particularly in battery-constrained environments, and current approaches to reduce this load, such as selective encryption and combined compression/encryption, do not effectively address the need for secure data transmission while minimizing computational resources.
Innovation Solution
A data encryption method using variable-length non-prefix-free (NPF) codes, where the code-word boundaries are encrypted to secure the data, allowing for up to 90% reduction in encryption operations by processing data in d-bits long blocks and generating variable-length code-words without prefix-free restrictions, making the data secure without unique decodability without the boundary information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional encryption methods are used to secure data, then data security is achieved, but computational load and power consumption increase significantly
Solution Approach 1:
The data is divided into blocks of d-bits, and only the code-word boundary information (not the entire data) is encrypted. This segmentation allows the system to maintain data security while encrypting only a small fraction of the total data, thereby reducing power consumption and computational load.
Solution Approach 2:
Different parts of the data are treated differently: code-word boundary information is encrypted to provide security, while the actual data content remains in plain format. This local quality approach ensures that critical structural information is protected without the need to encrypt the entire dataset, reducing energy consumption.
2Reliability
If encryption operations are performed on large data volumes, then data security is maintained, but processing time and computational resources increase
Solution Approach 1:
The data stream is segmented into blocks, and encryption is applied only to the boundary information between code-words rather than the entire data stream. This reduces the volume of data requiring encryption operations, thereby decreasing processing time while maintaining security.
Solution Approach 2:
Instead of performing full encryption on the entire dataset, the method applies encryption only to the necessary boundary information (partial action). This is sufficient to maintain security because the boundary information is critical for data reconstruction, while avoiding the time cost of encrypting redundant data content.
3Use of energy by moving object
If selective encryption is applied to reduce encryption operations, then power consumption decreases, but data security may be compromised
Solution Approach 1:
The method selectively encrypts the code-word boundary information, which is the most critical part of the data structure. By applying encryption to this specific local element rather than randomly selecting data portions, the system maintains strong security while minimizing the number of encryption operations.
Solution Approach 2:
The code-word boundary information acts as an intermediary that, when encrypted, provides security for the entire dataset. Encrypting this intermediary element is sufficient to protect the plain-text data content, as unauthorized users cannot properly process or interpret the data without the encrypted boundary information.
4Productivity
If combined compression and encryption is performed, then processing efficiency improves, but the number of encryption operations is not reduced
Solution Approach 1:
The method separates the compression and encryption operations, applying compression to the entire data stream and then encrypting only the code-word boundary information. This segmentation allows the system to benefit from compression efficiency while simultaneously reducing the scope of encryption operations to minimize power consumption.
Solution Approach 2:
Instead of encrypting the compressed data in full (excessive action), the method applies encryption only to the necessary boundary information (partial action). This maintains processing efficiency through compression while avoiding unnecessary encryption operations that would increase power consumption.
Data Source
AI summary
The invention is particularly related with an encryption method that aims to secure an input data with reduced number of encryption operations. The invention claim the security by using the hardness of the unique decodability of the variable-length non-prefix-free (NPF) codes. The proposed encryption system is operated according to these steps, compression of the input data and coding with the introduced NPF encoding that splits the independent and identically distributed (IID) data to the two stream as code-word boundaries information data, which has all information of boundaries of NPF code words stream, and NPF code words stream which has all payload of encoded IID data except code-word boundaries information and then encrypting the code-word boundaries information without NPF code words stream.