First published: Mon Feb 10 2025(Updated: )
The issue is twofold: decoding a DER input with sequences and locating a specific element in a sequence. Even though a DER sequence is conceptually an array, in libtasn1 it is represented as a linked list, whose elements are assigned a string name, such as "?1". Therefore a simple lookup of an element at a given position is linear O(N) time complexity. When decoding a DER sequence, in each step libtasn1 looks up the parent node, recorded on the first element, which requires a backward linear search, resulting in O(N^2) time complexity.
Affected Software | Affected Version | How to fix |
---|---|---|
Libtasn1 |
Sign up to SecAlerts for real-time vulnerability data matched to your software, aggregated from hundreds of sources.
The severity of REDHAT-BUG-2344611 has not been explicitly stated in the issue description.
To fix REDHAT-BUG-2344611, you should update to the latest version of the affected software as recommended by Red Hat.
The specific software affected by REDHAT-BUG-2344611 is not detailed in the issue summary.
REDHAT-BUG-2344611 relates to issues in decoding DER input with sequences and locating specific elements in a linked list representation.
No specific workaround for REDHAT-BUG-2344611 has been provided in the issue documentation.