Biggs, Norman (2006) The critical group from a cryptographic perspective. CDAM Research Report, LSE-CDAM 2006-07. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.Full text not available from this repository.
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’.
|Item Type:||Monograph (Report)|
|Additional Information:||© 2006 the author|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Departments > Mathematics|
|Identification Number:||LSE-CDAM 2006-07|
|Date Deposited:||10 Oct 2008 15:18|
Actions (login required)
|Record administration - authorised staff only|