Randomized Message Generation for Cryptographic Hash Functions

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Certain cryptographic hash functions, such as MD5 and SHA-1, are susceptible to collision attacks, compromising the security of digital signatures and other applications, and existing solutions like randomized hash function modes are vulnerable to online forgery attacks due to structural weaknesses in compression functions.

Innovation Solution

A method and system for generating randomized messages by dividing input messages into data blocks, using a random value to randomize each block, and appending a randomization parameter to the last block, which is computed based on the random value, to enhance security against collision and online forgery attacks.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If cryptographic hash functions like MD5 and SHA-1 are used for digital signature generation, then efficient digital signature generation and verification is achieved, but collision attacks compromise the security of the digital signatures

Engineering Contradiction:
Improveefficiency of digital signature generationVSAvoidsecurity of digital signatures
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The message is divided into data blocks, and a randomization parameter is appended to the last data block. This segmentation approach allows the system to maintain compatibility with existing hash functions while adding a security layer that prevents collision attacks from compromising digital signature verification.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

A random value is obtained based on a randomization criterion and used to generate a randomization parameter before the hashing process. This preliminary randomization action ensures that even if the underlying hash function is vulnerable to collision attacks, the randomized message prevents attackers from exploiting these vulnerabilities in practice.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If randomized hash function modes are used to prevent collision attacks, then security against collision attacks is improved, but online forgery attacks are enabled due to structural weaknesses in compression functions

Engineering Contradiction:
Improveresistance to collision attacksVSAvoidvulnerability to online forgery attacks
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

A randomization parameter acts as an intermediary between the message and the hash function. This intermediary element randomizes the input message in a way that prevents both collision attacks and online forgery attacks, as the randomization parameter ensures that the same message will produce different hashed values across different signing operations.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Reliability

If stronger hash functions are used to resist collision attacks, then security of applications is improved, but cryptographic libraries of licensed software frameworks do not support them

Engineering Contradiction:
Improvesecurity strength of hash functionVSAvoidcompatibility with software frameworks
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The invention changes the parameter space by introducing a randomization parameter that transforms the original message into a randomized message. This allows existing hash functions to be used with enhanced security properties, achieving the security strength of stronger hash functions while maintaining compatibility with software frameworks that only support older algorithms.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS9444619B2Generation of randomized messages for cryptographic hash functions
Publication Date: 2016.09.13 TATA CONSULTANCY SERVICES LTD
  • US9444619B2 patent drawing
  • US9444619B2 patent drawing
  • US9444619B2 patent drawing

AI summary

Method(s) and system(s) for generation of randomized messages for cryptographic hash functions are described herein. The method includes obtaining a random value based on a randomization criterion to randomize a message. Further, a last data block of the message is populated with a randomization parameter to obtain a randomized message. The randomization parameter populated in the last block is computed using the random value.