Article View: sci.crypt
Article #989Re: RSA claims 33 and 37 of U.S. patent 4,405,829
From: Robert Cain
Date: Wed, 07 Oct 1992 05:46
Date: Wed, 07 Oct 1992 05:46
34 lines
1689 bytes
1689 bytes
casper@fwi.uva.nl (Casper H.S. Dik) writes:
: rcain@netcom.com (Robert Cain) writes:
:
: >It has been pointed out to me that Julius Ceasar used the polynomial
:
: > C = M+1(mod n)
:
: >where M are the alphabet message chunks and n is the size of the
: >alphabet. For english n=26 which is the composite of the two primes
: >2 and 13 so I believe that prior art (very prior) has been established.
: >Any comments?
:
: You cannot take a patent apart claim by claim. The patent
: is the combination of the claims, not a mere collection.
:
: If I combine several well known things for the first time
: and the things have never been used in that combination before,
: I can patent it.
:
The rule is that you infringe a patent if your object includes anything
fully covered by any one of its claims. My object infringes only the two
polynomial claims. If those claims cannot stand I will not infringe the
patent. Thus my interest in finding prior art that can defeat them.
Bob
--
Bob Cain rcain@netcom.com 408-358-2007
"There are some strings. They're just not attached."
Victoria Roberts
PGP 1.0 public key available on request.
Technical Details
Message-ID:
<1992Oct7.054600.27341@netcom.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!haven.umd.edu!darwin.sura.net!spool.mu.edu!umn.edu!csus.edu!netcom.com!rcainReferences:
<1992Oct6.231809.2074@fwi.uva.nl>Show Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!haven.umd.edu!darwin.sura.net!spool.mu.edu!umn.edu!csus.edu!netcom.com!rcain From: rcain@netcom.com (Robert Cain) Subject: Re: RSA claims 33 and 37 of U.S. patent 4,405,829 Message-ID: <1992Oct7.054600.27341@netcom.com> Organization: Netcom - Online Communication Services (408 241-9760 guest) References: <1992Oct6.231809.2074@fwi.uva.nl> Date: Wed, 7 Oct 1992 05:46:00 GMT Lines: 34