Open Access
2004 On Minimal Factorisations of Sporadic Groups
P. E. Holmes
Experiment. Math. 13(4): 435-440 (2004).

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.

Citation

Download Citation

P. E. Holmes. "On Minimal Factorisations of Sporadic Groups." Experiment. Math. 13 (4) 435 - 440, 2004.

Information

Published: 2004
First available in Project Euclid: 22 February 2005

zbMATH: 1071.20020
MathSciNet: MR2118268

Subjects:
Primary: 20D08
Secondary: 94A60

Keywords: cryptography , simple groups , Sporadic groups

Rights: Copyright © 2004 A K Peters, Ltd.

Vol.13 • No. 4 • 2004
Back to Top