An Improved Fast and Secure Hash Algorithm

Siddharth Agarwal, Abhinav Rungta, R.Padmavathy, Mayank Shankar and Nipun Rajan
Volume: 8, No: 1, Page: 119 ~ 132, Year: 2012
10.3745/JIPS.2012.8.1.119
Keywords: SHA-256, SFHA-256, Improved SFHA-256
Full Text:

Abstract
Recently, 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.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
Siddharth Agarwal, Abhinav Rungta, R.Padmavathy, Mayank Shankar and Nipun Rajan, "An Improved Fast and Secure Hash Algorithm," Journal of Information Processing Systems, vol. 8, no. 1, pp. 119~132, 2012. DOI: 10.3745/JIPS.2012.8.1.119.

ACM Style
Siddharth Agarwal, Abhinav Rungta, R.Padmavathy, Mayank Shankar and Nipun Rajan, "An Improved Fast and Secure Hash Algorithm," Journal of Information Processing Systems, 8, 1, (2012), 119~132. DOI: 10.3745/JIPS.2012.8.1.119.