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]
@inproceedings{HubacekV21,
title = {On Search Complexity of Discrete Logarithm},
author = {Pavel Hubácek and Jan Václavek},
year = {2021},
doi = {10.4230/LIPIcs.MFCS.2021.60},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.60},
researchr = {https://researchr.org/publication/HubacekV21},
cites = {0},
citedby = {0},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia},
editor = {Filippo Bonchi and Simon J. Puglisi},
volume = {202},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-201-3},
}