Image-Based Hashing System for High-Bit Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current hashing functions, especially those using input text with a key and salt, are vulnerable to cracking due to hardware and software advancements and have limited output bits, necessitating a method to generate a higher number of bits while maintaining security.
Innovation Solution
A method that converts input strings, hash keys, and salts into numerical data strings, using a series of hash functions and image coordinates to produce a strong hash value, eliminating the need for a hash table and enhancing security by utilizing pixel and RGB values for lookup.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional hashing functions with key and salt are used, then the hashing process is simple and fast, but the output bits are limited and the hash can be cracked due to hardware and software advancements
Solution Approach 1:
The patent segments the hashing process into multiple stages: first hash function processing, image coordinate extraction, second hash function processing, truncation, splitting, and third hash function processing. Each stage transforms the data further, collectively achieving high-bit output while maintaining manageable complexity at each individual step.
Solution Approach 2:
The patent introduces image coordinates as a new dimension in the hashing process. Instead of directly processing key and salt through traditional hash functions, the system converts them to coordinates, extracts pixel values from those coordinates, and uses those values as input to subsequent hash functions. This dimensional transformation significantly increases the output bit length and security.
2Productivity
If traditional hashing functions are used, then the processing speed is fast, but the output bits are limited
Solution Approach 1:
The patent introduces image pixel values as an intermediary between the initial hash function output and the final high-bit hash. The first hash function processes key and salt to generate coordinates, which then access image pixel values. These pixel values serve as intermediate data that expands the information content, enabling the generation of high-bit output while maintaining processing efficiency.
3Reliability
If hash table is used for hashing, then the search operation is fast, but the security is reduced due to vulnerability to cracking
Solution Approach 1:
The patent replaces the traditional hash table mechanical lookup system with an image-based coordinate system. Instead of using hash values to directly index into hash table buckets, the system converts hash values to coordinates and extracts pixel values from those coordinates. This substitution eliminates the vulnerability of traditional hash tables to cracking while maintaining efficient access operations.
Data Source
AI summary
Hashing data using an image by performing a bit by bit concatenation of input text and hash key. The result is concatenated bit by bit with the salt. A two bit by two bit multiplication between the result and the reverse of the result is performed to get a next output. The bits of this output are used as coordinates to extract pixel and RGB values from an image. The extracted values are merged to form a string. The string is truncated to a desired length, and then split into two equal strings. A bit by bit concatenation is performed on the split strings to get a hash output.