A cryptographle system, called PGM, was invented in the late 1970‘s by S. Magiiveras. PGM iS based on the prolific existence of certain kinds of factorizatlon sets, called logarithmic signatures, for finite permutation groups. Logarithmic signatures were initially motivated by C. Sims’ bases and strong generators. A logarithmic signature α, for a given group G, induces a mapping â from ZG to G. Hence it would be natural to use logarithmic signatures for generating random elements in a group. In this paper we focus on generating random permutations in the symmetric group Sn. Random permutations find applications in design of experiments simulation cryptology, voice-encryption etc. Given a logarithmic signature α for sn and a seed s0, we could efficiently compute the following sequence : ᾶ(s0), ᾶ(s0 + 1),…,ᾶ(s0 + r - 1) of r permutations. We claim that this sequence behaves llke a sequence of random permutations. We undertake statistical tests to substantiate our claim.