On Search Complexity of Discrete Logarithm.

Pavel Hubcek, Jan Vclavek

Browse the full MFCS paper archive.