Word Buffer for Hash Algorithms Reduces Processor Area

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Implementing separate processor resources for various hash algorithms leads to increased processor area, production cost, and power consumption, while existing designs require substantial implementation area and multiplexer logic for each hash algorithm.

Innovation Solution

A cryptographic unit with a word buffer that dynamically shifts data blocks according to the selected hash algorithm, allowing for efficient computation and storage of hash values across multiple hash algorithms, reducing the need for separate resources and multiplexer logic.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If separate processor resources are implemented for each hash algorithm, then execution performance of hash algorithms is improved, but processor area, production cost, and power consumption increase

Engineering Contradiction:

Improveexecution performanceVSAvoidprocessor area

Core Design Contradiction:

ProductivityVSArea of stationary object

Solution Approach 1:

The word buffer is designed to serve multiple hash algorithms (MD5, SHA-1, SHA-256) through a single unified structure. The buffer can dynamically store and shift data blocks according to the selected algorithm, eliminating the need for separate dedicated buffers for each algorithm while maintaining efficient execution performance.

Inventive Principle:

Principle #6Universality (Multi-functionality)

Solution Approach 2:

The word buffer implements dynamic operation by linearly shifting data blocks by one or more data word positions based on the selected hash algorithm. This dynamic shifting capability allows the same buffer structure to adapt to different algorithm requirements without requiring separate static resources for each algorithm.

Inventive Principle:

Principle #15Dynamics

2Productivity

If separate processor resources are implemented for each hash algorithm, then execution performance of hash algorithms is improved, but power consumption increases

Engineering Contradiction:

Improveexecution performanceVSAvoidpower consumption

Core Design Contradiction:

ProductivityVSUse of energy by stationary object

Solution Approach 1:

Inventive Principle:

Principle #6Universality (Multi-functionality)

3Productivity

If separate processor resources are implemented for each hash algorithm, then execution performance of hash algorithms is improved, but production cost increases

Engineering Contradiction:

Improveexecution performanceVSAvoidproduction cost

Core Design Contradiction:

ProductivityVSEase of manufacture

Solution Approach 1:

Inventive Principle:

Principle #6Universality (Multi-functionality)

4Area of stationary object

If a single word buffer is used for multiple hash algorithms, then implementation area and power consumption are reduced, but device complexity increases

Engineering Contradiction:

Improveimplementation areaVSAvoidcomplexity of hash computations

Core Design Contradiction:

Area of stationary objectVSDevice complexity

Solution Approach 1:

Inventive Principle:

Principle #15Dynamics

Data Source

PatentUS7720219B1Apparatus and method for implementing a hash algorithm word buffer

Publication Date: 2010.05.18 ORACLE AMERICAN INC

AI summary

An apparatus and method for implementing a hash algorithm word buffer. In one embodiment, a cryptographic unit may include hash logic configured to compute a hash value of a data block according to a hash algorithm, where the hash algorithm includes a plurality of iterations, and where the data block includes a plurality of data words. The cryptographic unit may further include a word buffer comprising a plurality of data word positions and configured to store the data block during computing by the hash logic, where subsequent to the hash logic computing one of the iterations of the hash algorithm, the word buffer is further configured to linearly shift the data block by one or more data word positions according to the hash algorithm. The hash algorithm may be dynamically selectable from a plurality of hash algorithms.