Richa, Poorti,Kavita, Jitin, Pankaj, Preeti
2345 richa 7809 pankaj,jitin 5309 poorti 1904 kavita
Damgård and Merkle greatly influenced cryptographic hash function design by defining a hash function in terms of what is called a compression function. A compression function takes a fixed-length input and returns a shorter, fixed-length output. Given a compression function, a hash function can be defined by repeated applications of the compression function until the entire message has been processed. In this process, a message of arbitrary length is broken into blocks whose length depends on the compression function, and ``padded'' (for security reasons) so the size of the message is a multiple of the block size. The blocks are then processed sequentially, taking as input the result of the hash so far and the current message block, with the final output being the hash value for the message.
Reference: http://whatis.database.search.co
Prof. Ashay Dharwadker