Re: creating byte[] with subfields
On 1/18/13 11:24 PM, Roedy Green wrote:
On Fri, 18 Jan 2013 15:16:45 -0800, Daniel Pitts
<newsgroup.nospam@virtualinfinity.net> wrote, quoted or indirectly
quoted someone who said :
FWIW, XOR encryption is more like XOR obfuscation. It doesn't actually
encrypt, at least not the naive approach to it.
It depends. I just finished a project which I will be permitted to
release into the public domain in a year which uses one time pads,
which XOR messages with strings of truly random bits.
The only way you can crack it is to crack the machine at either end or
intercept the key transfer. You can't do it just by studying
messages.
It really does depend.
If the plain-text are formed poorly (eg. plain ascii text, or contains
any well known substrings), and the key is sufficiently small (needs to
be repeated several times) one could easily figure out the key, or at
least part of it. That could be enough to turn it into a simple word
game, which will eventually reveal the entire plain-text.