Paper 2010/269
LAB Form for Iterated Hash Functions
Xigen Yao
Abstract
In this paper,we proposed a efficient and laconic mode for iterative hash functions and tried to fix the flaws of the Merkle-Damgaard construction completely and certainly tried to prevent varieties of those generic attacks ,such as Multicollisions Attack,Second Preimage Attack and Herding Attack.The struc- ture of this new mode is different from HAIFA or any other proposal,it contains a new method “Locking Abutting Blocks”(LAB)with checksum ,it makes a larger size of connotative chaining value without requirements of intricate computing and larger memory and it allows for an online computation in one pass with a fixed memory independently .It’s also easy to avoid the generic attacks (presented by Praveen Gauravaram and John Kelsey) which apply on the hash functions with linear-XOR/additive checksum.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- hash functioniteratingabutting blockseffectual chaining variablechecksum blocks
- Contact author(s)
- dihuo377 @ 163 com
- History
- 2012-11-26: last of 19 revisions
- 2010-05-11: received
- See all versions
- Short URL
- https://ia.cr/2010/269
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/269,
author = {Xigen Yao},
title = {LAB Form for Iterated Hash Functions},
howpublished = {Cryptology ePrint Archive, Paper 2010/269},
year = {2010},
note = {\url{https://eprint.iacr.org/2010/269}},
url = {https://eprint.iacr.org/2010/269}
}
