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.
Original language | English |
---|---|
Pages (from-to) | 435-440 |
Number of pages | 6 |
Journal | Journal of Experimental Mathematics |
Volume | 13 |
Issue number | 4 |
Publication status | Published - 2004 |
Keywords
- simple groups
- sporadic groups
- cryptography