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-2013-2221

by Fred · 04/10/2013

Heap-based buffer overflow in the ZRtp::storeMsgTemp function in GNU ZRTPCPP before 3.2.0 allows remote attackers to cause a denial of service (crash) and possibly execute arbitrary code via a large packet.

Date published : 2013-10-04

https://github.com/wernerd/ZRTPCPP/commit/4654f330317c9948bb61d138eb24d49690ca4637

http://security.gentoo.org/glsa/glsa-201309-13.xml

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-2013-2808
  • Previous story CVE-2012-4136

Recent Posts

  • CVE-2025-4152
  • CVE-2025-4151
  • CVE-2025-3504
  • CVE-2025-3503
  • CVE-2025-3502
  • CVE-2025-4150
  • CVE-2025-4099
  • CVE-2025-3952
  • CVE-2025-4149
  • CVE-2025-4148
  • CVE-2025-2168
  • CVE-2025-1305
  • CVE-2025-1304
  • CVE-2025-2816
  • CVE-2025-4147
  • CVE-2025-4146
  • CVE-2025-4145
  • CVE-2025-4144
  • CVE-2025-4143
  • CVE-2025-4142
  • CVE-2025-4141
  • CVE-2025-4140
  • CVE-2025-4139
  • CVE-2025-30422
  • CVE-2025-24132
  • CVE-2025-4136
  • CVE-2025-27611
  • CVE-2025-2082
  • CVE-2025-46558
  • CVE-2025-46557

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.OkPrivacy policy