🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: sci.crypt
Article #1400

Re: RSA claims 33 and 37 of U.S. patent 4,405,829

#1400
From: Casper H.S. Dik
Date: Tue, 06 Oct 1992 23:18
19 lines
1199 bytes
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.

Casper
Technical Details
Message-ID: <1992Oct6.231809.2074@fwi.uva.nl>
Path: arc1-ca.pugleaf.net!sparky!uunet!cs.utexas.edu!sun-barr!west.West.Sun.COM!cronkite.Central.Sun.COM!texsun!exucom.exu.ericsson.se!ericom!sunic!mcsun!sun4nl!fwi.uva.nl!casper
References: <1992Oct1.192121.16796@netcom.com> <1992Oct6.210900.10783@netcom.com>

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!cs.utexas.edu!sun-barr!west.West.Sun.COM!cronkite.Central.Sun.COM!texsun!exucom.exu.ericsson.se!ericom!sunic!mcsun!sun4nl!fwi.uva.nl!casper
From: casper@fwi.uva.nl (Casper H.S. Dik)
Newsgroups: sci.crypt
Subject: Re: RSA claims 33 and 37 of U.S. patent 4,405,829
Message-ID: <1992Oct6.231809.2074@fwi.uva.nl>
Date: 6 Oct 92 23:18:09 GMT
References: <1992Oct1.192121.16796@netcom.com> <1992Oct6.210900.10783@netcom.com>
Sender: news@fwi.uva.nl
Organization: FWI, University of Amsterdam
Lines: 19
Nntp-Posting-Host: adam.fwi.uva.nl