Evolutionary design of hash function pairs for network filters

Dobai, Roland; Kořenek, Jan; Sekanina, Lukáš

doi:10.1016/j.asoc.2017.03.009

Cited by 8 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hash functions have been applied for many security applications and protocols such as PGP, SSL, SSH, IPsec, TLS and S/MIME [4]. In order to provide these applications with a high level of security, we have to design a secure hash function against existing attacks.…”

Section: Literature Reviewmentioning

confidence: 99%

BHA-160: Constructional Design of Hash Function based on NP-hard Problem

Shahrani¹

2019

IJACSA

View full text Add to dashboard Cite

Secure hash function is used to protect the integrity of the message transferred on the unsecured network. Changes on the bits of the sender's message are recognized by the message digest produced by the hash function. Hash function is mainly concerned with data integrity, where the data receiver needs to verify whether the message has been altered by eavesdropping by checking the hash value appended with the message. To achieve this purpose, we have to use a secure hash function that is able to calculate the hash value of any message. In this paper, we introduce an alternative hash function based on NP-hard problem. The chosen NP-hard problem is known as Braid Conjugacy problem. This problem has proved to be secure against cryptanalysis attacks.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

BHA-160: Constructional Design of Hash Function based on NP-hard Problem

Shahrani¹

2019

IJACSA

View full text Add to dashboard Cite

show abstract

“…Hash function has been applied for many security applications and protocols such as PGP, SSL, SSH, IPsec, TLS and S/MIME [4]. In order to provide these applications with high level of security, we have to design a secure hash function against existing attacks.…”

Section: Literature Reviewmentioning

confidence: 99%

Alternative Hash Function based on NP-hard Problem

Alshahrani¹

2018

Proceedings of the 8th International Conference on Research in Engineering, Science and Technology

View full text Add to dashboard Cite

Secure hash function is used to protect the integrity of the message transferred on the unsecured network. Changes on the bits of the sender's message is recognized by the message digest produced by the hash function. Hash function is mainly concerned of data integrity, where data receiver needs to verify whether the message has been altered by eavesdropping by checking the hash value appended with the message. To achieve this purpose, we have to use secure hash function able to calculate the hash value of any message. In this paper we introduce an alternative hash function based on NP-hard problem. The chosen NP-hard problem is known as Braid Conjugacy problem. The braid conjugacy problem forms the core of the hash function. The aim of using this hard problem is to make sure that the hash function is irreversible and secure against cryptanalysis attacks. The results shows that the proposed hash function is secure mathematically, and it provides huge key search space.

show abstract