Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2013.040832
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 4 Issue 8, 2013.
Abstract: Keccak is the latest Hash Function selected as the winner of NIST Hash Function Competition. SHA-3 is not meant to replace SHA-2 as no significant attacks on SHA-2 have been demonstrated. But it is designed in response to the need to find an alternative and dissimilar construct for Cryptographic Hash that is more fortified to attacks. In this paper we have tried to depict an analysis of the software implementation of Keccak-f based on the disk space utilization and time required to compute digest of desired sizes.
Ananya Chowdhury and Utpal Kumar Ray, “Performance Analysis of Keccak f-” International Journal of Advanced Computer Science and Applications(IJACSA), 4(8), 2013. http://dx.doi.org/10.14569/IJACSA.2013.040832