Cryptography, Rsa, Cybersecurity.
r into n−k0 bits, and which is EX-OR with the padded message. This produces X. Next, we take the value and feed it into H, and which hashes the bits to produce k0 bits. This is then EX-OR (⊕) with r to produce Y (and which has k0 bits). Figure 1: Padding and unpadding for RSA OAEP We now have X and