1995-09-03 - Basic Public key algorithms.

Header Data

From: droelke@rdxsunhost.aud.alcatel.com (Daniel R. Oelke)
To: cypherpunks@toad.com
Message Hash: 4c8c34d92449be72af1e678911f2b37abbec2a7634543c30b96bbb2d1b6cd789
Message ID: <9509021801.AA07301@spirit.aud.alcatel.com>
Reply To: N/A
UTC Datetime: 1995-09-03 07:34:28 UTC
Raw Date: Sun, 3 Sep 95 00:34:28 PDT

Raw message

From: droelke@rdxsunhost.aud.alcatel.com (Daniel R. Oelke)
Date: Sun, 3 Sep 95 00:34:28 PDT
To: cypherpunks@toad.com
Subject: Basic Public key algorithms.
Message-ID: <9509021801.AA07301@spirit.aud.alcatel.com>
MIME-Version: 1.0
Content-Type: text/plain



After doing quite a bit of poking around, I am somewhat discouraged
in my attempts to find a simple *pure* public key encryption method,
without a lot of other stuff wrapped around it. 

What I need is to encrypt between 45 and 55 bits of information
using a public key algorithm in an embedded environment. 
Memory usage needs to be minimal (a couple of K), and CPU usage 
will be tradded off based on key length.  Decryption speed/memory 
usage is not very limited (done on a workstation, not on embedded
system).

I could use RSA (which is well described in many sources, and has
RSAREF out there),  but I want to avoid the patent issue if possible.  
The sci.crypt FAQ mentions that there are other methods but that 
is about all it says.  Are there any that are not patented?  Are there
any that someone knows of that work well in a limited memory
environment? 

Thanks for any/all pointers.

Dan
------------------------------------------------------------------
Dan Oelke                                  Alcatel Network Systems
droelke@aud.alcatel.com                             Richardson, TX






Thread