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, 2011, supplement № 4, Pages 31–32 (Mi pdm290)  
This article is cited in 2 scientific papers (total in 2 papers)

Mathematical Methods of Cryptography

Discrete logarithm diophantiness

S. Y. Erofeev

Omsk State University, Omsk
Full-text PDF (375 kB) Citations (2)
References:
PDF
HTML
Abstract: The paper proposes a new representation of discrete logarithm in $Z_p$ by constructing a diophantine equation, such that finding solution to this equation and finding discrete logarithm are equivalent problems.
Document Type: Article
UDC: 512.62
Language: Russian
Citation: S. Y. Erofeev, “Discrete logarithm diophantiness”, Prikl. Diskr. Mat., 2011, supplement № 4, 31–32
Citation in format AMSBIB
\Bibitem{Ero11}
\by S.~Y.~Erofeev
\paper Discrete logarithm diophantiness
\jour Prikl. Diskr. Mat.
\yr 2011
\pages 31--32
\issueinfo supplement № 4
\mathnet{http://mi.mathnet.ru/pdm290}
Linking options:
  • https://www.mathnet.ru/eng/pdm290
  • https://www.mathnet.ru/eng/pdm/y2011/i13/p31
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024