Adrian 'Dagurashibanipal' von Bidder
Sat Mar 1 11:00:01 2003
[no cc:s necessary. Thanks.]
On Sat, 2003-03-01 at 05:09, Michael H. Warfield wrote:
> There is a neat trick with RSA where you can distribute the
> secret key between many computers and never need to reassemble them.
> You give them all the same modulus (pq result) but you split the secret
> exponent between them such that the sum of the exponent adds up to your
> secret exponent.
Funnily enough, I had an exam yesterday morning, and EXACTLY THIS was
one of the exam questions...
Ok, this thing with the RSA exponent works fine.
The beautiful thing with the classical 'secret sharing' algorithms is
that you can do things like 'any 3 out of 5 may sign a document'. I have
not thought about it - with calculating in finite groups, it could be
possible to do it. In any case: yes, it was such things that I was
featured product: Debian GNU/Linux - http://debian.org
Content-Type: application/pgp-signature; name=signature.asc
Content-Description: This is a digitally signed message part
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.1 (GNU/Linux)
Comment: get my key from http://fortytwo.ch/gpg/92082481
-----END PGP SIGNATURE-----
Signature policy: http://fortytwo.ch/legal/gpg/email.20020822?version=1.3&md5sum=14ca616f14682a82cb9cc25c9b34a10d