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

DOI10.1515/dma-2021-0001zbMath1469.11480OpenAlexW3131968114MaRDI QIDQ1996838

Mikhail A. Cherepnev

Publication date: 26 February 2021

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2021-0001

zbMATH Keywords

Diffie-Hellman problemcomplexity upper boundsinteger factorization complexity

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Randomized algorithms (68W20) Factorization (11Y05)

Cites Work

• Unnamed Item
• On the connection between the discrete logarithms and the Diffie-Hellman problem

This page was built for publication: Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem