Metraipolis › archive › dc_b03e62a2ae3a

Optimal asymmetric encryption padding — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-05T23:03:56.391Z
SHA-256 of the archived text
6136aabcda167e79fd12a5433766e3f77ecfab30623874434697e46fae22fef3
Stable URL of this page
https://metraipolis.com/documento/dc_b03e62a2ae3a

How to cite

Optimal asymmetric encryption padding — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_b03e62a2ae3a (Metraipolis archive dc_b03e62a2ae3a, sha256 6136aabcda167e79fd12a5433766e3f77ecfab30623874434697e46fae22fef3)
BibTeX
@misc{dcb03e62a2ae3a,
  title = {Optimal asymmetric encryption padding — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_b03e62a2ae3a; sha256 6136aabcda167e79fd12a5433766e3f77ecfab30623874434697e46fae22fef3},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In cryptography, optimal asymmetric encryption padding (OAEP) is a padding scheme often used together with RSA encryption. OAEP was introduced by Bellare and Rogaway, and subsequently standardized in PKCS #1 v2 and RFC 2437. The OAEP algorithm is a form of Feistel network which uses a pair of random oracles G and H to process the plaintext prior to asymmetric encryption. When combined with any secure trapdoor one-way permutation f {\displaystyle f} , this processing is proved in the random oracle model to result in a combined scheme which is semantically secure under chosen-plaintext attack (IND-CPA). When implemented with certain trapdoor permutations (e.g., RSA), OAEP is also proven to be secure against chosen-ciphertext attack. OAEP can be used to build an all-or-nothing transform. OAEP satisfies the following two goals: Add an element of randomness which can be used to convert a deterministic encryption scheme (e.g., traditional RSA) into a probabilistic scheme. Prevent partial decryption of ciphertexts (or other information leakage) by ensuring that an adversary cannot recover any portion of the plaintext without being able to invert the trapdoor one-way permutation f {\displaystyle f} . The original version of OAEP (Bellare/Rogaway, 1994) showed a form of "plaintext awareness" (which they claimed implies security against chosen-ciphertext attack) in the random oracle model when OAEP is used with any trapdoor permutation. Subsequent results contradicted this claim, showing that OAEP was only IND-CCA1 secure. However, the original scheme was proved in the random oracle model to be IND-CCA2 secure when OAEP is used with the RSA permutation using standard encryption exponents, as in the case of RSA-OAEP. An improved scheme (called OAEP+) that works with any trapdoor one-way permutation was offered by Victor Shoup to solve this problem. More recent work has shown that in the standard model (that is, when hash functions are not modeled as random oracles) it is impossible to prove the IND-CCA2 security of RSA-OAEP under the assumed hardness of the RSA problem.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «EdDSA»).
Fonte: Wikipedia in inglese, voce «Optimal asymmetric encryption padding» — https://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding
Wikidata Q1635634 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1635634
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1338977327, consultata il 2026-10-05T23:00:15.597Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: e2797127bc2c9acbcf626eb4e2555004c5243a6322f1270b165bc6fb56c57115