Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!lll-winken!csustan!polyslo!caus-dp!marcos
From: marcos@caus-dp.UUCP (Marcos R. Della)
Newsgroups: comp.sys.ibm.pc,comp.unix.questions,sci.crypt
Subject: Public Key systems
Message-ID: <283@caus-dp.UUCP>
Date: Tue, 17-Nov-87 16:33:32 EST
Article-I.D.: caus-dp.283
Posted: Tue Nov 17 16:33:32 1987
Date-Received: Sat, 21-Nov-87 10:30:38 EST
Organization: USPFO for CA - Data Processing Div., SLO, Ca
Lines: 26
Keywords: Need a general idea on how!
Xref: mnetor comp.sys.ibm.pc:10290 comp.unix.questions:4963 sci.crypt:724

Hello there, I am trying to put together a minor public key system (not a
totally secure system with mega large prime numbers, but a resonably small
one) mainly for the method of usage, not because it is really secure...
 
As I understand it, the public key system works on the principle of

		K(D(P)) = P  where K is the key function and
			     D is the decryption function.

Now, I can't remember the entire algorythm, but I do remember that somehow
you take your number, multiply it by your key and mod it by k*d. Is this
right so far? Then you do something with your decrypt key and you should
get the original number back...

The big question is, what am I doing wrong and does someone have a better
explination than I have? Also, if anyone has any code that would show
or illustrate this better, could you post it to the net?

Thanks for any help you can provide!

Marcos R. Della

-- 
...!lll-crg -> !csustan -\                           | Whatever I said doesn't
            ...!sdsu ----->->!polyslo!caus-dp!marcos | mean diddly as I forgot
  ...!ihnp4 -> !csun ----/                           | it even before finishing
            ...!dmsd ---/                            | typing it all out!!!