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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Fundamentalnaya i Prikladnaya Matematika, 2002, Volume 8, Issue 3, Pages 647–653 (Mi fpm684)  
On the solvability of the discrete logarithm problem in residue classes

O. N. Vasilenko

M. V. Lomonosov Moscow State University
Full-text PDF (285 kB)
References:
PDF
HTML
Abstract: The article is devoted to solvability of the discrete logarithm problem modulo composite number. Two theorems are proved, giving necessary and sufficient conditions for solvability in some cases. Also one method is suggested for proving solvability, analogous to the Pohlig–Hellman algorithm for solving the discrete logarithm problem.
Received: 01.04.1998
Bibliographic databases:
UDC: 511.9
Language: Russian
Citation: O. N. Vasilenko, “On the solvability of the discrete logarithm problem in residue classes”, Fundam. Prikl. Mat., 8:3 (2002), 647–653
Citation in format AMSBIB
\Bibitem{Vas02}
\by O.~N.~Vasilenko
\paper On the solvability of the discrete logarithm problem in residue classes
\jour Fundam. Prikl. Mat.
\yr 2002
\vol 8
\issue 3
\pages 647--653
\mathnet{http://mi.mathnet.ru/fpm684}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1971867}
\zmath{https://zbmath.org/?q=an:1021.11033}
Linking options:
  • https://www.mathnet.ru/eng/fpm684
  • https://www.mathnet.ru/eng/fpm/v8/i3/p647
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Фундаментальная и прикладная математика
    Statistics & downloads:
    Abstract page:573
    Full-text PDF :298
    References:52
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024