Fast Message Hashing via Iterative State Data and Bit Operations

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing hash algorithms face inefficiencies in calculation speed and are vulnerable to attacks, necessitating an optimized compression function for enhanced message hashing.

Innovation Solution

The method involves generating expanded messages, initializing and updating state data through combination and step functions using logical operations, and applying these to chain variable data to produce a hash value, ensuring protection against attacks.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If existing hash algorithms are used, then message hashing can be performed, but calculation speed is inefficient

Engineering Contradiction:
Improvecalculation speedVSAvoidhashing efficiency
Core Design Contradiction:
SpeedVSProductivity

Solution Approach 1:

The message is divided into multiple blocks, and the compression function is applied iteratively to each block. The state data is segmented into multiple words that are processed in parallel through the combination function, improving overall calculation speed while maintaining hashing productivity.

Inventive Principle:
Principle #1Segmentation

2Reliability

If existing hash algorithms are used, then message hashing can be performed, but vulnerability to attacks increases

Engineering Contradiction:
Improveprotection from attacksVSAvoidcompression function complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent introduces state data as an intermediary between the input message blocks and the final hash value. This state data undergoes multiple iterations of the combination function with expanded message blocks, providing enhanced security against attacks while managing complexity through a structured intermediate representation.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent modifies the compression function by changing parameters such as the number of iterations, the structure of the combination function, and the expansion of message blocks into multiple words. These parameter changes enhance security against attacks while keeping the overall system manageable through systematic modification rather than complete redesign.

Inventive Principle:
Principle #35Parameter changes

3Productivity

If compression function is optimized for speed, then calculation efficiency improves, but security protection may be compromised

Engineering Contradiction:
Improvehashing efficiencyVSAvoidprotection from attacks
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent ensures continuous useful action by performing multiple iterations of the combination function on the state data with expanded message blocks. This continuous processing maintains security through repeated transformation while improving efficiency by utilizing parallel processing capabilities and avoiding unnecessary intermediate steps.

Inventive Principle:
Principle #20Continuity of useful action

Data Source

PatentUS9843442B2Operation method and apparatus for providing compression function for fast message hashing
Publication Date: 2017.12.12 ELECTRONICS & TELECOMM RES INST
  • US9843442B2 patent drawing
  • US9843442B2 patent drawing
  • US9843442B2 patent drawing

AI summary

An operation apparatus includes a message expansion unit, a state data initiation unit, a state data generation unit, and a chain variable update unit. The message expansion unit generates a plurality of expanded messages using a message. The state data initiation unit generates the initial value of state data using chain variable data. The state data generation unit generates the final value of the state data by iterating a combination function and a step function using the state data and the plurality of expanded messages. The chain variable update unit updates the chain variable data using the state data of the final value.