Abstract
Most of the hash functions using iterative constructions, are inefficient for bulk hashing of documents with high similarity. In this paper, we present a new approach to construct a cryptographic hash function called Pair Chaining & Modular Arithmetic Combining Incremental Hash Function (PCIHF). PCIHF has some attractive properties, which are incrementality and parallelizability. The security of PCIHF has also been analyzed comprehensively. Finally, we show that PCIHF is not only universal one-way but also collision-free.
Author supplied keywords
Cite
CITATION STYLE
Goi, B. M., Siddiqi, M. U., & Chuah, H. T. (2001). Incremental Hash function based on pair chaining and modular arithmetic combining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2247, pp. 50–61). Springer Verlag. https://doi.org/10.1007/3-540-45311-3_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
