Second Preimages on n-bit Hash Functions for Much Less than 2n Work John Kelsey1 and Bruce Schneier2 1 National Institute of Standards and Technology, - Collision attack - Document - PDFSEARCH.IO

First Page	Meta Content
	Second Preimages on n-bit Hash Functions for Much Less than 2n Work John Kelsey1 and Bruce Schneier2 1 National Institute of Standards and Technology, Add to Reading List Document Date: 2014-03-02 23:18:30 Open Document File Size: 763,17 KB Share Result on Facebook Company Whirlpool / Counterpane Internet Security Inc. / / / Facility National Institute of Standards and Technology / / IndustryTerm fixed point finding algorithm / brute-force preimage search / fixed-point expandable message-finding algorithm / collision search / generic expandable message-finding algorithm / above algorithm / / Organization National Institute of Standards and Technology / / Person Rabin / Merkle / / Position Dean / / ProgrammingLanguage L / / Technology fixed point finding algorithm / above algorithm / message-finding algorithm / / SocialTag Preimage attack MD5 SHA-2 Hash function SHA-1 Hash table Collision attack Padding Tiger Cryptographic hash functions

Second Preimages on n-bit Hash Functions for Much Less than 2n Work John Kelsey1 and Bruce Schneier2 1 National Institute of Standards and Technology, Add to Reading List