Cryptanalysing the Critical Group: Efficiently Solving Biggs's Discrete Logarithm Problem

Simon R.  Blackburn

Paper 2008/170

Cryptanalysing the Critical Group: Efficiently Solving Biggs's Discrete Logarithm Problem

Simon R. Blackburn

Abstract

Biggs has recently proposed the critical group of a certain class of finite graphs as a platform group for cryptosystems relying on the difficulty of the discrete log problem. The paper uses techniques from the theory of Picard groups on finite graphs to show that the discrete log problem can be efficiently solved in Biggs's groups. Thus this class of groups is not suitable as a platform for discrete log based cryptography.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): s blackburn @ rhul ac uk
History: 2008-11-07: revised; 2008-04-15: received; See all versions
Short URL: https://ia.cr/2008/170
License: CC BY

BibTeX

@misc{cryptoeprint:2008/170,
      author = {Simon R.  Blackburn},
      title = {Cryptanalysing the Critical Group: Efficiently Solving Biggs's Discrete Logarithm Problem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/170},
      year = {2008},
      url = {https://eprint.iacr.org/2008/170}
}