On minimal factorisations of sporadic groups

Petra Elisabeth Holmes

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)435-440
Number of pages6
JournalJournal of Experimental Mathematics
Volume13
Issue number4
Publication statusPublished - 2004

Keywords

  • simple groups
  • sporadic groups
  • cryptography

Fingerprint

Dive into the research topics of 'On minimal factorisations of sporadic groups'. Together they form a unique fingerprint.

Cite this