A secured hash function is used to protect the integrity of the message transferred on the unsecured network. Any changes on the bits of the sender’s message can be recognized by the message digest (also known as hash value) produced by the hash function. The receiver needs to re-calculate the hash value of the message to check the integrity of the received message. In this paper we introduce new hash function based on NP-hard problem. We choose Braid as NP-hard problem for our hash function since Braid Conjugacy problems have been proved that they are secured against cryptanalysis attacks. The designed hash function then can be attached to any cryptosystem for message integrity purposes with high level of security.
%0 Conference Proceedings
%1 BraidHash
%A Suwais, Khaled
%A Zaki, Fakhrul
%A Samsudin, Azman
%B Regional Computer Science Postgraduate Conference (ReCSPC '06)
%D 2006
%K Braid Cryptography Hash
%T A Secured Hash Function Based On Braid Groups
%X A secured hash function is used to protect the integrity of the message transferred on the unsecured network. Any changes on the bits of the sender’s message can be recognized by the message digest (also known as hash value) produced by the hash function. The receiver needs to re-calculate the hash value of the message to check the integrity of the received message. In this paper we introduce new hash function based on NP-hard problem. We choose Braid as NP-hard problem for our hash function since Braid Conjugacy problems have been proved that they are secured against cryptanalysis attacks. The designed hash function then can be attached to any cryptosystem for message integrity purposes with high level of security.
@proceedings{BraidHash,
abstract = {A secured hash function is used to protect the integrity of the message transferred on the unsecured network. Any changes on the bits of the sender’s message can be recognized by the message digest (also known as hash value) produced by the hash function. The receiver needs to re-calculate the hash value of the message to check the integrity of the received message. In this paper we introduce new hash function based on NP-hard problem. We choose Braid as NP-hard problem for our hash function since Braid Conjugacy problems have been proved that they are secured against cryptanalysis attacks. The designed hash function then can be attached to any cryptosystem for message integrity purposes with high level of security.},
added-at = {2009-03-24T05:16:57.000+0100},
author = {Suwais, Khaled and Zaki, Fakhrul and Samsudin, Azman},
biburl = {https://www.bibsonomy.org/bibtex/2631af8bb2356eabb26330a9252f4d340/khaled_suwais},
interhash = {c479658f69d2a2d75212cb4e566185b8},
intrahash = {631af8bb2356eabb26330a9252f4d340},
keywords = {Braid Cryptography Hash},
month = {June},
organization = {School of Computer Sciences (USM)},
series = {Regional Computer Science Postgraduate Conference (ReCSPC '06)},
timestamp = {2009-03-24T05:35:12.000+0100},
title = {A Secured Hash Function Based On Braid Groups},
year = 2006
}