FORK-256

From Wikipedia, the free encyclopedia

This article may not meet the general notability guideline or one of the following specific guidelines for inclusion on Wikipedia: Biographies, Books, Companies, Fiction, Music, Neologisms, Numbers, Web content, or several proposals for new guidelines. If you are familiar with the subject matter, please expand or rewrite the article to establish its notability. The best way to address this concern is to reference published, third-party sources about the subject. If notability cannot be established, the article is more likely to be considered for redirection, merge or ultimately deletion, per Wikipedia:Guide to deletion.
This article has been tagged since March 2008.

This article is orphaned as few or no other articles link to it.
Please help introduce links in articles on related topics. (August 2006)

FORK-256 is a proposed hash algorithm to withstand security holes that were found in SHA-1 and MD5. The algorithm was designed to be more secure and also faster than SHA-256. FORK-256 uses 512-bit blocks and implements preset constants that change after each repetition. Each block is hashed into a 256-bit block through four branches that devides each 215 block into sixteen 32-bit words that are further encrypted and rearranged. Because the four branches are used in parallel, where as SHA-256 uses four serial rounds, FORK-256 is hard to analyze. It hasn't made it much beyond testing.