Stefan Bellon wrote:
> For this, you may want to take a look at http://www.erikyyy.de/multikey/
Right, that's one possible solution. Another is to use an algebraic
threshold scheme. For example, you can support M-of-N threshold schemes
with 2 <= M <= N with N up to 15 if you compute over GF(2^4) modulo
the irreducible polynomial x^4 + x + 1 using nibble arithmetic. In any
case, the quality of random numbers is crucial to the security of
the data.
______________________________________________________________________
OpenSSL Project http://www.openssl.org
User Support Mailing List [EMAIL PROTECTED]
Automated List Manager [EMAIL PROTECTED]
