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-2017-1082

by Fred · 12/09/2018

In FreeBSD 11.x before 11.1-RELEASE and 10.x before 10.4-RELEASE, the qsort algorithm has a deterministic recursion pattern. Feeding a pathological input to the algorithm can lead to excessive stack usage and potential overflow. Applications that use qsort to handle large data set may crash if the input follows the pathological pattern.

Date published : 2018-09-12

https://www.qualys.com/2017/06/19/stack-clash/stack-clash.txt

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-2018-10637
  • Previous story CVE-2016-7074

Recent Posts

  • CVE-2025-9815
  • CVE-2025-9814
  • CVE-2025-9813
  • CVE-2025-9812
  • CVE-2025-9811
  • CVE-2025-8662
  • CVE-2025-9806
  • CVE-2025-9805
  • CVE-2025-58178
  • CVE-2025-58162
  • CVE-2025-58161
  • CVE-2025-57808
  • CVE-2025-9802
  • CVE-2025-9801
  • CVE-2025-9800
  • CVE-2025-9799
  • CVE-2025-9797
  • CVE-2025-9796
  • CVE-2025-9795
  • CVE-2025-9794
  • CVE-2025-9793
  • CVE-2025-9792
  • CVE-2025-9810
  • CVE-2025-9809
  • CVE-2025-9791
  • CVE-2025-9790
  • CVE-2025-9789
  • CVE-2025-9788
  • CVE-2025-3586
  • CVE-2025-9375

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.