• A padding scheme often used together with RSA encryption. OAEP was introduced in 1994 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 ƒ, 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. ← Wikipedia

1. More about this term (beta): articles and videos, books, web search
2. Previous term: OPFS
3. Next term: Optimization
4. Random term: Perceived performance (or roll the dice with webglossary.info/random)