Revision as of 15:24, 19 July 2007 edit DRLB (talk \| contribs) 294 edits m removed one of a several repeated statements ← Previous edit		Revision as of 03:32, 1 October 2007 edit undo Jesse Viviano (talk \| contribs) Administrators 17,712 edits m Feistel is the last name of Horst Feistel, the inventor of the Feistel network, so "feistel network" is incorrect. Capitalization fix Next edit →
Line 2: [[Mihir Bellare\|M. Bellare]], [[Phillip Rogaway\|P. Rogaway]]. ''Optimal Asymmetric Encryption -- How to encrypt with RSA''. Extended abstract in Advances in Cryptology - [[Eurocrypt]] '94 Proceedings, Lecture Notes in Computer Science Vol. 950, A. De Santis ed, [[Springer-Verlag]], 1995. [http://www-cse.ucsd.edu/users/mihir/papers/oae.pdf full version (pdf)]</ref> The OAEP algorithm is a form of [[~~feistel~~Feistel network]] which uses a pair of [[random oracle]]s G and H to process the plaintext prior to [[asymmetric encryption]]. When combined with any secure [[trapdoor one-way function\|trapdoor one-way permutation]] <math>f</math>, this processing is proved in the [[random oracle model]] to result in a combined scheme which is [[semantic security\|semantically secure]] under [[chosen plaintext attack]] (IND-CPA). When implemented with certain trapdoor permutations (e.g., RSA), OAEP is also proved secure against [[chosen ciphertext attack]]. OAEP satisfies the following two goals:

Optimal asymmetric encryption padding: Difference between revisions