Talk:Decisional Diffie-Hellman assumption

From Wikipedia, the free encyclopedia

WikiProject on Cryptography This article is part of WikiProject Cryptography, an attempt to build a comprehensive and detailed guide to cryptography on Wikipedia. If you would like to participate, you can choose to edit the article attached to this page, or visit the project page, where you can join the project and see a list of open tasks.

I find the following useful:

Decisional Diffie-Hellman (DDH) assumption: Given primes p,q such that q divides p-1. Let g be a generator of $\mathbb{Z}_p^*$ of order q. Then for sufficiently large values of p,q the tuple (g,g^a,g^b,b^ab) is computationally indistinguishable from (g,g^a,g^b,b^c) where a,b,c \in_R [0,q-1].--Bah23 15:24, 31 January 2007 (UTC)