1. Dspace@NITW
  2. Journal Papers
  3. Computer Science and Engineering
Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2543
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgarwal, S.-
dc.contributor.authorRungta, A.-
dc.contributor.authorPadmavathy, R-
dc.contributor.authorShankar, M.-
dc.contributor.authorRajan, N.-
dc.date.accessioned2025-01-07T10:49:05Z-
dc.date.available2025-01-07T10:49:05Z-
dc.date.issued2012-03-
dc.identifier.citation10.3745/JIPS.2012.8.1.119en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2543-
dc.descriptionNITWen_US
dc.description.abstractRecently, a fast and secure hash function SFHA - 256 has been proposed and claimed as more secure and as having a better performance than the SHA - 256. In this paper an improved version of SFHA - 256 is proposed and analyzed using two parameters, namely the avalanche effect and uniform deviation. The experimental results and further analysis ensures the performance of the newly proposed and improved SFHA-256. From the analysis it can be concluded that the newly proposed algorithm is more secure, efficient, and practical.en_US
dc.language.isoenen_US
dc.publisherJournal of Information Processing Systemsen_US
dc.subjectSHA-256en_US
dc.subjectSFHA-256en_US
dc.titleAn Improved Fast and Secure Hash Algorithmen_US
dc.typeArticleen_US
Appears in Collections:Computer Science and Engineering

Files in This Item:
File Description SizeFormat 
An_Improved_Fast_and_Secure_Hash_Algorithm.pdf1.66 MBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.