Packet Encryption Using Bit-Ring Shifts for Real-Time Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing encryption methods for data packets require additional computations and resource consumption due to the use of encryption/decryption keys, making them unsuitable for time-sensitive networks.

Innovation Solution

A packet encryption method that transforms data into a local or global bits ring and shifts data bits based on the parity of 1-bits or 0-bits to generate an encrypted data set without using encryption keys, reducing computational complexity.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If encryption keys are used to encrypt data packets, then data security is improved, but processing time and computation resource consumption increase

Engineering Contradiction:
Improvedata securityVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent extracts the encryption key dependency from the system by using the data packet itself (through its cyclic redundancy check value) to generate the encryption key, eliminating the need for separate key management and reducing processing overhead

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The data packet self-generates its encryption key through the cyclic redundancy check value calculation, making the system self-sufficient without requiring external key distribution or management infrastructure

Inventive Principle:
Principle #25Self-service

2Reliability

If encryption keys are used to encrypt data packets, then data security is improved, but computation resource consumption increases

Engineering Contradiction:
Improvedata securityVSAvoidcomputation resource consumption
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent extracts the encryption key dependency from the system by using the data packet itself (through its cyclic redundancy check value) to generate the encryption key, eliminating the need for separate key management and reducing processing overhead

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent changes the parameter used for key generation from externally provided encryption keys to internally generated keys based on cyclic redundancy check values, reducing computation resource requirements

Inventive Principle:
Principle #35Parameter changes

3Reliability

If encryption/decryption keys are stored in terminals, then data security is improved, but device complexity increases

Engineering Contradiction:
Improvedata securityVSAvoidkey management complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent extracts the encryption key dependency from the system by using the data packet itself (through its cyclic redundancy check value) to generate the encryption key, eliminating the need for separate key management and reducing processing overhead

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The cyclic redundancy check value, originally serving only for error detection, is repurposed to also serve as the basis for encryption key generation, reducing device complexity by eliminating dedicated key management functionality

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentEP4664826A1Packet encryption method, electronic apparatus and non-transitory computer readable storage medium
Publication Date: 2025.12.17 HTC CORP
  • EP4664826A1 patent drawingFigure 1
  • EP4664826A1 patent drawingFigure 2
  • EP4664826A1 patent drawingFigure 3

AI summary

A packet encryption method includes following steps. A data member of an original data set is transformed into a local bits ring. In response to a local amount of 1-bits or a local amount of 0-bits in the local bits ring being odd, data bits in the local bits ring are shifted along a first direction, so as to generate a shifted data member. In response to the local amount of 1-bits or the local amount of 0-bits in the local bits ring being even, the data bits in the local bits ring are shifted along a second direction different from the first direction, so as to generate the shifted data member. An encrypted data set is generated based on the shifted data member.