🚀 go-pugleaf

In article <1992Jul31.153719.28374@ncsu.edu> Webbge@che17.ncsu.EDU (Greg Earl Webb) writes:
>
>I've seen some interesting posts here recently, but I have yet to
>see the topic of padding data with garbage.  It seems to me that
>if you had an algorithm that would not only encrypt the data, but would
>also insert random data into the original data (without following
>a regular pattern) that it would be almost impossible for someone
>to tell what was real information and what was just junk.  Although
>the size of the document would increase, the difficulty in decrypting
>the message would also increase considerably.
>
>The only problem I can see with this method is how do you insert data
>in a non-regular pattern and still have the ability to remove it later.
>Please comment on this type of procedure.  I'm sure people have thought
>on these lines before and would be interested in seeing what they have
>to say......
>
>			Greg Webb
>

I have thought about this scheme at one point in time.  It is not
difficult to implement but it is not superior to random padding.
Actually it is less efficient.  One way to realize the scheme is to
have a pseudorandom binary string which is derived from the encryption
key, say:

	100111010100101010001110101010001...

If the i-th bit of this string is 1, the i-th symbol in the ciphertext
is taken from the plaintext.  Otherwise, the i-th symbol is randomly
chosen.