DILH: Data integrity using linear combination for Hash algorithm
Rushdi A. Hamamreh, Mohammed A. Jamoos, Raid Zaghal
Abstract
Rushdi A. Hamamreh, Mohammed A. Jamoos, Raid Zaghal
Abstract
This Paper describes the construction of One-Way Hash Algorithm, which is also obtains better efficiency and security, compared with a particular conventional hash algorithm, Hash algorithm can be used to determine if two values are equal, a hash function maps keys to small values[1]. DILH algorithm using linear combination of matrices to find non-invertible matrix, that takes advantage about of the compact representation of a set of numbers in a matrix.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This Paper describes the construction of One-Way Hash Algorithm, which is also obtains better efficiency and security, compared with a particular conventional hash algorithm, Hash algorithm can be used to determine if two values are equal, a hash function maps keys to small values[1]. DILH algorithm using linear combination of matrices to find non-invertible matrix, that takes advantage about of the compact representation of a set of numbers in a matrix.
Key concepts: Hash function, Rolling hash, Double hashing, Hash chain, SHA-2, Algorithm, Secure Hash Algorithm, Computer science