NPF Coding Encryption Using Boundary-Only Protection

Solution Overview

Problem

Existing encryption methods in battery-constrained environments, such as sensor networks and mobile video transmission, face significant computational load and power consumption issues due to the high demand for encryption operations, especially when dealing with large data volumes.

Innovation Solution

The proposed method employs variable-length non-prefix-free (NPF) coding to reduce encryption operations by processing data in d-bits long blocks, generating code-words and code-word boundary information, and encrypting only the boundary information for security, allowing up to 90% reduction in encryption operations.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If encryption operations are applied to secure data, then data security is improved, but computational load and power consumption increase

Engineering Contradiction:

Improvedata securityVSAvoidpower consumption

Core Design Contradiction:

ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent segments the data into d-bit blocks and processes each block independently through NPF coding. Only the code-word boundary information (not the entire data) requires encryption, dividing the encryption task into smaller, manageable portions while maintaining security. This segmentation reduces the total encryption operations from covering all data to covering only boundary markers.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent extracts and encrypts only the critical code-word boundary information from the compressed data stream, leaving the bulk of the data unencrypted. This extraction approach identifies the minimal essential elements (boundary markers) that must be protected to ensure data security, eliminating the need to encrypt the entire data set.

Inventive Principle:

Principle #2Taking out (Extraction)

2Reliability

If encryption operations are applied to secure data, then data security is improved, but computational load increases

Engineering Contradiction:

Improvedata securityVSAvoidcomputational load

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the data into d-bit blocks and processes each block independently through NPF coding. Only the code-word boundary information (not the entire data) requires encryption, dividing the encryption task into smaller, manageable portions while maintaining security. This segmentation reduces the total encryption operations from covering all data to covering only boundary markers.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent extracts and encrypts only the critical code-word boundary information from the compressed data stream, leaving the bulk of the data unencrypted. This extraction approach identifies the minimal essential elements (boundary markers) that must be protected to ensure data security, eliminating the need to encrypt the entire data set.

Inventive Principle:

Principle #2Taking out (Extraction)

3Loss of time

If compression and encryption are performed together, then processing time is reduced, but the number of encryption operations remains high

Engineering Contradiction:

Improveprocessing timeVSAvoidnumber of encryption operations

Core Design Contradiction:

Loss of timeVSProductivity

Solution Approach 1:

The patent applies partial encryption rather than full encryption, encrypting only the code-word boundary information (a small fraction of the total data) while leaving the rest unencrypted. This partial action approach achieves the necessary security level with significantly fewer encryption operations, reducing computational overhead while maintaining acceptable security.

Inventive Principle:

Principle #16Partial or excessive action

Solution Approach 2:

The patent extracts and encrypts only the critical code-word boundary information from the compressed data stream, leaving the bulk of the data unencrypted. This extraction approach identifies the minimal essential elements (boundary markers) that must be protected to ensure data security, eliminating the need to encrypt the entire data set.

Inventive Principle:

Principle #2Taking out (Extraction)

Data Source

PatentEP3365884B1An efficient encryption method to secure data with reduced number of encryption operations

Publication Date: 2019.10.09 ISTANBUL TEKNIK UNIVSI

Figure 1

AI summary

The invention is particularly related with an encryption method that aims to secure an input data (1) 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 (2) of the input data (1) and coding with the introduced NPF encoding (5) that splits the independent and identically distributed (IID) data (4) to the two stream as code-word boundaries information (6) data, which has all information of boundaries of NPF code words stream (7), and NPF code words stream (7) which has all payload of encoded IID data (4) except code-word boundaries information (6) and then encrypting (8) the code- word boundaries information (6) without NPF code words stream (7).