Article View: sci.crypt
Article #2734Re: Question from someone who's new to all this
From: J. S. Greenfield
Date: Mon, 04 Jan 1993 19:56
Date: Mon, 04 Jan 1993 19:56
23 lines
1550 bytes
1550 bytes
In article <bontchev.726158979@fbihh> bontchev@fbihh.informatik.uni-hamburg.de writes: >> How can someone (PKP) patent a mathematical algorithm? > >Well, they do not have patented the mathematical algorithm. They have >pathented the usage of certain mathematical operation to implement a >communication system. That is, anybody is free to use modular >arithmetic in general, but usage of modular arithmetic for encrypted >and/or authenticated communication is patented. This sounds far too broad. I would guess it's far more specific--somewhere along the lines of use of modular exponentiation with a modulus consisting of the product of two primes for cryptographic purposes. Modular arithmetic was not at all new to cryptography when RSA was developed, so the patent would *have* to be much narrower than just that. -- J. S. Greenfield greeny@top.cis.syr.edu (I like to put 'greeny' here, but my d*mn system wants a *real* name!) "What's the difference between an orange?"
Technical Details
Message-ID:
<1993Jan4.145637.5551@newstand.syr.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!psinntp!newstand.syr.edu!greenyReferences:
<1993Jan3.165050.27910@zip.eecs.umich.edu> <1993Jan3.170453.28445@zip.eecs.umich.edu> <bontchev.726158979@fbihh>Show Full Headers
Complete Article Headers
Newsgroups: sci.crypt,alt.society.civil-liberty Path: arc1-ca.pugleaf.net!sparky!uunet!psinntp!newstand.syr.edu!greeny From: greeny@top.cis.syr.edu (J. S. Greenfield) Subject: Re: Question from someone who's new to all this Message-ID: <1993Jan4.145637.5551@newstand.syr.edu> Organization: Syracuse University, CIS Dept. References: <1993Jan3.165050.27910@zip.eecs.umich.edu> <1993Jan3.170453.28445@zip.eecs.umich.edu> <bontchev.726158979@fbihh> Date: Mon, 4 Jan 93 14:56:37 EST Lines: 23