This article is cited in 3 scientific papers (total in 3 papers)
Mathematical Foundations of Informatics and Programming
On generic complexity of the discrete logarithm problem
A. N. Rybalov
Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia
Generic-case approach to algorithmic problems was suggested by Miasnikov, Kapovich, Schupp and Shpilrain in 2003. This approach studies behaviour of an algorithm on typical (almost all) inputs and ignores the rest of inputs. Many classical undecidable or hard algorithmic problems become feasible in the generic case. But there are generically hard problems. In this paper, we consider generic complexity of the classical discrete logarithm problem. We fit this problem in the frameworks of generic complexity and prove that its natural subproblem is generically hard provided that the discrete logarithm problem is hard in the worst case.
generic complexity, discrete logarithm problem, probabilistic algorithm.
PDF file (562 kB)
A. N. Rybalov, “On generic complexity of the discrete logarithm problem”, Prikl. Diskr. Mat., 2016, no. 3(33), 93–97
Citation in format AMSBIB
\paper On generic complexity of the discrete logarithm problem
\jour Prikl. Diskr. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
A. N. Rybalov, “O genericheskoi slozhnosti problemy izvlecheniya kornya v gruppakh vychetov”, PDM, 2017, no. 38, 95–100
A. N. Rybalov, “Generic amplification of recursively enumerable sets”, Algebra and Logic, 57:4 (2018), 289–294
A. Rybalov, “On a generic turing reducibility of computably enumerable sets”, Xii International Scientific and Technical Conference Applied Mechanics and Systems Dynamics, Journal of Physics Conference Series, 1210, IOP Publishing Ltd, 2019, 012122
|Number of views:|