Talk:Diffie–Hellman problem

I am a Canadian High School student, and unless I'm missing something, this problem is quite simple. Should it not just be $(g^x)^{\log_g(g^y)}$?

50.93.28.170 (talk) 01:12, 27 April 2011 (UTC)

I am an undergraduate student at the University of Virginia (UVA) and have mostly taught myself the cryptography information. I have worked under a professor on an anonymity topic since ths summer of 2005, and have been the teaching assistant for a cryptography class at UVA. My knowledge in this area comes mainly from the journal articles themselves. Batman900 02:15, 24 November 2005 (UTC)

This looks like a good job, but needs a layman introduction. Think how can you write a few sentences explaining it to a person without your technical background.--Piotr Konieczny aka Prokonsul Piotrus ^Talk 22:08, 12 December 2005 (UTC)

Plan to re-do article

Usually in cryptology, the DH problem refers to the actual problem of computing g^xy from g^x and g^y not to the "problem" of proving that this problem is hard, as done in the article. For example, article RSA problem and Discrete logarithm use problem in this sense.

Cryptologists sometimes make an assumption that the DH problem is hard. In fact, there has been much success towards showing that the DHP is hard, almost as hard as DLP, starting from the work of den Boer, followed by Maurer and Wolf, then Boneh and Lipton.

In my opinion, this article should be made shorter, with a quick reference to results such as those I listed, with a point to Discret logarithm, which is currently more concise and to the point.

DRLB 16:01, 31 January 2006 (UTC)

I've done some copyedit on the article to help make it more approachable. I am not an expert on the subject though, so it would be nice for someone to read through it and make sure I haven't made any errors. Cheers! - grubber 03:06, 13 August 2006 (UTC)