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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A New Approach 160-bit Message Digest Algorithm

by Priteshwar Nath Sallam, Jitendra Agrawal, Santosh Sahu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 38 - Number 5
Year of Publication: 2012
Authors: Priteshwar Nath Sallam, Jitendra Agrawal, Santosh Sahu
10.5120/4685-6809

Priteshwar Nath Sallam, Jitendra Agrawal, Santosh Sahu . A New Approach 160-bit Message Digest Algorithm. International Journal of Computer Applications. 38, 5 ( January 2012), 22-26. DOI=10.5120/4685-6809

@article{ 10.5120/4685-6809,
author = { Priteshwar Nath Sallam, Jitendra Agrawal, Santosh Sahu },
title = { A New Approach 160-bit Message Digest Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { January 2012 },
volume = { 38 },
number = { 5 },
month = { January },
year = { 2012 },
issn = { 0975-8887 },
pages = { 22-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume38/number5/4685-6809/ },
doi = { 10.5120/4685-6809 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:24:46.657842+05:30
%A Priteshwar Nath Sallam
%A Jitendra Agrawal
%A Santosh Sahu
%T A New Approach 160-bit Message Digest Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 38
%N 5
%P 22-26
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper introduces a new approach of MD Algorithm for security design. This approach comprises of the 160-bit hash algorithm for secure message digest. The results show that the 160-bit Message Digest Algorithm code is more secured than 128-bit Message Digest Algorithm code. This effort can alternate efficiently the accessible Message Digest Algorithm and hash function implementations for security design, so this approach proves a high security step towards design.

References
  1. R.Rivest. The MD5 Message-Digest Algorithm [rfc1321]
  2. Janaka Deepakumara, Howard M. Heys and R. Venkatesan, FPGA IMPLEMENTATION OF MD5 HASH ALGORITHM, FacuIq of Engineering and Applied Science Memorial University of Newfoundland St. John S, NF, Canada.
  3. Danyang Cao, Bingru Yang, Design and implementation for MD5-based data integrity checking system, College of Information Engineering,North China University of Technology , NCUT Beijing 100144, China
  4. X. Wang and H. Yu, “How to Break MD5 and Other Hash Functions”, in: Ronald Cramer (ed.), Advances in Cryptology - EUROCRYPT 2005, vol. 3494 of Lecture Notes in Computer Science, pages 19-35, Springer,2005.
  5. M. Stevens, “On collisions for MD5”, MSc Thesis,Eindhoven University of Technology, June 2007
  6. M. Stevens, A. Lenstra and B. de Weger “Chosen-prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities”, in Moni Naor (eds), Science, pages 1-22, Springer Verlag, Berlin, 2007.
  7. A. Sotirov, M. Stevens, J. proceedings of Advance in Cryptology - EUROCRYPT 2007, vol. 4515 of Lecture Notes in Computer Appelbaum, A. Lenstra, D. Molnar, D.A. Osvik, B. de Weger, “MD5 considered harmful today: Creating a rogu CA certificate”, 2009.
  8. Kimmo Järvinen, Matti Tommiska and Jorma Skyttä, Hardware Implementation Analysis of the MD5 Hash Algorithm, Helsinki University of Technology Signal Processing Laboratory Shenyang, China Otakaari 5 A, FIN-02150, Finland
  9. “IP Security Protocol (ipsec),” http://www.ietf.org/html.charters/ipsec-charter.html
  10. Janaka Deepakumara, Howard M. Heys and R. Venkatesan, FPGA IMPLEMENTATION OF MD5 HASH ALGORITHM, FacuIq of Engineering and Applied Science Memorial University of Newfoundland St. John S, NF, CanadaA I B 3x.
  11. MD5 Algorithm Description, http://www.cotse.com/CIE/RFC/1321/7.htm.
  12. Goldwasser, S. and Bellare, M. "Lecture Notes on Cryptography". Summer course on cryptography, MIT, 1996-2001
  13. M.M.J. Stevens (June 2007). On Collisions forMD5. http://www.win.tue.nl/hashclash/On%20Collisions%20for%20MD5%20-%20M.M.J.%20
  14. Xiaoyun Wang, Yiquin Lisa Yin, Hongobo Yu. Finding Collisions in the Full SHA-1. http://people.csail.mit.edu/yiqun/SHA1AttackProceedingVersion
  15. ChristofPaar, Jan Pelzl, Bart Preneel (2010). Understanding Cryptography: A Textbook for Students and Practitioners. Springer. p. 7. ISBN 3642041000
Index Terms

Computer Science
Information Sciences

Keywords

MD Algorithm Hash Function Data Integrity

Powered by PhDFocusTM