A geometric approach for shared secrets, a refinement

A refinement to the (k,n) threshold scheme proposed by Wu and He [1] is presented. It has been found that usable primes p need not be confined to the form p=.+/-3 (mod 8) as suggested originally. Our constructive proof also lead to a different algorithm for implementation. This implementation dispenses with the directory file suggested in [1] which can bt prohibitively large when the scheme is implemented with large p using the original proposal. Copyright (C) 1996 Elsevier Science Ltd.