Return to BSD News archive
Xref: sserve comp.org.eff.talk:9838 misc.int-property:764 comp.unix.bsd:7612 Path: sserve!manuel.anu.edu.au!munnari.oz.au!spool.mu.edu!uwm.edu!rpi!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!cis.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!ucbvax!virtualnews.nyu.edu!brnstnd From: brnstnd@nyu.edu (D. J. Bernstein) Newsgroups: comp.org.eff.talk,misc.int-property,alt.suit.att-bsdi,comp.unix.bsd Subject: Re: Patents: What they are. What they aren't. Other factors. Message-ID: <5384.Nov819.10.4592@virtualnews.nyu.edu> Date: 8 Nov 92 19:10:45 GMT References: <1992Nov4.035758.1767@netcom.com> <1992Nov4.152642.13664@murdoch.acc.Virginia.EDU> <1992Nov5.074758.29460@netcom.com> Organization: IR Lines: 15 In article <1992Nov5.074758.29460@netcom.com> mcgregor@netcom.com (Scott Mcgregor) writes: > The RSA patent doesn't prevent ALL applications of multiplications of > large primes, only the application to cryptology, a narrower domain. ``A mathematical algorithm is not made statutory by `attempting to limit the use of the formula to a particular technological environment.' _Diehr_, 450 U.S. at 191, 209 USPQ at 10.'' Source: USPTO Official Gazette, September 5, 1989, page 8. > Failure to appreciate this difference seems to lead some people The U.S. Supreme Court does not ``appreciate this difference.'' ---Dan