Summary: Hash algorithm vulnerable to algorithmic complexity
           Product: D
           Version: D1 & D2
          Platform: Other
        OS/Version: All
            Status: NEW
          Severity: normal
          Priority: P2
         Component: druntime

--- Comment #0 from Walter Bright <> 2011-12-28 
22:24:41 PST ---

The hash functions used in the associative array implementation have a worst
case performance of O(n*n). This can be exploited to produce denial-of-service
attacks on a web service using these hash functions. The paper suggests ways to
mitigate it.

Configure issuemail:
------- You are receiving this mail because: -------

Reply via email to