RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor
Subscription
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find






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


Mat. Zametki, 1994, Volume 55, Issue 2, Pages 91–101 (Mi mz2145)  

This article is cited in 2 scientific papers (total in 3 papers)

Complexity of a determinate algorithm for the discrete logarithm

V. I. Nechaev

Steklov Mathematical Institute, Russian Academy of Sciences

Full text: PDF file (2319 kB)
References: PDF file   HTML file

English version:
Mathematical Notes, 1994, 55:2, 165–172

Bibliographic databases:

UDC: 511
Received: 15.11.1993

Citation: V. I. Nechaev, “Complexity of a determinate algorithm for the discrete logarithm”, Mat. Zametki, 55:2 (1994), 91–101; Math. Notes, 55:2 (1994), 165–172

Citation in format AMSBIB
\Bibitem{Nec94}
\by V.~I.~Nechaev
\paper Complexity of a determinate algorithm for the discrete logarithm
\jour Mat. Zametki
\yr 1994
\vol 55
\issue 2
\pages 91--101
\mathnet{http://mi.mathnet.ru/mz2145}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1275323}
\zmath{https://zbmath.org/?q=an:0831.11065}
\transl
\jour Math. Notes
\yr 1994
\vol 55
\issue 2
\pages 165--172
\crossref{https://doi.org/10.1007/BF02113297}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=A1994PL08500027}


Linking options:
  • http://mi.mathnet.ru/eng/mz2145
  • http://mi.mathnet.ru/eng/mz/v55/i2/p91

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. M. I. Anokhin, “Decidability of classes of algebraic systems in polynomial time”, Sb. Math., 193:2 (2002), 157–186  mathnet  crossref  crossref  mathscinet  zmath  isi
    2. V. N. Chubarikov, N. M. Dobrovolskii, “Yubilei Chebyshevskogo sbornika”, Chebyshevskii sb., 17:4 (2016), 5–10  mathnet  crossref  elib
    3. E. K. Alekseev, V. D. Nikolaev, S. V. Smyshlyaev, “On the security properties of Russian standardized elliptic curves”, Matem. vopr. kriptogr., 9:3 (2018), 5–32  mathnet  crossref  elib
  • Математические заметки Mathematical Notes
    Number of views:
    This page:523
    Full text:238
    References:43
    First page:2

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019