Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem
-
Mikhail A. Cherepnev
Abstract
We construct a probabilistic polynomial algorithm that solves the integer factorization problem using an oracle solving the Diffie–Hellman problem.
Note: Originally published in Diskretnaya Matematika (2020) 32, №1, 110–114 (in Russian).
Funding statement: Research was partially supported by RFBR, project 17-01-00485a
References
[1] Cherepnev M.A., “On the connection between the discrete logarithms and the Diffie-Hellman problem”, DiscreteMath. Appl., 6:4 (1996), 341–349.10.1515/dma.1996.6.4.341Search in Google Scholar
[2] Gashkov S.B., Primenko E.A., Cherepnev M.A., Cryptographic methods of information security. Tutorial, «Akademiya», 2010 (in Russian), 298 pp.Search in Google Scholar
[3] Vasilenko O.N., Number-theoretic algorithms in cryptography, M.: MCCME, 2006 (in Russian), 325 pp.10.1090/mmono/232Search in Google Scholar
[4] Prachar K., Primzahlverteilung, Springer-Verlag, Berlin Göttingen Heidelberg, 1957.Search in Google Scholar
© 2021 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem
- Pseudo orthogonal Latin squares
- Panchromatic colorings of random hypergraphs
- On the connectivity of configuration graphs
- Asymptotics with remainder term for moments of the total cycle number of random A-permutation
- On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs
- Letter to the Editor
Articles in the same Issue
- Frontmatter
- Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem
- Pseudo orthogonal Latin squares
- Panchromatic colorings of random hypergraphs
- On the connectivity of configuration graphs
- Asymptotics with remainder term for moments of the total cycle number of random A-permutation
- On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs
- Letter to the Editor
