NetNews Usenet Archive 1992 #30/NN_1992_30.iso/spool/comp/lang/c/18548

Internet Message Format | 1992-12-17 | 3.8 KB

Xref: sparky comp.lang.c:18548 comp.lang.c++:18143 comp.lang.pascal:7551
Newsgroups: comp.lang.c,comp.lang.c++,comp.lang.pascal
Path: sparky!uunet!newsgate.watson.ibm.com!yktnews!admin!wo0z!lwloen
From: [e-mail] (Larry Loen)
Subject: Re: Encryption algorythm/code needed...
Sender: [e-mail]
Message-ID: <[e-mail]>
Date: Thu, 17 Dec 1992 19:03:05 GMT
Reply-To: [e-mail]
Disclaimer: This posting represents the poster's views, not necessarily those of IBM
References: <[e-mail]> <[e-mail]> <[e-mail]> <[e-mail]>
Nntp-Posting-Host: wo0z.rchland.ibm.com
Organization: IBM Rochester
Lines: 68

In article <[e-mail]>, [e-mail] (Steph) writes:
|> In article <[e-mail]> [e-mail] (JAMES LEWIS NANCE) writes:
|> >
|> >In article <[e-mail]>, [e-mail] (Charles F Lane) writes:
|> >|>
|> >|> >the usernames and passwords.  The code need not be extravagent...  I only
|> >|> >need to encrypt single words (letters and numbers both).
|> >|> >
|> >
|> >|> A very easy way to encrypt data is to use a random number generator.  Suppose
|> >|> you have a string "CHAIR".  Assign a value to your random number generator's
|> >|> seed.  Then add random(256) to the ord of the first character (C, in this
|> >|> case), then random(256) + ord("H"), random(256) + ord("A"), etc.  When adding
|> >|> the random number you should wrap around if the sum is > 255.  In tp just
|> >|> disable range checking.  Decrypting is just as easy -- reassign the original
|> >|> seed value and subtract the "random" number rather than adding.  Code (TP) to
|> >|> encrypt/decrypt a string follows:
|> >|>
|> >
|> >Be careful if you use this, as it is not secure encode multiple things using
|> >the same starting seed.  For example, if you keep your entries like this:
|> >
|> >myusername:mypasswd
|> >urusername:urpasswd
|> >
|> >And you encrypt each line using this method, starting with the same initial
|> >seed, then I can take my username and password, which I know and figure out
|> >what you added to them to encrypt them.  Then I can subtract these numbers
|> >from your username and your passwd.  Since they were encrypted with the same
|> >method and the same key, this will give me your unencrypted name and password.
|> >
|> >
|> >
|> >Jim
|> >.
|> >.
|> I used the same method, with a variant : I would seed a new value to
|> my random number generator, based on the current letter.  So, you
|> start the same way (one seed), but then the encrypted data will not
|> be the same at all after but a few letters since the random number
|> generator will be shooting 'totally' different numbers.
|>
|> <
|>
|>
|> Steph.
|> Who needs a .sig?


AAAAAAAAAAAAAAAAAAAAAAAaaaaaaaaaaaaaaaauuuuuuuuuuggggggggggghhhhhh.

Sorry about that, but I had to get it out.  Nothing personal.

This vampire cannot be killed.  Please, please, please, people, give it up.
This is not something that can be done on the back of an envelope.  You
are all nicely re-inventing known methods that do not work.  They provide
more or less security, but are all well-behind the state of the art by
minimum of forty years.  You will probably defeat the programmer in the
next cublicle and thereby think you are doing well, but a real expert will
simply make mincemeat of all of this stuff.  Some of these methods don't
even require a computer to break!

Could I ask this discussion move over to sci.crypt where others can weigh
in and explain all of this?

--
   Larry W. Loen        |  My Opinions are decidedly my own, so please
                        |  do not attribute them to my employer