Academic Journals Database
Disseminating quality controlled scientific knowledge

Cryptanalytic JH and BLAKE Hash Function for Authentication and Proposed Work Over BLAKE-256 Using C

ADD TO MY LIST
 
Author(s): Mr. Somil Jain

Journal: International Journal of Computer Trends and Technology
ISSN 2231-2803

Volume: 4;
Issue: 6;
Start page: 1862;
Date: 2013;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: SHA-3 | JH | BLAKE | Hash | Compression Function.

ABSTRACT
Hash functions form an important category of cryptography, which is widely used in a great number of protocols and security mechanisms. Hash functions are a fundamental primitive category of security science. It is defined as computationally efficient function, which maps binary strings of arbitrary length to binary strings of fixed length. The last ones are the outputs of a hash computation and they are called hash values. Hash functions are applied to support digital signatures, data integrity, random number generators, authentication schemes, and data integrity mechanisms. National Institute of Standard and technology (NIST) has selected the 14 Second Round Candidates of the SHA-3 Competition. It focus on the new SHA-3 competition, started by the NIST, which searches for a new hash function in response to authentication concerns regarding the previous hash functions SHA-1 and the SHA-2 family. This work is based on comparative study of two SHA-3 cryptographic hash function candidates JH and BLAKE (out of fourteen). It compares the common features of both candidates which is widely used in above mentioned applications and improvement over SHA-256 with proposed work BLAKE-256 hash function.SHA-256 is used 64 rounds to calculate 256 bit final hash value with 256 bit initial hash value but BLAKE-256 is used 14 rounds to calculate final hash value with same input length and same output length.
Why do you need a reservation system?      Affiliate Program