Re: [Cfrg] Preliminary disclosure on twist security ...

The patent in question is US6563928.

The claim cited reads as follows:

"53. A method of establishing a session key for encryption of data
between a pair of correspondents comprising the steps of one of said
correspondents selecting a finite group G, establishing a subgroup S
having an order q of the group G, determining an element α of the
subgroup S to generate greater than a predetermined number of the q
elements of the subgroup S and utilising said element α to generate a
session key at said one correspondent."

"59: 58. A method according to claim 53 wherein said order of said
subgroup is of the form utilising an integral number of a product of a
plurality of large primes.
59. A method according to claim 58 wherein the order of said subgroup
is of the form nrr′ where n, r and r′ are each integers and r and r′
are each prime numbers."

This doesn't appear to have anything to do that directly with twist
security. It does appear to cover the algorithm Microsoft proposed for
dealing with points of low order on NUMS curves in claim 15.  The
claim above would seem to cover any implementation of discrete
logarithm based cryptography that uses subgroup membership checks as a
means to ensure contributory behavior.

Sincerely,
Watson Ladd

2014-11-26 7:35 GMT-08:00 Dan Brown <dbrown@certicom.com>:
> _______________________________________________
> Cfrg mailing list
> Cfrg@irtf.org
> http://www.irtf.org/mailman/listinfo/cfrg

-- 
"Those who would give up Essential Liberty to purchase a little
Temporary Safety deserve neither  Liberty nor Safety."
-- Benjamin Franklin