1. RE: Encrypting Long Numbers
- Posted by rswiston at hotmail.com
Jul 11, 2003
You could use the RSA mathematical model of encryption in which you
choose two large prime numbers. Encrypt the number and send it out...
When they call in, you run that number back through and generate the
actual release code. This method is used to encrypt most web sites and
the military has been using similar processes since WWII.
If your would like, I can send the formulas your way (along with
explanantions)... They are not very hard to use.
-Bob
-----Original Message-----
From: Lucius Hilley [mailto:l3euphoria at bellsouth.net]
Sent: Friday, July 11, 2003 3:08 PM
To: EUforum
Subject: Re: Encrypting Long Numbers
Sounds like a one way hash.
C. K. Lester wrote:
>
>
> If I had a (randomly generated) number like this:
>
> 12847-47844-37847-38475
>
> what process/algorithm could I use to encrypt it such that when a
> person reads it to me I can run it through a program and read the
> result back to them such that it would unlock the program for them to
> use it?
>
TOPICA - Start your own email discussion group. FREE!
2. RE: Encrypting Long Numbers
--- rswiston at hotmail.com wrote:
>
> You could use the RSA mathematical model of
> encryption in which you
> choose two large prime numbers. Encrypt the number
> and send it out...
> When they call in, you run that number back through
> and generate the
> actual release code. This method is used to encrypt
> most web sites and
> the military has been using similar processes since
> WWII.
>
> If your would like, I can send the formulas your way
> (along with
> explanations)... They are not very hard to use.
>
> -Bob
That would be exquisite... Thanks!
__________________________________
Do you Yahoo!?
SBC Yahoo! DSL - Now only $29.95 per month!
http://sbc.yahoo.com
3. RE: Encrypting Long Numbers
Thanks, Pete! I'll have a looksee on Monday...
> -----Original Message-----
> From: Pete Lomax [mailto:petelomax at blueyonder.co.uk]
> Subject: Re: Encrypting Long Numbers
>
>
>
> Try this CK:
>
> include sha1.e -- http://www16.brinkster.com/davitf/
> include b64.e --
> http://www.rapideuphoria.com/cgi-bin/asearch.exu?gen=on&keywords=Lomax
>
> sequence t, fluff, txt
>
> -- I assume you send it as an ascii sequence:
> t="12847-47844-37847-38475"
>
> fluff="Now CK would be real silly"&t[1..6]&
> "if he just left this here,"&t[7..12]&
> "instead of replacing it by"&t[13..18]&
> "something only he knows .."&t[19..23]
>
> txt=encode64(sha_1(fluff))
>
> printf(1,"%s\n",{txt})
>
> -- ... send that back ...
>
> if not equal(decode64(txt),sha_1(fluff)) then
> puts(1,"error\n")
> end if
>
> if getc(0) then end if
>
> Providing no-one else knows what it is you do to build fluff (which
> obviously needs to be the same at both ends), that should be pretty
> tough to break.
>
> Pete
>
>
>
> TOPICA - Start your own email discussion group. FREE!
>
> ---
> Incoming mail is certified Virus Free.
> Checked by AVG anti-virus system (http://www.grisoft.com).
> Version: 6.0.497 / Virus Database: 296 - Release Date: 7/4/2003
>
---
4. RE: Encrypting Long Numbers
Just an idea...
If you wanted, you could make fluff a sequence of bytes taken from arbitrary
(but fixed) locations from the bound executeable. Like a checksum, I guess,
but leaving the data in it's raw form, rather than compressing to a single
number.
That'd be pretty tough to break, any changes to the source code, and you
would not be able to decrypt messages from the true executeable.
=====================================================
.______<-------------------\__
/ _____<--------------------__|===
||_ <-------------------/
\__| Mr Trick
>From: "C. K. Lester" <cklester at yahoo.com>
>Reply-To: EUforum at topica.com
>To: EUforum <EUforum at topica.com>
>Subject: RE: Encrypting Long Numbers
>Date: Sun, 13 Jul 2003 23:24:21 -0500
>
>
>Thanks, Pete! I'll have a looksee on Monday...
>
> > -----Original Message-----
> > From: Pete Lomax [mailto:petelomax at blueyonder.co.uk]
> > Sent: Saturday, July 12, 2003 1:31 AM
> > To: EUforum
> > Subject: Re: Encrypting Long Numbers
> >
> >
> > Try this CK:
> >
> > include sha1.e -- http://www16.brinkster.com/davitf/
> > include b64.e --
> > http://www.rapideuphoria.com/cgi-bin/asearch.exu?gen=on&keywords=Lomax
> >
> > sequence t, fluff, txt
> >
> > -- I assume you send it as an ascii sequence:
> > t="12847-47844-37847-38475"
> >
> > fluff="Now CK would be real silly"&t[1..6]&
> > "if he just left this here,"&t[7..12]&
> > "instead of replacing it by"&t[13..18]&
> > "something only he knows .."&t[19..23]
> >
> > txt=encode64(sha_1(fluff))
> >
> > printf(1,"%s\n",{txt})
> >
> > -- ... send that back ...
> >
> > if not equal(decode64(txt),sha_1(fluff)) then
> > puts(1,"error\n")
> > end if
> >
> > if getc(0) then end if
> >
> > Providing no-one else knows what it is you do to build fluff (which
> > obviously needs to be the same at both ends), that should be pretty
> > tough to break.
> >
> > Pete
> >
> >
> > TOPICA - Start your own email discussion group. FREE!
> >
> > ---
> > Incoming mail is certified Virus Free.
> > Checked by AVG anti-virus system (http://www.grisoft.com).
> > Version: 6.0.497 / Virus Database: 296 - Release Date: 7/4/2003
> >
>---
>
>
>
>TOPICA - Start your own email discussion group. FREE!
>
>
