| Title | Ibn Omar Hash Algorithm |
| Publication Type | Conference Paper |
| Year of Publication | 2022 |
| Authors | Shafei, Raed |
| Conference Name | 2022 14th International Conference on Computational Intelligence and Communication Networks (CICN) |
| Keywords | Complexity theory, compositionality, Force, hash, hash algorithms, Hash functions, Ibn Omar, Information security, Linguistics, MD5, passwords, privacy, pubcrawl, resilience, Resiliency, SHA-256, SHA-512 |
| Abstract | A hash is a fixed-length output of some data that has been through a one-way function that cannot be reversed, called the hashing algorithm. Hashing algorithms are used to store secure information, such as passwords. They are stored as hashes after they have been through a hashing algorithm. Also, hashing algorithms are used to insure the checksum of certain data over the internet. This paper discusses how Ibn Omar's hashing algorithm will provide higher security for data than other hash functions used nowadays. Ibn Omar's hashing algorithm in produces an output of 1024 bits, four times as SHA256 and twice as SHA512. Ibn Omar's hashing algorithm reduces the vulnerability of a hash collision due to its size. Also, it would require enormous computational power to find a collision. There are eight salts per input. This hashing algorithm aims to provide high privacy and security for users. |
| DOI | 10.1109/CICN56167.2022.10008341 |
| Citation Key | shafei_ibn_2022 |
Ibn Omar Hash Algorithm