BHA-160: Constructional Design of Hash Function based on NP-hard Problem
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2019, Vol 10, Issue 5
Abstract
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.
Authors and Affiliations
Ali AlShahrani
Keywords
Related Articles
- EP ID EP578506
- DOI 10.14569/IJACSA.2019.0100543
- Views 96
- Downloads 0
IoT-Enabled Door Lock System
This paper covers the design of a prototype for IoT and GPS enabled door lock system. The aim of this research is to design a door lock system that does not need manual input from user for convenience purpose while also...
SSL based Webmail Forensic Engine
In this era of information technology, email applications are the foremost and extensively used electronic communication technology. Emails are profusely used to exchange data and information using several frontend appli...
Enhanced Mutual Authenticated Key Agreement Protocol for Anonymous Roaming Service in Global Mobility Networks
With the rapid development of mobile intelligent terminals, users can enjoy ubiquitous life in global mobility networks (GLOMONET). It is essential to secure user information for providing secure roaming service in GLOMO...
Feature Fusion for Negation Scope Detection in Sentiment Analysis: Comprehensive Analysis over Social Media
Negation control for sentiment analysis is essential and effective decision support system. Negation control include identification of negation cues, scope of negation and their influence within it. Negation can either s...
NMVSA Greedy Solution for Vertex Cover Problem
Minimum vertex cover (MVC) is a well-known NP-Complete optimization problem. The importance of MVC in theory and practical comes from the wide range of its applications. This paper describes a polynomial time greedy algo...