This vulnerability exposes encrypted data to a number of attacks whose goal is to recover the plaintext.
Why is this an issue?
Encryption algorithms are essential for protecting sensitive information and ensuring secure communications in a variety of domains. They are used
for several important reasons:
- Confidentiality, privacy, and intellectual property protection
- Security during transmission or on storage devices
- Data integrity, general trust, and authentication
When selecting encryption algorithms, tools, or combinations, you should also consider two things:
- No encryption is unbreakable.
- The strength of an encryption algorithm is usually measured by the effort required to crack it within a reasonable time frame.
For these reasons, as soon as cryptography is included in a project, it is important to choose encryption algorithms that are considered strong and
secure by the cryptography community.
For AES, the weakest modes are CBC (Cipher Block Chaining) and ECB
(Electronic Codebook), as they are either vulnerable to padding oracles or do not provide authentication mechanisms.
And for RSA, the weakest algorithms are either using it without padding or using the PKCS1v1.5 padding scheme.
What is the potential impact?
The cleartext of an encrypted message might be recoverable. Additionally, it might be possible to modify the cleartext of an encrypted message.
Below are some real-world scenarios that illustrate possible impacts of an attacker exploiting the vulnerability.
Theft of sensitive data
The encrypted message might contain data that is considered sensitive and should not be known to third parties.
By using a weak algorithm the likelihood that an attacker might be able to recover the cleartext drastically increases.
Additional attack surface
By modifying the cleartext of the encrypted message it might be possible for an attacker to trigger other vulnerabilities in the code. Encrypted
values are often considered trusted, since under normal circumstances it would not be possible for a third party to modify them.
How to fix it in Botan
Code examples
Noncompliant code example
Example with a symmetric cipher, AES:
#include <botan/cipher_mode.h>
void encrypt() {
Botan::Cipher_Mode::create("AES-256/ECB", Botan::ENCRYPTION); // Noncompliant
}
Example with an asymmetric cipher, RSA:
#include <botan/rng.h>
#include <botan/auto_rng.h>
#include <botan/rsa.h>
#include <botan/pubkey.h>
void encrypt() {
std::unique_ptr<Botan::RandomNumberGenerator> rng(new Botan::AutoSeeded_RNG);
Botan::RSA_PrivateKey rsaKey(*rng.get(), 2048);
Botan::PK_Encryptor_EME(rsaKey, *rng.get(), "PKCS1v15"); // Noncompliant
}
Compliant solution
For the AES symmetric cipher, use the GCM mode:
#include <botan/cipher_mode.h>
void encrypt() {
Botan::Cipher_Mode::create("AES-256/GCM", Botan::ENCRYPTION);
}
For the RSA asymmetric cipher, use the Optimal Asymmetric Encryption Padding (OAEP):
#include <botan/rng.h>
#include <botan/auto_rng.h>
#include <botan/rsa.h>
#include <botan/pubkey.h>
void encrypt() {
std::unique_ptr<Botan::RandomNumberGenerator> rng(new Botan::AutoSeeded_RNG);
Botan::RSA_PrivateKey rsaKey(*rng.get(), 2048);
Botan::PK_Encryptor_EME(rsaKey, *rng.get(), "OAEP");
}
How does this work?
As a rule of thumb, use the cryptographic algorithms and mechanisms that are considered strong by the cryptographic community.
Appropriate choices are currently the following.
For AES: Use Galois/Counter mode (GCM)
GCM mode combines encryption with authentication and integrity checks using a cryptographic hash function and provides both confidentiality and
authenticity of data.
Other similar modes are:
- CCM:
Counter with CBC-MAC
- CWC:
Cipher Block Chaining with Message Authentication Code
- EAX:
Encrypt-and-Authenticate
- IAPM:
Integer Authenticated Parallelizable Mode
- OCB:
Offset Codebook Mode
It is also possible to use AES-CBC with HMAC for integrity checks. However, it
is considered more straightforward to use AES-GCM directly instead.
For RSA: use the OAEP scheme
The Optimal Asymmetric Encryption Padding scheme (OAEP) adds randomness and a secure hash function that strengthens the regular inner workings of
RSA.
How to fix it in CryptoPP
Code examples
Noncompliant code example
Example with a symmetric cipher, AES:
#include <cryptopp/aes.h>
#include <cryptopp/modes.h>
voic encrypt() {
CryptoPP::CBC_Mode<CryptoPP::AES>::Encryption(); // Noncompliant
}
Example with an asymmetric cipher, RSA:
#include <cryptopp/rsa.h>
void encrypt() {
CryptoPP::RSAES<CryptoPP::PKCS1v15>::Encryptor(); // Noncompliant
}
Compliant solution
For the AES symmetric cipher, use the GCM mode:
#include <cryptopp/aes.h>
#include <cryptopp/modes.h>
void encrypt() {
CryptoPP::GCM<CryptoPP::AES>::Encryption();
}
For the RSA asymmetric cipher, use the Optimal Asymmetric Encryption Padding (OAEP):
#include <cryptopp/rsa.h>
void encrypt() {
CryptoPP::RSAES<CryptoPP::OAEP<CryptoPP::SHA1>>::Encryptor();
}
How does this work?
As a rule of thumb, use the cryptographic algorithms and mechanisms that are considered strong by the cryptographic community.
Appropriate choices are currently the following.
For AES: Use Galois/Counter mode (GCM)
GCM mode combines encryption with authentication and integrity checks using a cryptographic hash function and provides both confidentiality and
authenticity of data.
Other similar modes are:
- CCM:
Counter with CBC-MAC
- CWC:
Cipher Block Chaining with Message Authentication Code
- EAX:
Encrypt-and-Authenticate
- IAPM:
Integer Authenticated Parallelizable Mode
- OCB:
Offset Codebook Mode
It is also possible to use AES-CBC with HMAC for integrity checks. However, it
is considered more straightforward to use AES-GCM directly instead.
For RSA: use the OAEP scheme
The Optimal Asymmetric Encryption Padding scheme (OAEP) adds randomness and a secure hash function that strengthens the regular inner workings of
RSA.
How to fix it in OpenSSL
Code examples
Noncompliant code example
Example with a symmetric cipher, AES:
#include <openssl/evp.h>
void encrypt() {
EVP_aes_128_cbc(); // Noncompliant
}
Example with an asymmetric cipher, RSA:
#include <openssl/rsa.h>
void encrypt() {
RSA_public_decrypt(flen, from, to, key, RSA_SSLV23_PADDING); // Noncompliant
}
Compliant solution
For the AES symmetric cipher, use the GCM mode:
#include <openssl/evp.h>
void encrypt() {
EVP_aes_128_gcm();
}
For the RSA asymmetric cipher, use the Optimal Asymmetric Encryption Padding (OAEP):
#include <openssl/rsa.h>
void encrypt() {
RSA_public_decrypt(flen, from, to, key, RSA_PKCS1_OAEP_PADDING);
}
How does this work?
As a rule of thumb, use the cryptographic algorithms and mechanisms that are considered strong by the cryptographic community.
Appropriate choices are currently the following.
For AES: Use Galois/Counter mode (GCM)
GCM mode combines encryption with authentication and integrity checks using a cryptographic hash function and provides both confidentiality and
authenticity of data.
Other similar modes are:
- CCM:
Counter with CBC-MAC
- CWC:
Cipher Block Chaining with Message Authentication Code
- EAX:
Encrypt-and-Authenticate
- IAPM:
Integer Authenticated Parallelizable Mode
- OCB:
Offset Codebook Mode
It is also possible to use AES-CBC with HMAC for integrity checks. However, it
is considered more straightforward to use AES-GCM directly instead.
For RSA: use the OAEP scheme
The Optimal Asymmetric Encryption Padding scheme (OAEP) adds randomness and a secure hash function that strengthens the regular inner workings of
RSA.
Resources
Articles & blog posts
Standards
