Variants of the Diffie-Hellman Problem

Variants of the Diffie-Hellman Problem

ISBN13: 9781522529156|ISBN10: 1522529152|EISBN13: 9781522529163
DOI: 10.4018/978-1-5225-2915-6.ch003
Cite Chapter Cite Chapter

MLA

Balasubramanian, Kannan. "Variants of the Diffie-Hellman Problem." Algorithmic Strategies for Solving Complex Problems in Cryptography, edited by Kannan Balasubramanian and M. Rajakani, IGI Global, 2018, pp. 40-54. https://doi.org/10.4018/978-1-5225-2915-6.ch003

APA

Balasubramanian, K. (2018). Variants of the Diffie-Hellman Problem. In K. Balasubramanian & M. Rajakani (Eds.), Algorithmic Strategies for Solving Complex Problems in Cryptography (pp. 40-54). IGI Global. https://doi.org/10.4018/978-1-5225-2915-6.ch003

Chicago

Balasubramanian, Kannan. "Variants of the Diffie-Hellman Problem." In Algorithmic Strategies for Solving Complex Problems in Cryptography, edited by Kannan Balasubramanian and M. Rajakani, 40-54. Hershey, PA: IGI Global, 2018. https://doi.org/10.4018/978-1-5225-2915-6.ch003

Export Reference

Mendeley
Favorite

Abstract

Many variations of the Diffie-Hellman problem exist that can be shown to be equivalent to one another. We consider following variations of Diffie-Hellman problem: square computational and Square decisional Diffie-Hellman problem, inverse computational and inverse computational decisional Diffie-Hellman problem and divisible computational and divisible decisional Diffie-Hellman problem. It can be shown that all variations of computational Diffie-Hellman problem are equivalent to the classic computational Diffie-Hellman problem if the order of a underlying cyclic group is a large prime. We also describe other variations of the Diffie-Hellman problems like the Group Diffie-Hellman problem, bilinear Diffie-Hellman problem and the Elliptic Curve Diffie-Hellman problem in this chapter.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.