PD public key system

Thread View: sci.crypt

4 messages

[T] Back to Threads [V] Tree View [G] Group Articles

4 total messages Started by Ray Jones - Perp Sat, 15 Aug 1992 06:09

#716

Author: Ray Jones - Perp
Date: Sat, 15 Aug 1992 06:09

25 lines
1468 bytes

I'm working on a client/server pair that requires some sort of
verification.  The method I wanted to use was:

Client requests a connect to the server.
Server sends client random string of characters, <s>.
Server and client both encode <s> with an algorithm driven by the internet
	address of the server.
Client encodes the new string with its private key, sends that message
	back, prepended with the public key of that client.
Server checks that the public key is on a list of "accepted" clients, and
	decodes the message with the public key, and checks against what it
	calculated, to ensure the key is "for real."

I was planning on using the RSA algorithm, but I also need to make this
code almost completely distributable (PD).  I understand that if I try to
do that with the RSA system, I'll probably get sued...

Any suggestions?  Is it true I can't use RSA?  Is there a scheme that would
work for the above and that I could also distribute?

Thanks.
--
                                          Ray Jones
                                          rjones@dsd.es.com

Re: PD public key system

#723

Author: Alan D. Cabrera
Date: Sat, 15 Aug 1992 16:46

24 lines
1613 bytes

In article <1992Aug15.060903.7682@dsd.es.com> rjones@itchy.dsd.es.com (Ray Jones - Perp) writes:
>
>I'm working on a client/server pair that requires some sort of
>verification.  The method I wanted to use was:
>
>I was planning on using the RSA algorithm, but I also need to make this
>code almost completely distributable (PD).  I understand that if I try to
>do that with the RSA system, I'll probably get sued...
>
>Any suggestions?  Is it true I can't use RSA?  Is there a scheme that would
>work for the above and that I could also distribute?

Don't forget to mention that we also want to export the authentication
code.  I think that the key word here is authentication.  Also, the
code is for a game, Netrek.  This means that the PKE algorithm doesn't
need to be as bulletproof as RSA.  If a Netrekkie wants to puruchase
a couple supercomputers to break a key then the geek deserves to
masquarade as any client s/he desires.

--
Alan Cabrera				internet:  adc@tardis.cl.msu.edu
Computer Laboratory			phone:     (517) 353-3027
Michigan State University		fax:       (517) 353-9847
514 Computer Center			bitnet:    CABRERA@MSU

Re: PD public key system

#745

Author: Ray Berry
Date: Sun, 16 Aug 1992 17:41

14 lines
1064 bytes

rjones@itchy.dsd.es.com (Ray Jones - Perp) writes:

(description deleted...)

>Any suggestions?  Is it true I can't use RSA?  Is there a scheme that would
>work for the above and that I could also distribute?

	Some time ago Next Inc. announced their intentions to use a scheme termed
"elliptical descent" for public key security.  I'm not qualified to comment
on its applicability or security - perhaps others here can do so.  I don't
recall it being discussed here at the time of the announcement.  My impression
was that it was free of patent liability issues.
-- 
Ray Berry  kb7ht  ray@ole.UUCP  73407.3152@compuserve.com  /* inquire within */

Re: PD public key system

#748

Author: Robert D. Silverman
Date: Sun, 16 Aug 1992 21:06

31 lines
1911 bytes

In article <1992Aug16.174133.20172@ole.cdac.com> ray@ole.cdac.com (Ray Berry) writes:
:rjones@itchy.dsd.es.com (Ray Jones - Perp) writes:
:
:(description deleted...)
:
:>Any suggestions?  Is it true I can't use RSA?  Is there a scheme that would
:>work for the above and that I could also distribute?
:
:	Some time ago Next Inc. announced their intentions to use a scheme termed
:"elliptical descent" for public key security.  I'm not qualified to comment
:on its applicability or security - perhaps others here can do so.  I don't
 
It uses the word problem for Mordell-Weil groups. i.e. it is equivalent
to the discrete log problem over finite fields, but instead uses groups
defined on elliptic curves over finite fields.

The difference between this and ordinary discrete logs is that this
method does not seem to be susceptible to Coppersmith's techniques
for fields of characteristic 2, and index calculus based attacks seem
more difficult as well.
 
I suggest you check the literature for references on discrete logs.
I am at home and all of mine are at my office. In particular, pay
close attention to papers by Dan Gordon on elliptic discrete logs and
any by Odlyzko or Coppersmith.

--
Bob Silverman
These are my opinions and not MITRE's.
Mitre Corporation, Bedford, MA 01730
"You can lead a horse's ass to knowledge, but you can't make him think"

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads