Informácia o dokumente
In: Tatra Mountains Mathematical Publications, vol. 37, no. 3
Pavol Svaba - Tran Van Trung
On generation of random covers for finite groups
Rok, strany: 2007, 105 - 112
cover, uniform cover, $[r,s]$-mesh, logarithmic signature, finite group, public-key cryptosystem
Covers for finite groups, a generalization of logarithmic signatures, form the basis of the ElGamal-like public-key cryptosystem $MST2$. A relevant and open problem about the practical use of covers is the question of how to generate random covers for groups of large order. In this paper we show the connection between this problem and the classical occupancy problem. As a consequence, we can solve the problem of generating random covers for arbitrarily large finite groups completely. We also present several experimental computer results about covers and uniform covers for some alternating groups. These results provide useful hints for generating uniform random covers.
Svaba, P., Tran Van Trung, . 2007. On generation of random covers for finite groups. In Tatra Mountains Mathematical Publications, vol. 37, no.3, pp. 105-112. 1210-3195.
Svaba, P., Tran Van Trung, . (2007). On generation of random covers for finite groups. Tatra Mountains Mathematical Publications, 37(3), 105-112. 1210-3195.