DEV Community

Cover image for Vulnerabilities in Cryptographic Algorithms
Tanmay Khatri
Tanmay Khatri

Posted on

1

Vulnerabilities in Cryptographic Algorithms

We all have used Cryptographic algorithms to Secure our data and passwords.
But are they all completely secure?
Let's see for the two most common ones

SHA2 (256, 512, 224, 384)

This family of hash functions relies on sounds and numbers to create a checksum value. The resultant checksums are vulnerable to length extension attacks, which involve a hacker reconstructing the internal state of a file by learning its hash digest.

Public attacks on SHA-2 have been happening since 2008. Just like what happened with SHA-1, the attacks against SHA-2 have been getting increasingly better and weakening SHA-2 over time. Some attacks have SHA-2’s effective protection down to 237. Some of the latest attacks, publicly announced in 2016, consider SHA-2 attacks to already be “practical”.

MD5

This hash function creates a checksum value, but each data will not necessarily have a unique hash, so it is open to vulnerabilities if a hacker swaps out some data with the same checksum value.

Desired hash with a different plaintext can be generated maliciously in MD5.


So we are not that safe as we thought to be...

To Know More Visit:

  1. Know about Checksums
  2. ISC2 Community
  3. Stack Exchange

Image of Timescale

🚀 pgai Vectorizer: SQLAlchemy and LiteLLM Make Vector Search Simple

We built pgai Vectorizer to simplify embedding management for AI applications—without needing a separate database or complex infrastructure. Since launch, developers have created over 3,000 vectorizers on Timescale Cloud, with many more self-hosted.

Read full post →

Top comments (0)

Billboard image

The Next Generation Developer Platform

Coherence is the first Platform-as-a-Service you can control. Unlike "black-box" platforms that are opinionated about the infra you can deploy, Coherence is powered by CNC, the open-source IaC framework, which offers limitless customization.

Learn more