Crossmark

Comparison of the complexity of Diffie–Hellman and discrete logarithm problems

Published Online: 2020-04-13

Published Print: 2020-12

Authors

Cherepniov, Mikhail
Funding

Funding for this research was provided by:

RFBR (18-29-03124)
License Information

Text and Data Mining valid from 2020-04-13

Version of Record valid from 2020-04-13
More Information

Article History

Received: 9 December 2019

Accepted: 2 April 2020

First Online: 13 April 2020

Document is current