The monodromy pairing and discrete logarithm on the Jacobian of finite graphs

Details The monodromy pairing and discrete logarithm on the Jacobian of finite graphs The monodromy pairing and discrete logarithm on the Jacobian of finite graphs

2009-07-27

arxiv.org/abs/0907.4764v2

J. Math. Cryptol. 4 (2010), 43--56

Mathematics

Combinatorics

Scientific paper

10.1515/JMC.2010.002

Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group. The construction of this group closely mirrors the construction of the Jacobian variety of an algebraic curve. Motivated by this analogy, it was recently suggested by Norman Biggs that the critical group of a finite graph is a good candidate for doing discrete logarithm based cryptography. In this paper, we study a bilinear pairing on this group and show how to compute it. Then we use this pairing to find the discrete logarithm efficiently, thus showing that the associated cryptographic schemes are not secure. Our approach resembles the MOV attack on elliptic curves.

Affiliated with

Also associated with

No associations

Rating

The monodromy pairing and discrete logarithm on the Jacobian of finite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The monodromy pairing and discrete logarithm on the Jacobian of finite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The monodromy pairing and discrete logarithm on the Jacobian of finite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-681042