You are looking at a specific version 20081107:113055 of this paper. See the latest version.

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
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.