[14111] in Cypherpunks
Re: Graph isomorphism based PK cryptosystems?
daemon@ATHENA.MIT.EDU (Jay Prime Positive)
Wed May 25 01:55:05 1994
Date: Tue, 24 May 94 21:51 PDT
From: jpp@jpplap.markv.com (Jay Prime Positive)
To: perry@imsi.com
Cc: cypherpunks@toad.com
In-Reply-To: <9405242211.AA03230@snark.imsi.com> (perry@imsi.com)
Date: Tue, 24 May 1994 18:11:51 -0400
From: "Perry E. Metzger" <perry@imsi.com>
There was a powerful result a while back concerning public key systems
based on NP complete problems
Hmm. Was it the set of 'super increasing' knapsack problems?
It would be cool to hear about your graph isomorphism based system in
any case.
I only worry that if I publish, it could be patented. And I don't
want the algorithm to end up in the hands of the software patent
folks. Especially if they will be making money off it, and I wont.
Solutions?
Perry
