Data Encryption Apparatus Using Branching and Shift-Rotation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data encryption methods require a large number of substitution processes to achieve high scrambling performance, leading to a high hardware gate scale that is difficult to reduce.
Innovation Solution
A data encryption apparatus that uses branching, shift-rotating, and combining data blocks to achieve high scrambling performance with a reduced hardware gate scale, eliminating the need for substitution tables.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If substitution processes are used to achieve high scrambling performance, then scrambling performance is improved, but hardware gate scale increases
Solution Approach 1:
The patent replaces substitution tables (mechanical lookup approach) with arithmetic operations including addition, subtraction, multiplication, and modular operations. This substitution transforms the hardware implementation from table-based memory access to computational arithmetic circuits, achieving high scrambling performance with reduced hardware gate scale by eliminating the need for large substitution tables.
Solution Approach 2:
The patent changes the operational parameters from fixed substitution table lookups to dynamic arithmetic operations with variable coefficients. By using modular arithmetic with different moduli and coefficients for different data blocks, the system achieves diverse scrambling effects without requiring multiple fixed substitution tables, thereby reducing overall hardware complexity while maintaining high scrambling performance.
2Reliability
If a large number of substitution processes are implemented, then scrambling performance is improved, but hardware resource consumption increases
Solution Approach 1:
The patent implements universal arithmetic operation units that can perform addition, subtraction, multiplication, and modular operations using the same hardware resources. These multi-functional arithmetic units replace multiple specialized substitution tables, allowing a single set of hardware resources to achieve diverse scrambling effects through different arithmetic operations and parameter configurations, thereby reducing overall hardware resource consumption.
Solution Approach 2:
The patent uses variable arithmetic parameters (different moduli, coefficients, and operation types) to generate diverse scrambling effects from the same hardware structure. By changing operational parameters rather than using fixed substitution tables, the system achieves high scrambling performance with reusable hardware resources, significantly reducing the quantity of hardware substances required compared to implementing multiple separate substitution processes.
Data Source
AI summary
The data encryption apparatus with a data converting unit splits 256-bit input data into 32-bit data blocks A1, B1, A2, and B2. A first combining unit performs an exclusive OR operation on A1 and B1, and on A2 and B2. A first scramble unit branches A1, A2, and the results of the exclusive OR operations (C1 and C2) into three data blocks each, and for each set of three data blocks, shift-rotates two of the data blocks and combines the shifted data blocks with the remaining data block. A second combining unit performs an exclusive OR operation on D1 and E2, and on D2 and E1, which are the results of the processing performed by the first scramble unit. A block concatenating unit concatenates the results of the operations performed by the second combining unit. A second scramble unit branches the concatenated data into three data blocks, shift-rotates two of the data blocks and combines the two shifted data blocks with the remaining data block.