1. P. Cameron, Finite permutation groups and finite simple groups,Bulletin of the London Mathematical Society,13 (1981), 1–22.
2. I. D. de Caen, D. A. Gregory, and D. L. Kreher, Near-factors of finite groups, Preprint (1989).
3. M. Furst, J. E. Hopcroft, and E. Luks, Polynomial-time algorithms for permutation groups, inProceedings of the 21st IEEE Symposium on Foundations of Computation of Computer Science (1980), pp. 36–41.
4. P. Godlewski and C. Mitchell, Key-minimal cryptosystems for unconditional secrecy,Journal of Cryptology,3 (1991), 1–25.
5. M. Hall Jr.,The Theory of Groups, 2nd edn., Chelsea, New York (1976).