Skip to content

NuytsTech Security

  • Home
  • Terms of Use
    • Privacy Policy
  • Blog
  • Cloud Hosting
  • Contact

NuytsTech Security

  • Home
  • Terms of Use
    • Privacy Policy
  • Blog
  • Cloud Hosting
  • Contact
  • Vulnerabilities

CVE-2021-3345

by Fred · 29/01/2021

_gcry_md_block_write in cipher/hash-common.c in Libgcrypt version 1.9.0 has a heap-based buffer overflow when the digest final function sets a large count value. It is recommended to upgrade to 1.9.1 or later.

Date published : 2021-01-29

https://bugs.gentoo.org/show_bug.cgi?id=767814

https://git.gnupg.org/cgi-bin/gitweb.cgi?p=libgcrypt.git;a=commit;h=512c0c75276949f13b6373b5c04f7065af750b08

Share this:

  • Click to share on X (Opens in new window) X
  • Click to share on Bluesky (Opens in new window) Bluesky
  • Click to share on Facebook (Opens in new window) Facebook
  • Click to share on LinkedIn (Opens in new window) LinkedIn
  • Click to share on Threads (Opens in new window) Threads
  • Click to share on Mastodon (Opens in new window) Mastodon

Similar

Tags: Cybersecurity Alert

  • Next story CVE-2020-14418
  • Previous story CVE-2021-3341

Recent Posts

  • CVE-2025-6081
  • CVE-2025-5967
  • CVE-2025-6940
  • CVE-2025-6939
  • CVE-2025-6938
  • CVE-2025-53096
  • CVE-2025-53095
  • CVE-2025-53003
  • CVE-2025-6937
  • CVE-2025-53005
  • CVE-2025-36056
  • CVE-2025-2141
  • CVE-2025-6936
  • CVE-2025-6935
  • CVE-2025-6932
  • CVE-2025-6931
  • CVE-2025-6930
  • CVE-2025-6554
  • CVE-2025-6929
  • CVE-2025-53004
  • CVE-2025-49521
  • CVE-2025-49520
  • CVE-2025-32463
  • CVE-2025-32462
  • CVE-2025-52997
  • CVE-2025-52996
  • CVE-2025-52995
  • CVE-2025-52901
  • CVE-2025-52491
  • CVE-2025-49493

Categories

  • Critical cyberalert
  • Vulnerabilities

Tags

CISA Cybersecurity Alert Shields Up

© 1999-2025 NUYTSTECH. All Rights Reserved. Use of the CVE (Common Vulnerabilities and Exposures) from this non-profit website are subject to the terms of use.

We use cookies to ensure that we give you the best experience on our website. If you continue to use this site we will assume that you are happy with it.