The week's pick
Reseach Article
Advanced SHA-1 Algorithm Ensuring Stronger Data Integrity
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 130 - Number 8 |
| Year of Publication: 2015 |
| Authors: Siddhartha Rao |
10.5120/ijca2015907056
|
Siddhartha Rao . Advanced SHA-1 Algorithm Ensuring Stronger Data Integrity. International Journal of Computer Applications. 130, 8 ( November 2015), 25-27. DOI=10.5120/ijca2015907056
Abstract
SHA-1 is a widely used cryptographic hashing algorithm for validating the integrity of data. Until recently, SHA-1 was considered to be the most secure hashing algorithm and also remains the most widely used hashing function till date. In this paper, we review various collision search attacks on the original full 80-step SHA-1 algorithm and present a new optimized version of the algorithm that reduces the chance of collision and increases the theoretical lower bound of the time complexity required to detect such a collision by an exponential factor of 2.
References
- Xiaoyun Wang, Yiqun Lisa Yin, Hongbo Yu, Finding Collisions in the Full SHA-1, Crypto, 2005.
- SHA-1. Available online: http://en.wikipedia.org/wiki/SHA-1.
- Jeff Phreshing, http://preshing.com/20110504/hash-collision-probabilities/, 2011.
- Collision attack. Available online: http://en.wikipedia.org/wiki/Collision_attack.
- Mieliestronk's list of more than 58 000 English words: http://www.mieliestronk.com/wordlist.html.
- Dave Rockvam, SHA-2 Migration, Pt. 4, 2014.
- Bart Preneel, The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition, 2007.
Index Terms
Keywords