sha256crypt and sha512crypt through 0.6 allow attackers to cause a denial of service (CPU consumption) because the algorithms runtime is proportional to the square of the length of the password.
The product allocates a reusable resource or group of resources on behalf of an actor without imposing any restrictions on the size or number of resources that can be allocated, in violation of the intended security policy for that actor.
| Name | Vendor | Start Version | End Version |
|---|---|---|---|
| Sha256crypt | Sha256crypt_project | * | 0.6 (including) |
| Sha512crypt | Sha512crypt_project | * | 0.6 (including) |
| Dietlibc | Ubuntu | bionic | * |
| Dietlibc | Ubuntu | impish | * |
| Dietlibc | Ubuntu | kinetic | * |
| Dietlibc | Ubuntu | lunar | * |
| Dietlibc | Ubuntu | mantic | * |
| Dietlibc | Ubuntu | trusty | * |
| Dietlibc | Ubuntu | xenial | * |
| Eglibc | Ubuntu | trusty | * |
| Eglibc | Ubuntu | trusty/esm | * |
| Glibc | Ubuntu | bionic | * |
| Glibc | Ubuntu | impish | * |
| Glibc | Ubuntu | kinetic | * |
| Glibc | Ubuntu | lunar | * |
| Glibc | Ubuntu | mantic | * |
| Glibc | Ubuntu | xenial | * |
| Sssd | Ubuntu | bionic | * |
| Sssd | Ubuntu | impish | * |
| Sssd | Ubuntu | kinetic | * |
| Sssd | Ubuntu | lunar | * |
| Sssd | Ubuntu | mantic | * |
| Sssd | Ubuntu | trusty | * |
| Sssd | Ubuntu | xenial | * |
| Syslinux | Ubuntu | bionic | * |
| Syslinux | Ubuntu | impish | * |
| Syslinux | Ubuntu | kinetic | * |
| Syslinux | Ubuntu | lunar | * |
| Syslinux | Ubuntu | mantic | * |
| Syslinux | Ubuntu | trusty | * |
| Syslinux | Ubuntu | trusty/esm | * |
| Syslinux | Ubuntu | xenial | * |
| Syslinux-legacy | Ubuntu | bionic | * |
| Syslinux-legacy | Ubuntu | trusty | * |
| Syslinux-legacy | Ubuntu | xenial | * |
| Uclibc | Ubuntu | trusty | * |
| Uclibc | Ubuntu | xenial | * |
| Zabbix | Ubuntu | bionic | * |
| Zabbix | Ubuntu | impish | * |
| Zabbix | Ubuntu | kinetic | * |
| Zabbix | Ubuntu | lunar | * |
| Zabbix | Ubuntu | mantic | * |
| Zabbix | Ubuntu | trusty | * |
| Zabbix | Ubuntu | trusty/esm | * |
| Zabbix | Ubuntu | xenial | * |
Code frequently has to work with limited resources, so programmers must be careful to ensure that resources are not consumed too quickly, or too easily. Without use of quotas, resource limits, or other protection mechanisms, it can be easy for an attacker to consume many resources by rapidly making many requests, or causing larger resources to be used than is needed. When too many resources are allocated, or if a single resource is too large, then it can prevent the code from working correctly, possibly leading to a denial of service.
Assume all input is malicious. Use an “accept known good” input validation strategy, i.e., use a list of acceptable inputs that strictly conform to specifications. Reject any input that does not strictly conform to specifications, or transform it into something that does.
When performing input validation, consider all potentially relevant properties, including length, type of input, the full range of acceptable values, missing or extra inputs, syntax, consistency across related fields, and conformance to business rules. As an example of business rule logic, “boat” may be syntactically valid because it only contains alphanumeric characters, but it is not valid if the input is only expected to contain colors such as “red” or “blue.”
Do not rely exclusively on looking for malicious or malformed inputs. This is likely to miss at least one undesirable input, especially if the code’s environment changes. This can give attackers enough room to bypass the intended validation. However, denylists can be useful for detecting potential attacks or determining which inputs are so malformed that they should be rejected outright.
Mitigation of resource exhaustion attacks requires that the target system either:
The first of these solutions is an issue in itself though, since it may allow attackers to prevent the use of the system by a particular valid user. If the attacker impersonates the valid user, they may be able to prevent the user from accessing the server in question.
The second solution can be difficult to effectively institute – and even when properly done, it does not provide a full solution. It simply requires more resources on the part of the attacker.
If the program must fail, ensure that it fails gracefully (fails closed). There may be a temptation to simply let the program fail poorly in cases such as low memory conditions, but an attacker may be able to assert control before the software has fully exited. Alternately, an uncontrolled failure could cause cascading problems with other downstream components; for example, the program could send a signal to a downstream process so the process immediately knows that a problem has occurred and has a better chance of recovery.
Ensure that all failures in resource allocation place the system into a safe posture.
Use resource-limiting settings provided by the operating system or environment. For example, when managing system resources in POSIX, setrlimit() can be used to set limits for certain types of resources, and getrlimit() can determine how many resources are available. However, these functions are not available on all operating systems.
When the current levels get close to the maximum that is defined for the application (see CWE-770), then limit the allocation of further resources to privileged users; alternately, begin releasing resources for less-privileged users. While this mitigation may protect the system from attack, it will not necessarily stop attackers from adversely impacting other users.
Ensure that the application performs the appropriate error checks and error handling in case resources become unavailable (CWE-703).