ok - I just read part of the paper. I'm not a cryptographer but I am a
mathemetician and here are some trivial conclusions.
the algorithm is looking for a number: N where N=p*q for two primes p and
q of relatively the same size.
If you look at the _original_ equations developed by Pohlig-Hellm
Douglas Wikström <[EMAIL PROTECTED]> asked for a more detailed description of
the MultiPrime RSApkc technique than the RSA press release on RSA's
licensing agreement with Compaq:
http://www.rsasecurity.com/news/pr/000411-1.html
Try:
http://www.tandem.com/brfs_wps/esscptt
Lutz Jaenicke <[EMAIL PROTECTED]> writes:
> On Thu, May 04, 2000 at 10:39:05AM +0100, Mark J Cox wrote:
> > > Which is about to expire in a few months, if I remember correctly :-)
> >
> > Then we get into the new MultiPrimes patent instead. For details:
> > http://www.apacheweek.com/issues/00-0
On Thu, May 04, 2000 at 10:39:05AM +0100, Mark J Cox wrote:
> > Which is about to expire in a few months, if I remember correctly :-)
>
> Then we get into the new MultiPrimes patent instead. For details:
> http://www.apacheweek.com/issues/00-04-21#rsa2000
Well, but then, who cares?
The Multi
> Which is about to expire in a few months, if I remember correctly :-)
Then we get into the new MultiPrimes patent instead. For details:
http://www.apacheweek.com/issues/00-04-21#rsa2000
Mark
Mark J Cox, .. www.awe.com/mark
Apache Software Foundation .
> From: Stefan Schmidt <[EMAIL PROTECTED]>
>
> I am looking into using OpenSSL commercially in the US but I can't find
> anything about the legal issues other than that there are some. So I know
> that RSA holds patents on their algorithms in the US until September 2000.
> Can I just not use the
OpenSSL so far is patent free and probably will remain generally so unless
some hotshot chooses to try to patent something which has already been
done - but they don't know about. This has happened - I have examples.
RSA's stuff is patented in the US only and it expires as you say in Sept.
Thus
