Hashing Method for Secure Authentication via Nested Hash Combinations

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current systems lack a secure method to prevent unauthorized access to data within a computing system, making them vulnerable to unauthorized users.

Innovation Solution

A method involving a computing system that generates and stores multiple hashes for user passwords and system parameters, combining them using operations like XOR or appending, and then applying a third hash function to create a secure combination value, which is stored and used for authentication.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a simple password storage method is used, then the system is easier to operate, but the security is insufficient allowing unauthorized access

Engineering Contradiction:
ImprovesecurityVSAvoidhashing system complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The password is segmented into multiple components through sequential hashing: first hash H1 is generated from the password, then combined with system parameter hash H2 to create combination value C1, which is then hashed to produce final hash H3. This segmentation transforms a single security layer into multiple interconnected security layers, preventing unauthorized access while maintaining systematic organization.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The hashing system implements nested security by embedding multiple hash functions within each other. The first hash H1 is nested within the combination value C1 (H1 combined with H2), which is then nested within the final hash H3. This nested structure creates layered security where each hash function protects the previous layer, significantly enhancing security against unauthorized access.

Inventive Principle:
Principle #7Nested doll (Nesting)

2Reliability

If multiple hash functions are applied to passwords, then security is enhanced, but the processing time increases

Engineering Contradiction:
Improveauthentication securityVSAvoidpassword processing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system performs preliminary hashing of the system parameter to generate H2 before authentication occurs. This pre-computed hash is stored and reused during authentication, eliminating the need to re-hash system parameters during each login. This preliminary action reduces processing time during authentication while maintaining the security benefits of multiple hash functions.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system merges the password hash H1 with the pre-computed system parameter hash H2 to create combination value C1. This merging operation combines two hash values through efficient bitwise operations rather than sequential processing, reducing the overall processing time while maintaining the security advantages of multiple hash functions.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS7694147B2Hashing method and system
Publication Date: 2010.04.06 X CORP
  • US7694147B2 patent drawing
  • US7694147B2 patent drawing
  • US7694147B2 patent drawing

AI summary

A hashing method and system. The method comprises receiving by a computing system, a user password. The computing system generates a first hash for the user password. The computing system generates a second hash for a system parameter and performs an operation relating the first hash to the second hash to generate a first combination value. The computing system generates a third hash for the first combination value. The computing system receives a specific password for requesting access to the computing system. The computing system generates a fourth hash for said specific password and performs an operation relating the fourth hash to the second hash to generate a second combination value. The computing system generates a fifth hash for the second combination value. The third hash is compared to the fifth hash to determine that the third hash matches the fifth hash. Access is enabled to the computing system.