On Search Complexity of Discrete Logarithm

Pavel Hubácek, Jan Václavek. On Search Complexity of Discrete Logarithm. In Filippo Bonchi, Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. Volume 202 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

Abstract

Abstract is missing.