research-article

Enhancing MD5 hash algorithm using symmetric key encryption

Authors:

Aman Shakya,

Nitesh KarnaAuthors Info & Claims

ICCSP '19: Proceedings of the 3rd International Conference on Cryptography, Security and Privacy

Pages 18 - 22

https://doi.org/10.1145/3309074.3309087

Published: 19 January 2019 Publication History

Get Access

Abstract

Message integrity and authenticity is crucial with ever increasing network communication. Cryptographic Hash Functions are main building block of message integrity. Many types of hash functions are being used and developed. In this paper, a new keyed hash function is being proposed and described. This proposed algorithm produces a hash code of 128 bits for an arbitrary length of input. The function uses a key during hashing, so that any intruder who does not know the key cannot forge the hash code, and, thus it satisfies the purpose of security, authentication and integrity for a message in network. The paper discusses the algorithm on the function design, its security aspects and implementation details.

References

[1]

Stallings, W. 2011. Cryptography And Network Security principles and practice. Prentice Hall.

Digital Library

Google Scholar

[2]

Stevens, M. 2012. MD5 collision attack. In Proceedings of the Attacks of Hash Functions and Applications, Amsterdam, geboren te Hellevoetsluis, 27--30.

Google Scholar

[3]

Xie, T. and Liu, F. 2014. Fast Collision Attack on MD5. The Center for Soft-Computing and Cryptology, China.

Google Scholar

[4]

Garuavaram, P. 2007. Cryptographic hash Functions: Cryptanalysis, Design and Applications, Brisbane, Australia.

Google Scholar

[5]

Stevens, M. and Sotirov, A. 2009. Short Chosen-Prefix Collisions for MD5. International Association for Cryptologic Research, vol. 1, no. 7, 55--69.

Google Scholar

[6]

Jasek, R., Sarga, L. and Benda, R. 2013. Security Review of the SHA-1 and MD5 Cryptographic Hash Algorithms. Zlin.

Google Scholar

[7]

Arya, R. P., Mishra, U. and Bansal, A. 2013. A Survey on Recent Cryptographic Hash Function Designs. International Journal Of Emerging Trends and Technology in Computer Science (IJETTCS), vol. 2, no. 1, 117--123.

Google Scholar

[8]

Mohammed, S. A. and Al-Kuwari. 2011. Integrated-Key Cryptographic Hash Function. PhD. Thesis submitted to University of Bath, Department of Computer Science.

Google Scholar

[9]

Bellare, M. and Tadayoshi. 2004. Hash Function Balance and its Impact on Birthday Attacks. In Proceedings of the Eurocrypt '04, LNCS Springer-Verlag, 401-- 418.

Crossref

Google Scholar

[10]

Thapar, V. and Walia, P. 2014. Implementation of New Modified MD5--512 bit Algorithm for Cryptography. International Journal of Innovative Research in Advanced Engineering (IJIRAE), vol. 1, no. 6, 87--96.

Google Scholar

[11]

Sharma, D. and Sarao, P. 2015. Implementation of MD5- 640 Bits Algorithm. International Journal of Advance Research in Computer Science and Management Studies, vol. 3, no. 5, 286--294.

Google Scholar

[12]

Chan, X. and Liu, G. 2007. Discussion of One Improved Hash Algorithm Based on MD5 and SHA1. IOSR Journal of Computer Engineering (IOSRJCE), vol. 2, no. 1, 36--42.

Google Scholar

[13]

Kasgar, A. K. and Dhariwal, M. K. 2013. A Review Paper of Message Digest 5 (MD5). International Journal of Modern Engineering & Management Research, vol. 1, no. 4, 29--35.

Google Scholar

Cited By

View all

Athavale VArora SAthavale AYadav R(2022)One-Way Cryptographic Hash Function Securing NetworksProceedings of Academia-Industry Consortium for Data Science10.1007/978-981-16-6887-6_10(105-113)Online publication date: 1-Feb-2022
https://doi.org/10.1007/978-981-16-6887-6_10
Shukla VMisra MChaturvedi A(2021)A new authentication procedure for client-server applications using HMACJournal of Discrete Mathematical Sciences and Cryptography10.1080/09720529.2021.193290824:5(1241-1256)Online publication date: 2-Sep-2021
https://doi.org/10.1080/09720529.2021.1932908
Mohammed Ali AKadhim Farhan A(2020)A Novel Improvement With an Effective Expansion to Enhance the MD5 Hash Function for Verification of a Secure E-DocumentIEEE Access10.1109/ACCESS.2020.29890508(80290-80304)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2989050

Index Terms

Enhancing MD5 hash algorithm using symmetric key encryption
1. Security and privacy
  1. Cryptography
    1. Symmetric cryptography and hash functions
      1. Hash functions and message authentication codes

Recommendations

Efficient revocable certificateless encryption against decryption key exposure

Certificateless public key cryptosystem (CLPKC) improves the identity based public key cryptosystem to be key‐escrow free. Many research works on CLPKC have been presented so far. However, the revocation problem in CLPKC still lacks effective solutions. ...
Signcryption from randomness recoverable public key encryption

We propose a new generic construction for signcryption and show that it is secure under the security models which are comparable to the security against adaptive chosen ciphertext attacks for public key encryption and the existential unforgeability ...
Public‐key encryption indistinguishable under plaintext‐checkable attacks

Indistinguishability under chosen‐ciphertext attack (IND‐CCA) is now considered the de facto security notion for public‐key encryption. However, this sometimes offers a stronger security guarantee than what is needed. In this study, the authors consider a ...

Comments

Information & Contributors

Information

Published In

ICCSP '19: Proceedings of the 3rd International Conference on Cryptography, Security and Privacy

January 2019

303 pages

ISBN:9781450366182

DOI:10.1145/3309074

Conference Chairs:
Yulin Wang
Wuhan University, China
,
Chin-Chen Chang
Feng Chia University, Taiwan

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 January 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICCSP 2019

ICCSP 2019: 2019 the 3rd International Conference on Cryptography, Security and Privacy

January 19 - 21, 2019

Kuala Lumpur, Malaysia

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
214
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Athavale VArora SAthavale AYadav R(2022)One-Way Cryptographic Hash Function Securing NetworksProceedings of Academia-Industry Consortium for Data Science10.1007/978-981-16-6887-6_10(105-113)Online publication date: 1-Feb-2022
https://doi.org/10.1007/978-981-16-6887-6_10
Shukla VMisra MChaturvedi A(2021)A new authentication procedure for client-server applications using HMACJournal of Discrete Mathematical Sciences and Cryptography10.1080/09720529.2021.193290824:5(1241-1256)Online publication date: 2-Sep-2021
https://doi.org/10.1080/09720529.2021.1932908
Mohammed Ali AKadhim Farhan A(2020)A Novel Improvement With an Effective Expansion to Enhance the MD5 Hash Function for Verification of a Secure E-DocumentIEEE Access10.1109/ACCESS.2020.29890508(80290-80304)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2989050

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Efficient revocable certificateless encryption against decryption key exposure

Signcryption from randomness recoverable public key encryption

Public‐key encryption indistinguishable under plaintext‐checkable attacks

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations