From: solman@MIT.EDU
To: cypherpunks@toad.com
Message Hash: 495c55e50f1362f6e225590cd324e01ef5a7e75297c4e822dbc38a2bfa6c06c4
Message ID: <9407141221.AA06311@ua.MIT.EDU>
Reply To: N/A
UTC Datetime: 1994-07-14 12:22:17 UTC
Raw Date: Thu, 14 Jul 94 05:22:17 PDT
From: solman@MIT.EDU
Date: Thu, 14 Jul 94 05:22:17 PDT
To: cypherpunks@toad.com
Subject: How broad are PKP's patents?
Message-ID: <9407141221.AA06311@ua.MIT.EDU>
MIME-Version: 1.0
Content-Type: text/plain
Or more specifically, I'm interested in how broad PKP thinks they
are. I understand that they claim all public-key systems, but am
I correct that that claim is based entirely on the Diffie-Hellman
patent expiring in April, 1997?
Is Shamir's three-pass protocol as presented on page 376 in
applied cryptography covered?
If you you used his protocol with the RSA-like symetric algorithm
suggested, is it covered under the RSA patent? Would an elliptic
analog of this be secure?
Are there other cryptographically secure communtative symetric
ciphers that could be used in Shamir's three pass protocol?
Being able to use this without infringing on any patents would
effectively obviate the need for public key cryptography outside
of authentication.
What about probabilistic encryption using a BBS generator? Does
RSADSI claim that because it too depends on the computational
hardness of factoring?
Thanks in advance,
Jason W. Solinsky
Return to July 1994
Return to “solman@MIT.EDU”
1994-07-14 (Thu, 14 Jul 94 05:22:17 PDT) - How broad are PKP’s patents? - solman@MIT.EDU