Optimal asymmetric encryption padding: Difference between revisions

Revision as of 16:28, 3 April 2019

Revision as of 16:32, 3 April 2019

Line 19:

==Algorithm==

[[Image:Oaep-diagram-20080305.png|thumb|upright=1.2|right|OAEP Diagramis a [[Feistel network]]]]

In the diagram,

Line 25:

* ''k''₀ and ''k''₁ are integers fixed by the protocol.

* ''m'' is the plaintext message, an (''n'' − ''k''₀ − ''k''₁ )-bit string

* ''G'' and ''H'' are typically[[random someoracles]] such as [[cryptographic hash function]]s fixed by the protocol.

* ⊕ is an xor operation.

Line 45:

===Implementation===

In the PKCS#1 standard, the hashrandom functionsoracles ''G'' and ''H'' identical. The PKCS#1 standard further requires that the hashrandom functionsoracles be based on [[MGF1]] with an appropriate hash function.<ref>{{Cite journal|url=https://eprint.iacr.org/2006/223.pdf| title=What Hashes Make RSA-OAEP Secure?|journal = IACR Cryptology ePrint Archive| last=Brown |first=Daniel R. L.| date=2006| language=en|access-date=2019-04-03}}</ref>

==See also==