🚀 go-pugleaf

In article <1992Dec11.134309.29150@msuinfo.cl.msu.edu> mrr@scss3.cl.msu.edu (Mark Riordan) writes:
>The January 1993 issue of Dr. Dobb's Journal has an article by
>Peter Smith on a new public-key encryption algorithm called LUC.
>This algorithm, based on "Lucas sequences", resembles RSA in
>that it involves modular arithmetic based on N, the product of two 
>large primes, and a second number, e.
>
>A Lucas sequence, V[i](P,Q), is defined as follows.  P is the message
 
This is nothing new. A 'Lucas Sequence' is nothing more than a disguised
way of doing exponentiation in the twisted sub-group of a finite field
with p^2 elements. This is the sub-group that has order p+1, as opposed to
p-1, which is the group that RSA is based upon.

This has been well known for a long time among number theorists.
 
>The author, who is also the inventor of the LUC algorithm,

While I won't cry 'plagiarism', since the author may be unaware of
prior developments, for him to claim to be the 'inventor' is bogus
at best. It is NOT new.

>Not surprisingly, the author is attempting to patent the system
>and is looking for people to license it to.  A provisional patent

He should not be able to patent this, since what he has done was all
known before.
--
Bob Silverman
These are my opinions and not MITRE's.
Mitre Corporation, Bedford, MA 01730
"You can lead a horse's ass to knowledge, but you can't make him think"