A Fast Incremental Cryptographic Hash Function

The current trend in electronic commerce has spurred a need to guarantee the authenticity of data and user as well, in addition to the original objective of cryptography for protecting the data from disclosure. It turns out that fast cryptographic hash functions have been used extensively and become...

Full description

Saved in:

Bibliographic Details
Main Author:	Goi, Bok Min
Format:	Thesis
Published:	2003
Subjects:	LB2300 Higher Education
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-mmu-ep.1
record_format	uketd_dc
spelling	my-mmu-ep.12009-12-15T06:22:31Z A Fast Incremental Cryptographic Hash Function 2003-06-14 Goi, Bok Min LB2300 Higher Education The current trend in electronic commerce has spurred a need to guarantee the authenticity of data and user as well, in addition to the original objective of cryptography for protecting the data from disclosure. It turns out that fast cryptographic hash functions have been used extensively and become one of the most important cryptographic primitives. Although there are many fast cryptographic hash functions available in the literature, most of them use iterative constructions. They have to re-hash each message from scratch. Consequently they are inefficient for bulk hashing of messages with high similarity. In this project , we propose a new approach to construct a fast cryptographic hash function called Incremental Hash Function based on Pair Chaining and Modular Arithmetic Combining (PCIHF) by using the concept of incremental cryptography . We elaborate the setting of PCIHF which is a randomize-then-combine like paradigm in detail. The proposed PCIHF, using the existing standard hash functions, has some attractive and powerful features, especially incrementality. The time taken for updating the hash value is proportional to the amount of modifications made to the message or constant for certain text modification functions. PCIHF supports a set of message or constant for certain text modification functions. PCIHF supports a set of powerful text modification functions. It also supports multi-message manipulation and multiple blocks update operations. Some work on investigating the efficiency of PCIHF has been done in this project. The practicality of PCIHF has also been examined by comparing with a standard hash function. The security of PCIHF has been analyzed comprehensively. The reason why XOR cannot be chosen as the combining operator has been discussed. We show how the hardness of finding a second pre-image and a collision of PCIHF can be reduced to solving a standard subset sum problem and a weighted subset sum problem respectively . By this, we prove that the proposed PCIHF is not only universal oneway but also collision-free. Furthermore, since PCIHF gives a fixed size final hash value, no information is leaked during the updating process. 2003-06 Thesis http://shdl.mmu.edu.my/1/ http://vlib.mmu.edu.my/diglib/login/dlusr/login.php masters Multimedia University Research Library
institution	Multimedia University
collection	MMU Institutional Repository
topic	LB2300 Higher Education
spellingShingle	LB2300 Higher Education Goi, Bok Min A Fast Incremental Cryptographic Hash Function
description	The current trend in electronic commerce has spurred a need to guarantee the authenticity of data and user as well, in addition to the original objective of cryptography for protecting the data from disclosure. It turns out that fast cryptographic hash functions have been used extensively and become one of the most important cryptographic primitives. Although there are many fast cryptographic hash functions available in the literature, most of them use iterative constructions. They have to re-hash each message from scratch. Consequently they are inefficient for bulk hashing of messages with high similarity. In this project , we propose a new approach to construct a fast cryptographic hash function called Incremental Hash Function based on Pair Chaining and Modular Arithmetic Combining (PCIHF) by using the concept of incremental cryptography . We elaborate the setting of PCIHF which is a randomize-then-combine like paradigm in detail. The proposed PCIHF, using the existing standard hash functions, has some attractive and powerful features, especially incrementality. The time taken for updating the hash value is proportional to the amount of modifications made to the message or constant for certain text modification functions. PCIHF supports a set of message or constant for certain text modification functions. PCIHF supports a set of powerful text modification functions. It also supports multi-message manipulation and multiple blocks update operations. Some work on investigating the efficiency of PCIHF has been done in this project. The practicality of PCIHF has also been examined by comparing with a standard hash function. The security of PCIHF has been analyzed comprehensively. The reason why XOR cannot be chosen as the combining operator has been discussed. We show how the hardness of finding a second pre-image and a collision of PCIHF can be reduced to solving a standard subset sum problem and a weighted subset sum problem respectively . By this, we prove that the proposed PCIHF is not only universal oneway but also collision-free. Furthermore, since PCIHF gives a fixed size final hash value, no information is leaked during the updating process.
format	Thesis
qualification_level	Master's degree
author	Goi, Bok Min
author_facet	Goi, Bok Min
author_sort	Goi, Bok Min
title	A Fast Incremental Cryptographic Hash Function
title_short	A Fast Incremental Cryptographic Hash Function
title_full	A Fast Incremental Cryptographic Hash Function
title_fullStr	A Fast Incremental Cryptographic Hash Function
title_full_unstemmed	A Fast Incremental Cryptographic Hash Function
title_sort	fast incremental cryptographic hash function
granting_institution	Multimedia University
granting_department	Research Library
publishDate	2003
_version_	1747829067909955584

A Fast Incremental Cryptographic Hash Function

Similar Items