Email this article 
Open Access
Subscription or Fee Access
Implementation of Security Package for Data Integrity with Various Hash Algorithms
Abstract
This paper deals with the implementation of security package of Hash algorithms which can be chosen by the user for their desired level of security. The concept of encryption and decryption of message is not enough for the security of data’s in current communication. Hence the concept of Message authentication is developed. One type of authentication is by Hash algorithm. Hash algorithm creates the miniature of the message. Hash algorithm takes an input message of length less than 264 (varies with the type of algorithm) and gives the output in fixed length. For the application point of view we need the comparison of their performance. Hence this paper involves the following categories.
a Implementation of MD5 algorithm
b Implementation of SHA algorithm
c Implementation of RIPEMD algorithm
d Comparison of algorithms with respect to their
a. Speed
b. Security
e Implementation of software package.
Keywords
References
R.L.Rivest, “The MD5 Message Digest Algorithm” IETF Request for Comments.
E.Biham and R.Chen “Near Collisions of SHA-0”, Advances in Cryptology CRYPTO 2004,LNCS 3152,Spriger-Verlag,pp 290-305,2004.
NIST/NSA, “FIPS 180-2: Secure Hash Standard (SHS)”, August 2002.
R.L.Rivest, “The MD4 Message Digest Algorithm”.
On the high-throughput implementation of RIPEMD-160 hash algorithm -Leuven, Belgium 2008 International Conference on Application-Specific Systems, Architectures and Processors
A Top-Down Design Methodology for Ultrahigh-Performance Hashing Cores IEEE Transactions on Dependable and Secure Computing By Harris Michail , Athanasios Kakarountas , Athanasios Milidonis , Costas Goutis , 2009
Steven M. Bellovin, Eric K. Rescorla,”Deploying a New Hash Algorithm”-www.Columbia.edu
Bart preneel “Analysis and Design of Cryptographic Hash Functions”-2003
RSA Laborotories “Cryptobytes”-Volume 3, 1997
Mudhakar Srivatsa and Ling Liu “Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis”- www.acsac.org-2004
Jean-S´ebastien Coron “Security Proof for Partial-Domain Hash Signature Schemes-Advances in Cryptology – CRYPTO2002, vol. 2442 of Lecture Notes in Computer Science, pp. 613–626, Springer-Verlag, 2002
Adrian Perrig, Dawn Song “Hash Visualization: a New Technique to improve Real-World Security-
Mihir Bellare, Ran Canettiy, Hugo Krawczykz “Keying Hash Functions for Message Authentication”- Advances in Cryptology -Crypto 96 Proceedings, Lecture Notes in Computer Science Vol. 1109
Emmanuel Brission, Benoit Chevallier “Revisiting Security Relation Between Security schemes and Inner Hash Functions”-ECRYPT Hash Workshop 2007
The Keyed-Hash Message Authentication Code (HMAC)- Federal Information Processing Standards Publication
Ananth Raghunathan “Towards a fast and new kind of a provably secure hash function”
Mridul Nandi “Characterizing Padding Rules of MD Hash Functions Preserving Collision Security”- .iacr.org-2009
Ilya Mironov, “Hash functions: Theory, attacks, and applications”
Web Services Security UsernameToken Profile-OASIS Open 2002
Xiaoyun Wang, Dengguo Feng “Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD”
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.