Abstract
Minimal factorisations of groups can be used in cryptography. It is not yet known if one exists for each finite group, although it has been shown that a minimal counterexample of a group without one must be simple. We prove existence of minimal factorisations for some sporadic groups.

This publication has 2 references indexed in Scilit: