Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika, 2016, Number 3(33), Pages 93–97
DOI: https://doi.org/10.17223/20710410/33/8
(Mi pdm556)
 

This article is cited in 5 scientific papers (total in 5 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
Full-text PDF (562 kB) Citations (5)
References:
Abstract: 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.
Keywords: generic complexity, discrete logarithm problem, probabilistic algorithm.
Funding agency Grant number
Russian Foundation for Basic Research 15-41-04312
Bibliographic databases:
Document Type: Article
UDC: 510.52
Language: Russian
Citation: A. N. Rybalov, “On generic complexity of the discrete logarithm problem”, Prikl. Diskr. Mat., 2016, no. 3(33), 93–97
Citation in format AMSBIB
\Bibitem{Ryb16}
\by A.~N.~Rybalov
\paper On generic complexity of the discrete logarithm problem
\jour Prikl. Diskr. Mat.
\yr 2016
\issue 3(33)
\pages 93--97
\mathnet{http://mi.mathnet.ru/pdm556}
\crossref{https://doi.org/10.17223/20710410/33/8}
Linking options:
  • https://www.mathnet.ru/eng/pdm556
  • https://www.mathnet.ru/eng/pdm/y2016/i3/p93
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:227
    Full-text PDF :83
    References:43
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024