The Network Security. Org

RSS Feed

C0D3 CR4CK3D: Means and Methods to Compromise Common Hash Algorithms

August 9th, 2006 · No Comments


Hashing has long been used as a means to verify data elements. Parity bits were originally used to Security.jpgconfirm that a data transmission was received correctly and helped to detect any single-bit errors. However, parity didn’t add any value if multiple bits in the data had errors. As a result, a second trend then came about called CRC – Cyclic Redundancy Checks. These CRCs, based on polynomials, were used to detect errors in the data elements via a hash. Although this approach is more robust than parity bits, weaknesses in this algorithm also came to pass. A user could modify a file and easily sculpt the file’s contents to create the same CRC as the original file [5]. As such, we needed another way to verify our data files.

In comes hashing as we know it today. The modern hashing algorithms are designed to help verify the integrity of a data element. Yet, as our needs to verify file contents and data transmissions evolve, we continually realize that better solutions and algorithms are needed. Better hashing algorithms are constantly in the works. However, as the past would indicate, cryptographers and hackers alike continue to find issues with each successive algorithm that is released. As one algorithm is broken, another is developed – so the cycle continues. This paper will discuss the means and methods used to compromise these hashing functions and ways to protect yourself, and your data. Infosecwriters.com

From around the Web

  • Advertisments