The critical group from a cryptographic perspective

Abstract

The critical group of a graph is an abelian group that arises in several contexts, and there are some similarities with the groups that are used in cryptography. We construct a family of graphs whose critical groups are cyclic, and discuss the associated computational problems using algorithms based on the theory of ‘chip-firing’