C0D3 CR4CK3D: Means and Methods to Compromise Common Hash Algorithms

    Date07 Aug 2006
    Posted ByBrittany Day
    Hashing has long been used as a means to verify data elements. Parity bits were originally used to confirm that a data transmission was received correctly and helped to detect any single-bit errors. However, parity didn 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
    You are not authorised to post comments.

    LinuxSecurity Poll

    Has your email account ever been pwned in a data breach?

    No answer selected. Please try again.
    Please select either existing option or enter your own, however not both.
    Please select minimum 0 answer(s) and maximum 2 answer(s).

    We use cookies to provide and improve our services. By using our site, you consent to our Cookie Policy.