Computer Science – Cryptography and Security
Scientific paper
2012-04-12
Computer Science
Cryptography and Security
Accepted in 10th National Workshop on Cryptology, Department of Mathematics and Computer Applications, PSG College of Technolo
Scientific paper
Recent cryptanalytic attacks have exposed the vulnerabilities of some widely used cryptographic hash functions like MD5 and SHA-1. Attacks in the line of differential attacks have been used to expose the weaknesses of several other hash functions like RIPEMD, HAVAL. In this paper we propose a new efficient hash algorithm that provides a near random hash output and overcomes some of the earlier weaknesses. Extensive simulations and comparisons with some existing hash functions have been done to prove the effectiveness of the BSA, which is an acronym for the name of the 3 authors.
Laha Anirban
Mukherjee Subhabrata
Roy Bimal
No associations
LandOfFree
An Efficient Cryptographic Hash Algorithm (BSA) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Efficient Cryptographic Hash Algorithm (BSA), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Cryptographic Hash Algorithm (BSA) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-313216