A new hash function based on block cipher

4Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper a new 2m-bit iterated hash function based on a m-bit block cipher with a 2m-bit key is proposed. The hash round function in the new scheme utilizes a single underlying block cipher and can completely resist target attack, collision attack and semi-free-start collision attack. The new scheme can be expected to have ideal computational security against five attacks when the underlying cipher is assumed to have no weakness.

Cite

CITATION STYLE

APA

Yi, X., & Lam, K. Y. (1997). A new hash function based on block cipher. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1270, pp. 139–146). Springer Verlag. https://doi.org/10.1007/BFb0027921

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free