Packet Encryption via Bit-Ring Shifting for Time-Sensitive Networks
Find Innovative SolutionsGenerate 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 members into local and global bits rings, shifting data bits based on the parity of 1-bits or 0-bits to generate encrypted data sets without using encryption keys, reducing computational complexity.
Engineering Contradictions & Design Principles
Engineering 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
Solution Approach 1:
The patent extracts and eliminates the encryption key component from the encryption process. By using a keyless encryption mechanism based on chaotic maps and S-box transformations, the system removes the need for key generation, distribution, and management, thereby reducing processing time while maintaining security through mathematical transformations.
Solution Approach 2:
The patent replaces the traditional cryptographic mechanism (encryption keys) with a mathematical transformation system based on chaotic maps and S-boxes. This substitution eliminates the computational overhead of key-based encryption while achieving equivalent or superior security through deterministic yet unpredictable transformations.
2Reliability
If encryption keys are used to encrypt data packets, then data security is improved, but computation resource consumption increases
Solution Approach 1:
The patent extracts and eliminates the encryption key component from the encryption process. By using a keyless encryption mechanism based on chaotic maps and S-box transformations, the system removes the need for key generation, distribution, and management, thereby reducing processing time while maintaining security through mathematical transformations.
Solution Approach 2:
The patent replaces the traditional cryptographic mechanism (encryption keys) with a mathematical transformation system based on chaotic maps and S-boxes. This substitution eliminates the computational overhead of key-based encryption while achieving equivalent or superior security through deterministic yet unpredictable transformations.
3Reliability
If traditional encryption methods are used, then data confidentiality is achieved, but the system complexity increases due to key management
Solution Approach 1:
The patent extracts and eliminates the encryption key component from the encryption process. By using a keyless encryption mechanism based on chaotic maps and S-box transformations, the system removes the need for key generation, distribution, and management, thereby reducing processing time while maintaining security through mathematical transformations.
Data Source
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.