New FORK-256

Deukjo Hong; Donghoon Chang; Jaechul Sung; Sangjin Lee; Seokhie Hong; Jesang Lee; Dukjae Moon; Sungtaek Chee

eprint.iacr.org will be offline for approximately an hour for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between April 12 and April 14, and some authors have been notified that they need to resubmit their papers.

Paper 2007/185

New FORK-256

Deukjo Hong, Donghoon Chang, Jaechul Sung, Sangjin Lee, Seokhie Hong, Jesang Lee, Dukjae Moon, and Sungtaek Chee

Abstract

The hash function FORK-256 was published at the ¯rst NIST hash workshop and FSE 2006. It consists of simple operations so that its performance is better than that of SHA-256. However, recent papers show some weaknesses of FORK-256. In this paper, we propose newly modi¯ed FORK-256 which has no microcoliisions and so is resistant against existing attacks. Furthermore, it is faster than the old one.

Note: The existing text will be overwritten.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Hash Function
Contact author(s): hongdj @ cist korea ac kr
History: 2007-07-31: revised; 2007-05-20: received; See all versions
Short URL: https://ia.cr/2007/185
License: CC BY

BibTeX

@misc{cryptoeprint:2007/185,
      author = {Deukjo Hong and Donghoon Chang and Jaechul Sung and Sangjin Lee and Seokhie Hong and Jesang Lee and Dukjae Moon and Sungtaek Chee},
      title = {New FORK-256},
      howpublished = {Cryptology ePrint Archive, Paper 2007/185},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/185}},
      url = {https://eprint.iacr.org/2007/185}
}