Computational complexity and implementation aspects of the incremental hash function

This paper gives the computational complexity and practical implementation aspects of a newly introduced incremental hash function called Pair Chaining & Modular Arithmetic Combining Incremental Hash Function (PCIHF). The boundary conditions of the parameters involved in the update process of PC...

Full description

Bibliographic Details
Main Authors: Goi, Bok Min, Siddiqi, M. U., Chuah, Hean Teik
Format: Article
Language:English
Published: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC 2003
Subjects:
Online Access:http://shdl.mmu.edu.my/2533/
http://shdl.mmu.edu.my/2533/1/1797.pdf
_version_ 1848790081323663360
author Goi, Bok Min
Siddiqi, M. U.
Chuah, Hean Teik
author_facet Goi, Bok Min
Siddiqi, M. U.
Chuah, Hean Teik
author_sort Goi, Bok Min
building MMU Institutional Repository
collection Online Access
description This paper gives the computational complexity and practical implementation aspects of a newly introduced incremental hash function called Pair Chaining & Modular Arithmetic Combining Incremental Hash Function (PCIHF). The boundary conditions of the parameters involved in the update process of PCIHF are examined in depth. It is proved that these basic requirements can be fulfilled easily. It is shown that in applications involving more than one update process if the number of blocks to be replaced is no more than 1/4 of the message blocks needed, the PCIHF is more efficient than standard SHA-1. Finally, it is observed that the computational complexity of combining operation is also important to ensure the practicability of PCIHF.
first_indexed 2025-11-14T18:06:56Z
format Article
id mmu-2533
institution Multimedia University
institution_category Local University
language English
last_indexed 2025-11-14T18:06:56Z
publishDate 2003
publisher IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
recordtype eprints
repository_type Digital Repository
spelling mmu-25332020-12-29T17:56:43Z http://shdl.mmu.edu.my/2533/ Computational complexity and implementation aspects of the incremental hash function Goi, Bok Min Siddiqi, M. U. Chuah, Hean Teik TA Engineering (General). Civil engineering (General) This paper gives the computational complexity and practical implementation aspects of a newly introduced incremental hash function called Pair Chaining & Modular Arithmetic Combining Incremental Hash Function (PCIHF). The boundary conditions of the parameters involved in the update process of PCIHF are examined in depth. It is proved that these basic requirements can be fulfilled easily. It is shown that in applications involving more than one update process if the number of blocks to be replaced is no more than 1/4 of the message blocks needed, the PCIHF is more efficient than standard SHA-1. Finally, it is observed that the computational complexity of combining operation is also important to ensure the practicability of PCIHF. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC 2003-11 Article NonPeerReviewed application/pdf en http://shdl.mmu.edu.my/2533/1/1797.pdf Goi, Bok Min and Siddiqi, M. U. and Chuah, Hean Teik (2003) Computational complexity and implementation aspects of the incremental hash function. IEEE Transactions on Consumer Electronics, 49 (4). pp. 1249-1255. ISSN 0098-3063 http://dx.doi.org/10.1109/TCE.2003.1261226 doi:10.1109/TCE.2003.1261226 doi:10.1109/TCE.2003.1261226
spellingShingle TA Engineering (General). Civil engineering (General)
Goi, Bok Min
Siddiqi, M. U.
Chuah, Hean Teik
Computational complexity and implementation aspects of the incremental hash function
title Computational complexity and implementation aspects of the incremental hash function
title_full Computational complexity and implementation aspects of the incremental hash function
title_fullStr Computational complexity and implementation aspects of the incremental hash function
title_full_unstemmed Computational complexity and implementation aspects of the incremental hash function
title_short Computational complexity and implementation aspects of the incremental hash function
title_sort computational complexity and implementation aspects of the incremental hash function
topic TA Engineering (General). Civil engineering (General)
url http://shdl.mmu.edu.my/2533/
http://shdl.mmu.edu.my/2533/
http://shdl.mmu.edu.my/2533/
http://shdl.mmu.edu.my/2533/1/1797.pdf