[HV21] On Search Complexity of Discrete Logarithm

Authors: Pavel Hubáček, Jan Václavek | Venue: MFCS 2021 | Source

Abstract

TODO — abstract.

BibTeX

Copy

@inproceedings{HV21,
  author    = {Pavel Hub{\'a}{\v c}ek and Jan V{\'a}clavek},
  title     = {On Search Complexity of Discrete Logarithm},
  booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
  series    = {Leibniz International Proceedings in Informatics (LIPIcs)},
  volume    = {202},
  pages     = {60:1--60:16},
  publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  year      = {2021},
  doi       = {10.4230/LIPIcs.MFCS.2021.60},
  url       = {https://arxiv.org/abs/2107.02617}
}