| 摘要 |
A method and system distributes N shares of a secret among cooperating entities using hyperplanes over GF(2m), such that the secret can be reconstructed from K of the N shares (where K≦̸N). In one embodiment, the secret is represented as a secret bit string of length m, which is embedded in a K-tuple. The K-tuple is then extended to an N-tuple by a linear transformation using arithmetic defined on GF(2m). N shares of the secret bit string are generated, with each of the N shares including an element of the N-tuple.
|
