DocumentCode
2366996
Title
Hash Function with Variable Output Length
Author
Ryu, JongHo ; Na, Jungchan
Author_Institution
Knowledge-based Inf. Security & Safety Res. Dept., Electron. & Telecommun. Res. Inst., Daejeon, South Korea
fYear
2009
fDate
25-27 Aug. 2009
Firstpage
600
Lastpage
605
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, in equivalent in structure, mutually uncorrelated and SAC (strict avalanche criterion).
Keywords
cryptography; data compression; message authentication; variable length codes; 0-1 balancedness; arbitrary input message compressesion; computer communications; hash function; mathematically complex algorithm; strict avalanche criterion; user message authentication service; Algorithm design and analysis; Application software; Boolean functions; Cryptography; Information security; Message authentication; Safety; Telecommunication computing; Hashing Algorithm; Hashing Function;
fLanguage
English
Publisher
ieee
Conference_Titel
INC, IMS and IDC, 2009. NCM '09. Fifth International Joint Conference on
Conference_Location
Seoul
Print_ISBN
978-1-4244-5209-5
Electronic_ISBN
978-0-7695-3769-6
Type
conf
DOI
10.1109/NCM.2009.395
Filename
5331784
Link To Document