Optimal asymmetric encryption padding: Difference between revisions

Content deleted Content added
Algorithm: Move sentence for sake of clarity
Algorithm: Hash functions are not random oracles, though we sometimes model them as if they were for proofs.
Line 25:
* ''k''<sub>0</sub> and ''k''<sub>1</sub> are integers fixed by the protocol.
* ''m'' is the plaintext message, an (''n''&nbsp;−&nbsp;''k''<sub>0</sub>&nbsp;−&nbsp;''k''<sub>1</sub> )-bit string
* ''G'' and ''H'' are [[randomcryptographic oraclehash function]]s such(modelled in the proof as [[cryptographicrandom hash functionoracle]]s.)
* ⊕ is an xor operation.