Learn More
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(More)
  • 1