.png){kind=icon}
.png){kind=icon}
Return
Security considerations for incremental hash functions based on pair block chaining
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cose.2005.12.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
incremental hash functions have gained much attention due to their incremental property, i.e. hashes of updated messages can be speedily computed from previous hashes without having to re-hash the message as was the case in conventional hash functions. In this paper, we first show how collisions can be obtained in such incremental hash functions that are based on pair block chaining, highlighting that more caution should be taken into its design process. We then identify some design and implementation criteria for such incremental hash functions. (c) 2005 Elsevier Ltd. All rights reserved.
Keywords:
cryptography hash function
incremental cryptography
collision resistance
pair block chaining
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
5.4
Papers:
4.6K
Citations:
1.4W
Organization
No organization information available