Shared Hardware Structure for Multi-Standard Hash Computation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing cryptographic hash function hardware requires significant space due to variations in design, necessitating separate implementations for SHA-1, SHA-2, and SHA-3, which is inefficient for area utilization, especially on chips.

Innovation Solution

A shared hardware structure with a virtual data cube organization allows for efficient determination of hash values for multiple hash functions, including SHA-1, SHA-2, and SHA-3, using a shared memory, interface, and logic, enabling a single device to perform different hash functions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If separate hardware realizations are implemented for each hash function type (SHA-1, SHA-2, SHA-3), then each hash function can be efficiently performed, but the hardware space required increases significantly

Engineering Contradiction:
Improvecapability to perform multiple hash functionsVSAvoidhardware space on chip
Core Design Contradiction:
Adaptability or versatilityVSArea of stationary object

Solution Approach 1:

The patent implements a universal hash computation device that can perform multiple hash function types (SHA-1, SHA-2, SHA-3) using a single shared memory structure. The memory is organized with configurable word sizes and state configurations that can be adapted to different hash function requirements, allowing one hardware device to replace multiple dedicated hardware realizations.

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

Solution Approach 2:

The patent utilizes parameter changes by configuring the shared memory with different word sizes (32-bit or 64-bit) and state sizes (160-bit for SHA-1, 1600 bits for SHA-3) depending on which hash function is being executed. This allows the same physical hardware to dynamically adapt its operational parameters to match the requirements of different hash function types.

Inventive Principle:
Principle #35Parameter changes

2Productivity

If different word sizes (32-bit or 64-bit) and state sizes (160-bit, 1600 bits) are used for different hash functions, then each hash function can be implemented with optimal performance, but the hardware complexity increases

Engineering Contradiction:
Improvehash computation efficiencyVSAvoidhardware structure complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent implements dynamic configurability where the shared memory can be reconfigured on-the-fly to support different word sizes and state sizes. The hardware structure includes configurable elements that can be dynamically adjusted based on which hash function is being executed, allowing optimal performance for each function without requiring separate dedicated hardware for each configuration.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent segments the hash computation functionality into independent configurable components within the shared memory structure. The memory is divided into configurable words and states that can be independently configured for different hash function requirements, allowing flexible combination of different word sizes and state sizes without increasing overall hardware complexity.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS12010215B2Calculating hash values
Publication Date: 2024.06.11 INFINEON TECHNOLOGIES AG
  • US12010215B2 patent drawing
  • US12010215B2 patent drawing
  • US12010215B2 patent drawing

AI summary

Determining hash values based on at least two types of hash functions, utilizing a memory that is arranged to store at least one state to be used to determine hash values pursuant to a SHA-3 function, wherein hash values pursuant to any of a SHA-2 function or a SHA-1 function are determined based on the state.