Welcome to the resource topic for 2008/170
Title:
Cryptanalysing the Critical Group: Efficiently Solving Biggs’s Discrete Logarithm Problem
Authors: 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.
ePrint: https://eprint.iacr.org/2008/170
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .