Computational complexity and implementation aspects of the incremental hash function

Goi, B. and Siddiqi, M.U. and Hean-Teik , Chuah (2003) Computational complexity and implementation aspects of the incremental hash function. IEEE Transactions on Consumer Electronics, 49 (4). pp. 1249-1255. ISSN 0098-3063

[img] PDF
1797.pdf
Restricted to Repository staff only

Download (0B)
Official URL: http://dx.doi.org/10.1109/TCE.2003.1261226

Abstract

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.

Item Type: Article
Subjects: T Technology > TA Engineering (General). Civil engineering (General)
Divisions: Faculty of Engineering (FOE)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 22 Aug 2011 06:10
Last Modified: 22 Aug 2011 06:10
URI: http://shdl.mmu.edu.my/id/eprint/2533

Actions (login required)

View Item View Item