🔓
Cryptography
  • What's this
  • Chapter 1 - Introduction
    • Exercise 1.1
  • Chapter 3 - Private-Key Encryption
    • Exercise 3.1
  • Chapter 4 - Message Authentication Codes
    • Exercise 4.7
    • Exercise 4.8
    • Exercise 4.14
    • Exercise 4.15
    • Extra: Authenticated Encryption CBC-XOR
  • Chapter 5 - Hash Functions and Applications
    • Exercise 5.3
  • Chapter 8 - Number Theory and Cryptographic Hardness Assumptions
    • (Unresolved) Exercise 8.15
Powered by GitBook
On this page
  • Problem
  • Solution

Was this helpful?

  1. Chapter 8 - Number Theory and Cryptographic Hardness Assumptions

(Unresolved) Exercise 8.15

Problem

Formally define the CDH assumption. Prove that hardness of the CDH problem relative to G\mathcal{G}G implies hardness of the discrete-logarithm problem relative to G\mathcal{G}G, and that hardness of the DDH problem relative to G\mathcal{G}G implies hardness of the CDH problem relative to G\mathcal{G}G.

Solution

Last updated 5 years ago

Was this helpful?