Optimal asymmetric encryption padding: Difference between revisions

Content deleted Content added
Line 31:
To encode,
# messages are padded with ''k''<sub>1</sub> zeros to be ''n''&nbsp;&minus;&nbsp;''k''<sub>0</sub> bits in length.
# ''r'' is a random ''k''<sub>0</sub> -bit string
# ''G'' expands the ''k''<sub>0</sub> bits of ''r'' to ''n''&nbsp;&minus;&nbsp;''k''<sub>0</sub> bits.
# ''X'' = ''m''00..0 &oplus; ''G''(''r'')