home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!noc.near.net!transfer.stratus.com!ellisun.sw.stratus.com!cme
- From: cme@ellisun.sw.stratus.com (Carl Ellison)
- Newsgroups: sci.crypt
- Subject: Re: PKP/RSA comments on PGP legality
- Date: 28 Dec 1992 20:49:38 GMT
- Organization: Stratus Computer, Software Engineering
- Lines: 32
- Message-ID: <1hnp92INNm41@transfer.stratus.com>
- References: <a_rubin.724442396@dn66> <1992Dec18.230642.9747@netcom.com> <1992Dec19.050329.29596@qualcomm.com>
- NNTP-Posting-Host: ellisun.sw.stratus.com
-
- In article <1992Dec19.050329.29596@qualcomm.com> karn@servo.qualcomm.com (Phil Karn) writes:
- >Where would you place the mathematical expressions
- >
- >C = M^e mod n
- >and
- >M = C^d mod n
- >
- >given that they can be typed directly into some of the fancier
- >infinite-precision mathematics packages and executed? Is this an
- >algorithm (not controlled) or a piece of software code (controlled)?
-
-
- I am not a lawyer -- however, I believe these become subject to the RSA
- patent -- and, for that matter, subject to ITAR rules -- only if those
- equations and any machinery for computing them are used for communicating a
- secret. (For other claims, you'd have to read the patent and for other
- prohibited behavior you'd have to read the ITAR.) If the way they are used
- doesn't help you communicate a secret, I doubt either of these (mutually
- antagonistic) entities cares.
-
-
- It is clear that I am totally free to verify the identity
-
- x = x^(1+k*phi(N)) mod N
-
- with examples, including the two equations you gave, using any size
- numbers, if I'm doing it as a class exercise in a number theory class.
- --
- -- <<Disclaimer: All opinions expressed are my own, of course.>>
- -- Carl Ellison cme@sw.stratus.com
- -- Stratus Computer Inc. M3-2-BKW TEL: (508)460-2783
- -- 55 Fairbanks Boulevard ; Marlborough MA 01752-1298 FAX: (508)624-7488
-