Optimal asymmetric encryption padding: Difference between revisions

Revision as of 18:16, 5 March 2008

Revision as of 19:47, 5 March 2008

Line 27:

# messages are padded with k1 zeros to be n-k0 bits in length

# r is a random k0 bit string

# G is a hashmask generation function from k0 bits to n - k0 bits

# H is a hashmask generation function from n - k0 bits to k0 bits.

# The output is X || Y where X is shown in the diagram as the leftmost two blocksblock and Y as the rightmost block.

# Then X = m00..0 + G(r)and Y = r + H(X)

# To decode, recover the random string as r = y + H(X) then the message as m00..0 = X + G(r)

==References==