CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Review on Cryptographic Hashing Algorithms for Message Authentication

by Nishant Sahni
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 120 - Number 16
Year of Publication: 2015
Authors: Nishant Sahni
10.5120/21313-4290

Nishant Sahni . A Review on Cryptographic Hashing Algorithms for Message Authentication. International Journal of Computer Applications. 120, 16 ( June 2015), 29-32. DOI=10.5120/21313-4290

@article{ 10.5120/21313-4290,
author = { Nishant Sahni },
title = { A Review on Cryptographic Hashing Algorithms for Message Authentication },
journal = { International Journal of Computer Applications },
issue_date = { June 2015 },
volume = { 120 },
number = { 16 },
month = { June },
year = { 2015 },
issn = { 0975-8887 },
pages = { 29-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume120/number16/21313-4290/ },
doi = { 10.5120/21313-4290 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:06:24.322007+05:30
%A Nishant Sahni
%T A Review on Cryptographic Hashing Algorithms for Message Authentication
%J International Journal of Computer Applications
%@ 0975-8887
%V 120
%N 16
%P 29-32
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The main purpose of Message Authentication is to prevent manipulation of the message which is sent. MAC stands for Message Authentication Code which is also known as "Integrity Check Value" or "Cryptographic Checksum". The basic objectives of a hash function are to: • Prevent finding a message from a given hash value (Inversion) • Prevent finding two messages with the same hash value (Collision) On the other hand, Message Authentication Codes are mainly to prevent forgery. Thus, using hash functions for Message Authentication may get a bit complex as hash functions do not have the in-built functionality of a key. In this paper, we discuss a few popular cryptographic hashing algorithms and compare their performance with respect to each other.

References
  1. Mihir Bellare , Ran Canetti and Hugo Krawczyk "Keying hash functions for message authentication (1996)" in Advances in Cryptology – Crypto 96 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed. , Springer-Verlag, 1996. Ding, W. and Marchionini, G. 1997 A Study on Video Browsing Strategies. Technical Report. University of Maryland at College Park.
  2. H. Z. Hel-Or and Y. Yitzhaki "Geometric Hashing Techniques for Watermarking". Tavel, P. 2007 Modeling and Simulation Design. AK Peters Ltd.
  3. Burt Kaliski and Matt Robshaw "Message Authentication with MD5" in CryptoBytes volume 1, Number 1, spring 1995.
  4. D. Eastlake and P. Jones "US Secure Hash Algorithm 1 (SHA1)" September 2001. Brown, L. D. , Hua, H. , and Gao, C. 2003. A widget framework for augmented interaction in SCAPE.
  5. H. Krawczyk, M. Bellare and R. Canetti "HMAC: Keyed-Hashing for Message Authentication" February 1997. Spector, A. Z. 1989. Achieving application requirements. In Distributed Systems, S. Mullender
Index Terms

Computer Science
Information Sciences

Keywords

Hashing Algorithms Authentication Code MD5

Powered by PhDFocusTM