CHA: Concrete Hash Algorithm A NEW PROPOSED HASH FUNCTION ALGORITHM | ||||
The International Conference on Electrical Engineering | ||||
Article 6, Volume 9, 9th International Conference on Electrical Engineering ICEENG 2014, May 2014, Page 1-12 PDF (101.76 K) | ||||
Document Type: Original Article | ||||
DOI: 10.21608/iceeng.2014.30360 | ||||
View on SCiNiTO | ||||
Authors | ||||
Hadia M. El Hennawy1; Alaa E. Omar2; Salah M. Kholaif2 | ||||
1Faculty of Engineering, Ain Shams University, Cairo, Egypt. | ||||
2Technical Research Center, Cairo, Egypt. | ||||
Abstract | ||||
Cryptographic hash functions are an important tool in cryptography for applications such as digital signature of messages, message authentication, and key derivation. This paper presents a new cryptographic keyed hash function design, named Concrete Hash function Algorithm, CHA-128, which has some difference from the popular hash function designs and used for ensuring integrity of messages to a higher degree to suit the fast growing network applications. The function structure is designed permit a wide variety of implementation tradeoffs. Also CHA is proposed as very smooth 128 bit hash function algorithm, which is designed according to permit a wide variety of computing implementation tradeoffs. By very smooth, it means that the smoothness bound is multiple fixed sequential functions. A valuable comparison between the software performance of CHA-128 design and some popular hash function algorithms designs is performed. | ||||
Keywords | ||||
Hash code; Message integrity; SHA-family; Message Digest | ||||
Statistics Article View: 209 PDF Download: 253 |
||||