The critical group from a cryptographic perspective

The critical group of a graph is an abelian group that arisesin several contexts, and there are some similarities with thegroups that are used in cryptography. We construct a familyof graphs with critical groups that are cyclic, and discussthe associated computational problems using algorithms basedon the theory of ‘chip-firing’.