Discrete logarithm problem in some families of sandpile groups

Krisztián Dsupin, Szabolcs Tengely

Biggs proposed the sandpile group of certain modified wheel graphs for cryptosystems relying on the difficulty of the discrete logarithm problem. Blackburn and independently Shokri…