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[1600] based on the disk space utilization and time required to compute digest of desired sizes.
Highlights
The state of Keccak- f [1600] is organized as a threedimensional array [2], which suggests several ways to partition the bits
Technique called “Hashing” is employed which relies on a family of Hash Functions. Keccak is one such Hash Function which is selected as the winner of NIST Hash Function Competition
A Keccak- f round consists of a sequence of invertible steps each operating on the state, organized as an array of 5 X 5 lanes, each of length w {1,2 4, 8, 16, 32, 64} (b = 25w)
Summary
Distributed Computing and Network Communication has revolutionized the face of modern computing. It brings with it serious security concerns like verifying the integrity and authenticity of the transmitted data. The sender and the receiver communicating over an insecure channel essentially require a method by which the information transmitted by the sender can be authenticated by the receiver as “unmodified” or authentic. Technique called “Hashing” is employed which relies on a family of Hash Functions.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
