MOC
1998
13 years 4 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
ENDM
2007
13 years 4 months ago
2007
For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not c...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. A t out of n threshold scheme is such that shares are distributed to n participants so that any set of t participants can compute the secret, whereas any set of less than...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
It is well known that every finite abelian group G can be represented as a direct product of cyclic groups: G ∼= G1 × G2 × · · · × Gt, where each Gi is a cyclic group of ...