Use of RSA Algorithm without OAEP |
Weakness ID: 780 (Weakness Variant) | Status: Incomplete |
Description Summary
Extended Description
Padding schemes are often used with cryptographic algorithms to make the plaintext less predictable and complicate attack efforts. The OAEP scheme is often used with RSA to nullify the impact of predictable common text.
Scope | Effect |
---|---|
Confidentiality | Without OAEP in RSA encryption, it will take less work for an attacker to decrypt the data or to infer patterns from the ciphertext. |
Example 1
The example below attempts to build an RSA cipher.
While the previous code successfully creates an RSA cipher, the cipher does not use padding. The following code creates an RSA cipher using OAEP.
Nature | Type | ID | Name | View(s) this relationship pertains to![]() |
---|---|---|---|---|
ChildOf | ![]() | 310 | Cryptographic Issues | Development Concepts (primary)699 |
ChildOf | ![]() | 327 | Use of a Broken or Risky Cryptographic Algorithm | Research Concepts (primary)1000 |
Ronald L. Rivest and Burt Kaliski. "RSA Problem". 2003-12-10. <http://people.csail.mit.edu/rivest/RivestKaliski-RSAProblem.pdf>. |
"Optimal Asymmetric SecurityDatabase\Encrypt\Encryption Padding". Wikipedia. 2009-07-08. <http://en.wikipedia.org/wiki/Optimal_Asymmetric_Encryption_Padding>. |
This entry could probably have a new parent related to improper padding, however the role of padding in cryptographic algorithms can vary, such as hiding the length of the plaintext and providing additional random bits for the cipher. In general, cryptographic problems in CWE are not well organized and further research is needed. |