PROJECTS: n of m

Roger Burton West roger at
Fri Sep 10 12:24:31 CEST 1999

On or about Fri, Sep 10, 1999 at 06:20:00AM -0400, Scott A Crosby typed:
>I'm not on the development list, so CC me any replies.
>You don't seem to have discussed this on the mailing list archive, so
>here it is. 
>There is a very elegant way of implementing n of m using polynomials, I've
>heard that pgp uses it.

This isn't part of the OpenPGP standard, which is why it isn't in
GnuPG (or so I was told when I proposed it a few months back).

I have working code which does this. Not very fast, but it's there.
Let me know if you're interested.


Roger Burton West -/- roger at
"Last night I drank with a practical man,
 who seemed to think he knew me well..."

More information about the Gnupg-devel mailing list