[14144] in Cypherpunks
Re: Patentability (was Graph
daemon@ATHENA.MIT.EDU (Pierre Omidyar)
Wed May 25 14:08:18 1994
Date: 25 May 1994 10:04:46 U
From: "Pierre Omidyar" <pierre@eshop.com>
To: "Harry Bartholomew" <bart@netcom.netcom.com>, perry@imsi.com
Cc: cypherpunks@toad.com, jpp@jpplap.markv.com
Reply to: RE>Patentability (was Graph isomorphism based PK cr)
[disclaimer: I'm not an expert, but I've done some work with patents.]
I believe the best way to ensure that something becomes unpatentable is to:
1. Publish it first. That reserves your right to file a patent if you
want. No one else can patent your original work.
2. Don't file a patent within one year of publication. After one year
you lose your right to file. No one else can file, because by then
the invention is considered to be public knowledge (since it was
published), so it would not satisfy the "original and novel"
patentability test.
If you keep the process a secret, someone else could independantly invent it and
patent it. If you publish it before someone else files, it becomes public
knowledge and is unpatentable except by the original inventor within one year of
publication.
Pierre
--------------------------------------
Date: 5/25/94 9:21 AM
To: Pierre Omidyar
From: perry@imsi.com
Harry Bartholomew says:
> > Jay Prime Positive says:
> > > 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.
> >
> > If you publish, only you could patent it. There is only danger if you
> > don't publish, in which case others can independently make the same
> > discovery and patent it.
> >
> > Perry
>
> But you would then need to file within one year of the publication
> date I think.
His whole point was that he wanted to render the process unpatentable.
Perry
------------------ RFC822 Header Follows ------------------
From owner-cypherpunks@toad.com Wed May 25 08:50:46 1994
Received: from mail.netcom.com by netcomsv.netcom.com with ESMTP (8.6.4/SMI-4.1)
id IAA23867; Wed, 25 May 1994 08:50:43 -0700
Received: from toad.com by mail.netcom.com (8.6.8.1/Netcom)
id IAA07710; Wed, 25 May 1994 08:47:26 -0700
Received: by toad.com id AA14178; Wed, 25 May 94 08:46:40 PDT
Received: from wintermute.imsi.com by toad.com id AA14171; Wed, 25 May 94 08:46:35
PDT
Received: from relay.imsi.com by wintermute.imsi.com
id LAA05942; Wed, 25 May 1994 11:43:22 -0400
Received: from snark.imsi.com by relay.imsi.com
id LAA12469; Wed, 25 May 1994 11:43:13 -0400
Received: by snark.imsi.com (4.1/SMI-4.1)
id AA04343; Wed, 25 May 94 11:43:21 EDT
Message-Id: <9405251543.AA04343@snark.imsi.com>
To: bart@netcom.netcom.com (Harry Bartholomew)
Cc: perry@imsi.com, jpp@jpplap.markv.com, cypherpunks@toad.com
Subject: Re: Graph isomorphism based PK cryptosystems?
In-Reply-To: Your message of "Wed, 25 May 1994 08:36:21 PDT."
<199405251536.IAA26718@netcom.com>
Reply-To: perry@imsi.com
X-Reposting-Policy: redistribute only with permission
Date: Wed, 25 May 1994 11:43:20 -0400
From: "Perry E. Metzger" <perry@imsi.com>
Sender: owner-cypherpunks@toad.com
Precedence: bulk
