BROWSE
Detail
Conference Paper
Hash Function with Variable Output Length
Cited 1 time in 
Share 
Share
- Authors
- Jong Ho Ryu, Jung Chan Na
- Issue Date
- 2009-08
- Citation
- International Joint Conference on INC, IMS and IDC NCM (NCM) 2009, pp.600-605
- Publisher
- IEEE
- Language
- English
- Type
- Conference Paper
- Abstract
- A hashing function is the mathematically complex algorithm that compresses an arbitrary input message into a fixed-length value, and it can be applicable for providing the message integrity and user message authentication service in the field of the various computer communications. Secure hashing function should have the following properties, such as one-wayness, collision-free and high-speedy behavior. In this paper, we propose a secure hashing algorithm which has a variable output length of 128, 160, 192, 224, 256 bits-length for practical applications. This hashing algorithm processes the input message blocks in 1024-bits, and is processed very fast by deploying the computational array effectively. Our proposed algorithm is promoted with respect to the efficiency and security compared with existing hash algorithm, since it satisfies 0-1 balancedness, high non-linearity, inequivalent in structure, mutually uncorrelated and SAC(Strict Avalanche Criterion). © 2009 IEEE.
- KSP Keywords
- Hash Function, Hash algorithm, Hashing Function, Message authentication, Non-Linearity, Strict avalanche criterion, collision-free, complex algorithm, message integrity, practical application, secure hashing algorithm