Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.java.programmer > #21579
| From | Daniel Pitts <newsgroup.nospam@virtualinfinity.net> |
|---|---|
| Newsgroups | comp.lang.java.programmer |
| Subject | Re: creating byte[] with subfields |
| References | <o62if8p1orppd2poseimactf3rqu0s04kn@4ax.com> <OSgKs.128923$pV4.20397@newsfe21.iad> <olijf81r5e0svadmqjavkqfholgtsqhbct@4ax.com> <xJkKs.124473$lw2.45998@newsfe30.iad> <rcikf8dvd3v6roe6urunfdgha0out6eqqd@4ax.com> |
| Message-ID | <6xLKs.77341$qb3.18716@newsfe25.iad> (permalink) |
| Date | 2013-01-19 21:46 -0800 |
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.
Back to comp.lang.java.programmer | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
creating byte[] with subfields Roedy Green <see_website@mindprod.com.invalid> - 2013-01-18 00:35 -0800
Re: creating byte[] with subfields Jim Janney <jjanney@shell.xmission.com> - 2013-01-18 08:31 -0700
Re: creating byte[] with subfields Jim Janney <jjanney@shell.xmission.com> - 2013-01-18 10:29 -0700
Re: creating byte[] with subfields Nigel Wade <nmw@ion.le.ac.uk> - 2013-01-18 16:23 +0000
Re: creating byte[] with subfields Daniel Pitts <newsgroup.nospam@virtualinfinity.net> - 2013-01-18 10:53 -0800
Re: creating byte[] with subfields Roedy Green <see_website@mindprod.com.invalid> - 2013-01-18 14:23 -0800
Re: creating byte[] with subfields Daniel Pitts <newsgroup.nospam@virtualinfinity.net> - 2013-01-18 15:16 -0800
Re: creating byte[] with subfields Roedy Green <see_website@mindprod.com.invalid> - 2013-01-18 23:24 -0800
Re: creating byte[] with subfields Daniel Pitts <newsgroup.nospam@virtualinfinity.net> - 2013-01-19 21:46 -0800
Re: creating byte[] with subfields Joshua Cranmer <Pidgeot18@verizon.invalid> - 2013-01-20 11:01 -0600
Re: creating byte[] with subfields Arne Vajhøj <arne@vajhoej.dk> - 2013-01-20 12:54 -0500
Re: creating byte[] with subfields Arne Vajhøj <arne@vajhoej.dk> - 2013-01-20 12:51 -0500
Re: creating byte[] with subfields Arne Vajhøj <arne@vajhoej.dk> - 2013-01-19 13:34 -0500
Re: creating byte[] with subfields Arne Vajhøj <arne@vajhoej.dk> - 2013-01-18 20:33 -0500
Re: creating byte[] with subfields Arne Vajhøj <arne@vajhoej.dk> - 2013-01-18 20:48 -0500
csiph-web