Visible to the public Enhancing the Performance of Hash Function Using Autonomous Initial Value Proposed Secure Hash Algorithm 256

TitleEnhancing the Performance of Hash Function Using Autonomous Initial Value Proposed Secure Hash Algorithm 256
Publication TypeConference Paper
Year of Publication2022
AuthorsAmbedkar, B. R., Bharti, P. K., Husain, Akhtar
Conference Name2022 IEEE 11th International Conference on Communication Systems and Network Technologies (CSNT)
Keywordsauthentication, codes, compositionality, Conferences, data communication, hash algorithms, hash code, Hash functions, Initial Value (IV), Key Constant, padding, pubcrawl, python, resilience, Resiliency, secure hash function, security
AbstractTo verify the integrity and confidentiality of data communicated through the web is a very big issue worldwide because every person wants very fast computing and secure electronic data communication via the web. The authentication of electronic data is done by hashing algorithms. Presently researchers are using one-time padding to convert variable-length input messages into a block of fixed length and also using constant initial values that are constant for any input message. So this reason we are proposing the autonomous initial value proposed secure hash algorithm-256 (AIVPSHA256) and we are enhancing the performance of the hash function by designing and compuiting its experimental results in python 3.9.5 programming language.
DOI10.1109/CSNT54456.2022.9787561
Citation Keyambedkar_enhancing_2022