SHA-Based Encryption for High-Speed Data Transmission

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing encryption algorithms, such as AES, are limited in encrypting larger data blocks and require high computation resources, making them unsuitable for high-speed data transmission, and lack a reliable verification process.

Innovation Solution

A method using the SHA function to encrypt and decrypt larger data blocks of 160, 256, 384, or 512-bit lengths, producing a signature for verification, and allowing keys of any length without altering the algorithm, while maintaining performance to match Giga Ethernet speeds.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If symmetric algorithms like AES are used for high transmission speed, then encryption speed is improved, but data block size is limited to 128 bits

Engineering Contradiction:
Improveencryption speedVSAvoiddata block size
Core Design Contradiction:
SpeedVSVolume of moving object

Solution Approach 1:

The patent divides the data into multiple segments and processes them iteratively. Each segment is encrypted using a hash function that processes data in smaller blocks, allowing the system to handle larger overall data volumes while maintaining the speed advantages of block-based processing. The segmentation enables flexible handling of data of any size without changing the fundamental encryption mechanism.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the parameter of data block size from fixed 128-bit to variable sizes (160, 256, 384, or 512 bits) by adjusting the hash function input and output parameters. This allows the encryption system to adapt to different data sizes while maintaining high processing speed through efficient hash function implementation.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If asymmetric algorithms are used for security, then security is improved, but computation resource requirement increases

Engineering Contradiction:
ImprovesecurityVSAvoidcomputation resource requirement
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent replaces complex asymmetric cryptographic mechanisms with hash function-based encryption. Instead of using computationally intensive asymmetric algorithms like RSA or ECC, the system uses hash functions (SHA-1, SHA-256, SHA-384, or SHA-512) that provide sufficient security with significantly lower computation resource requirements, making them suitable for high-speed transmission.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

3Reliability

If AES with 256-bit key is used, then security is improved, but key length flexibility is limited

Engineering Contradiction:
ImprovesecurityVSAvoidkey length flexibility
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent creates a universal encryption framework where the same hash function-based mechanism can accommodate key lengths of 160, 256, 384, or 512 bits without requiring different algorithms or structural changes. This multi-functional design allows the system to adapt to various security requirements and key lengths using a single unified approach.

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

Data Source

PatentUS7570759B2System and method for secure encryption
Publication Date: 2009.08.04 YEN FU LIU
  • US7570759B2 patent drawing
  • US7570759B2 patent drawing
  • US7570759B2 patent drawing

AI summary

A method for encrypting a message containing a plurality of message segments is described. First, a key is input into a SHA function to generate a first hash value. Then, a first message segment is encrypted into a first cipher segment by use of a part of the first hash value. Next, the first message segment and the first hash value are input into the SHA function to generate a second hash value. Following that, the second message segment is encrypted into a second cipher segment by use of a part of the second hash value. Subsequently, next message segment is repeatedly encrypted and input into the SHA function to generate a next cipher segment and a next hash value, respectively, until the last message segment is encrypted and the last hash value is generated.