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


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




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

Diskretnaya Matematika, 2020, Volume 32, Issue 1, Pages 110–114
DOI: https://doi.org/10.4213/dm1520 (Mi dm1520) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem

M. A. Cherepnev

Lomonosov Moscow State University
Full-text PDF (396 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1520
Abstract: We construct a probabilistic polynomial algorithm that solves the integer factorization problem using an oracle solving the Diffie–Hellman problem.
Keywords: integer factorization complexity, complexity upper bounds, Diffie–Hellman problem.
Funding agency Grant number
Russian Foundation for Basic Research 17-01-00485а
Received: 03.05.2018
Revised: 14.02.2020
English version:
Discrete Mathematics and Applications, 2021, Volume 31, Issue 1, Pages 1–4
DOI: https://doi.org/10.1515/dma-2021-0001
Bibliographic databases:
Document Type: Article
UDC: 519.719.2
Language: Russian
Citation: M. A. Cherepnev, “Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem”, Diskr. Mat., 32:1 (2020), 110–114; Discrete Math. Appl., 31:1 (2021), 1–4
Citation in format AMSBIB
\Bibitem{Che20}
\by M.~A.~Cherepnev
\paper Reduction of the integer factorization complexity upper bound to the complexity of the Diffie--Hellman problem
\jour Diskr. Mat.
\yr 2020
\vol 32
\issue 1
\pages 110--114
\mathnet{http://mi.mathnet.ru/dm1520}
\crossref{https://doi.org/10.4213/dm1520}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4075905}
\elib{https://elibrary.ru/item.asp?id=46746161}
\transl
\jour Discrete Math. Appl.
\yr 2021
\vol 31
\issue 1
\pages 1--4
\crossref{https://doi.org/10.1515/dma-2021-0001}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000621785400001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85101574832}
Linking options:
  • https://www.mathnet.ru/eng/dm1520
  • https://doi.org/10.4213/dm1520
  • https://www.mathnet.ru/eng/dm/v32/i1/p110
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:298
    Full-text PDF :57
    References:33
    First page:16
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024