Obviously, the discrete logarithm problem is thought to be hard.
But what if you are also given $g^\left(a^{-1}\right)$?
Does that give enough information to solve for $a$? Or is that also intractable?
Obviously, the discrete logarithm problem is thought to be hard.
But what if you are also given $g^\left(a^{-1}\right)$?
Does that give enough information to solve for $a$? Or is that also intractable?
Copyright © 2021 JogjaFile Inc.