| Title | Design and Analysis of Hash Algorithm Using Autonomous Initial Value Proposed Secure Hash Algorithm64 |
| Publication Type | Conference Paper |
| Year of Publication | 2021 |
| Authors | Ambedkar, B. R., Bharti, P. K., Husain, Akhtar |
| Conference Name | 2021 IEEE 18th India Council International Conference (INDICON) |
| Date Published | dec |
| Keywords | codes, Complexity, compositionality, cryptography, Focusing, hash algorithms, Hash functions, Input variables, Memory management, One-way Function, passwords, pubcrawl, resilience, Resiliency, SHA, smart cards |
| Abstract | A secure hash code or message authentication code is a one-way hash algorithm. It is producing a fixed-size hash function to be used to check verification, the integrity of electronic data, password storage. Numerous researchers have proposed hashing algorithms. They have a very high time complexity based on several steps, initial value, and key constants which are publically known. We are focusing here on the many exiting algorithms that are dependent on the initial value and key constant usage to increasing the security strength of the hash function which is publically known. Therefore, we are proposing autonomous initial value proposed secure hash algorithm (AIVPSHA64) in this research paper to produce sixty-four-bit secure hash code without the need of initial value and key constant, it is very useful for a smart card to verify their identity which has limited memory space. Then evaluate the performance of hash function using autonomous initial value proposed secure hash algorithm (AIVPSHA64) and will compare the result, which is found by python-3.9.0 programming language. |
| DOI | 10.1109/INDICON52576.2021.9691602 |
| Citation Key | ambedkar_design_2021 |
Design and Analysis of Hash Algorithm Using Autonomous Initial Value Proposed Secure Hash Algorithm64