Arabic
Bulgarian
Chinese
Croatian
Czech
Danish
Dutch
English
Estonian
Finnish
French
German
Greek
Hebrew
Hindi
Hungarian
Icelandic
Indonesian
Italian
Japanese
Korean
Latvian
Lithuanian
Malagasy
Norwegian
Persian
Polish
Portuguese
Romanian
Russian
Serbian
Slovak
Slovenian
Spanish
Swedish
Thai
Turkish
Vietnamese

Arabic
Bulgarian
Chinese
Croatian
Czech
Danish
Dutch
English
Estonian
Finnish
French
German
Greek
Hebrew
Hindi
Hungarian
Icelandic
Indonesian
Italian
Japanese
Korean
Latvian
Lithuanian
Malagasy
Norwegian
Persian
Polish
Portuguese
Romanian
Russian
Serbian
Slovak
Slovenian
Spanish
Swedish
Thai
Turkish
Vietnamese

definition of Wikipedia

Advertizing ▼

The **Diffie–Hellman problem (DHP)** is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography. The motivation for this problem is that many security systems use mathematical operations that are fast to compute, but hard to reverse. For example, they enable encrypting a message, but reversing the encryption is difficult. If solving the DHP were easy, these systems would be easily broken.

## Contents |

The Diffie–Hellman problem is stated informally as follows:

- Given an element
*g*and the values of*g*and^{x}*g*, what is the value of^{y}*g*?^{xy}

Formally, *g* is a generator of some group (typically the multiplicative group of a finite field or an elliptic curve group) and *x* and *y* are randomly chosen integers.

For example, in the Diffie-Hellman key exchange, an eavesdropper observes *g ^{x}* and

In cryptography, for certain groups, it is *assumed* that the DHP is hard, and this is often called the **Diffie–Hellman assumption**. The problem has survived scrutiny for a few decades and no "easy" solution has yet been publicized.

As of 2006, the most efficient means known to solve the DHP is to solve the discrete logarithm problem (DLP), which is to find *x* given *g*^{x}. In fact, significant progress (by den Boer, Maurer, Wolf, Boneh and Lipton) has been made towards showing that over many groups the DHP is almost as hard as the DLP. There is no proof to date that either the DHP (or the DLP) is a hard problem, except in generic groups (by Nechaev and Shoup).

Many variants of the Diffie–Hellman problem have been considered. The most significant variant is the decisional Diffie–Hellman problem (DDHP), which is to distinguish *g*^{xy} from a random group element, given *g*, *g*^{x}, and *g*^{y}. Sometimes the DHP is called the computational Diffie–Hellman problem (CDHP) to more clearly distinguish it from the DDHP. Recently groups with pairings have become popular, and in these groups the DDHP is easy, yet the DHP is still assumed to be hard. For less significant variants of the DHP see the references.

- B. den Boer,
*Diffie–Hellman is as strong as discrete log for certain primes*in Advances in Cryptology – CRYPTO 88, Lecture Notes in Computer Science 403, Springer, p. 530, 1988. - U. M. Maurer and S. Wolf,
*Diffie–Hellman oracle*in Advances in Cryptology – CRYPTO 96, (N. Koblitz, ed.), Lecture Notes in Computer Science 1070, Springer, pp. 268–282, 1996. - Ueli M. Maurer and Stefan Wolf (March 2000). "The Diffie–Hellman Protocol".
*Designs, Codes, and Cryptography*(Springer-Verlag)**19**(2–3): 141–171. http://www.springerlink.com/content/r74n758123752440/. Retrieved 2008-09-28. - D. Boneh and R. J. Lipton,
*Algorithms for black-box fields and their application to cryptotography*in Advances in Cryptology – CRYPTO 96, (N. Koblitz, ed.), Lecture Notes in Computer Science 1070, Springer, pp. 283–297, 1996. - A. Muzereau, N. P. Smart and F. Vercauteran,
*The equivalence between the DHP and DLP for ellipti curves used in practical applications*, LMS J. Comput. Math.,**7**, pp. 50–72, 2004. See [www.lms.ac.uk]. - D. R. L. Brown and R. P. Gallant, ,
*The Static Diffie–Hellman Problem*, IACR ePrint 2004/306. - V. I. Nechaev,
*Complexity of a determinate algorithm for the discrete logarithm*, Mathematical Notes,**55**(2), pp. 165–172, 1994. - V. Shoup,
*Lower bounds for discrete logarithms and related problems*in Advances in Cryptology – EUROCRYPT 97, (W. Fumy, ed.), Lecture Notes in Computer Science 1233, Springer, pp. 256–266, 1997. - Feng Bao. Robert Deng, Huafei Zhu (2002). "Variations of Diffie–Hellman problem".
*ICICS*(Springer-Verlag). http://www.i2r.a-star.edu.sg/icsd/publications/Baofeng_2003_Variations%20of%20Diffie%20Hellman%20problems.pdf. Retrieved 2005-11-23. - Dan Boneh (1998). "The Decision Diffie–Hellman Problem".
*ANTS-III: Proceedings of the Third International Symposium on Algorithmic Number Theory*(Springer-Verlag): 48–63. http://theory.stanford.edu/~dabo/papers/DDH.ps.gz. Retrieved 2005-11-23. - Emmanuel Bresson and Olivier Chevassut and David Pointcheval (2003). "The Group Diffie–Hellman Problems".
*SAC '02: Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography*(Springer-Verlag): 325–338. http://www.di.ens.fr/~bresson/papers/BreChePoi02b.pdf. Retrieved 2005-11-23. - Eli Biham and Dan Boneh and Omer Reingold (1999). "Breaking generalized Diffie–Hellman modulo a composite is no easier than factoring".
*Information Processing Letters*(Elsevier North-Holland)**70**(2): 83–87. DOI:10.1016/S0020-0190(99)00047-2. http://www.wisdom.weizmann.ac.il/~reingold/publications/CGDH.PS. Retrieved 2005-11-23. - Michael Steiner and Gene Tsudik and Michael Waidner (1996). "Diffie–Hellman Key Distribution Extended to Group Communication".
*ACM Conference on Computer and Communications Security*: 31–37. http://citeseer.ist.psu.edu/steiner96diffiehellman.html. Retrieved 2005-11-23. - Whitfield Diffie and Martin E. Hellman (November 1976). "New Directions in Cryptography".
*IEEE Transactions on Information Theory***IT-22**(6): 644–654. http://citeseer.ist.psu.edu/diffie76new.html. Retrieved 2005-11-23.

sensagent's content

- definitions
- synonyms
- antonyms
- encyclopedia

Dictionary and translator for handheld

New : sensagent is now available on your handheld

Advertising ▼

Webmaster Solution

Alexandria

A windows (pop-into) of information (full-content of Sensagent) triggered by double-clicking any word on your webpage. Give contextual explanation and translation from your sites !

SensagentBox

With a SensagentBox, visitors to your site can access reliable information on over 5 million pages provided by Sensagent.com. Choose the design that fits your site.

Business solution

Improve your site content

Add new content to your site from Sensagent by XML.

Crawl products or adds

Get XML access to reach the best products.

Index images and define metadata

Get XML access to fix the meaning of your metadata.

Please, email us to describe your idea.

Lettris

Lettris is a curious tetris-clone game where all the bricks have the same square shape but different content. Each square carries a letter. To make squares disappear and save space for other squares you have to assemble English words (left, right, up, down) from the falling squares.

boggle

Boggle gives you 3 minutes to find as many words (3 letters or more) as you can in a grid of 16 letters. You can also try the grid of 16 letters. Letters must be adjacent and longer words score better. See if you can get into the grid Hall of Fame !

English dictionary

Main references

Most English definitions are provided by WordNet .

English thesaurus is mainly derived from The Integral Dictionary (TID).

English Encyclopedia is licensed by Wikipedia (GNU).

Copyrights

The wordgames anagrams, crossword, Lettris and Boggle are provided by Memodata.

The web service Alexandria is granted from Memodata for the Ebay search.

The SensagentBox are offered by sensAgent.

Translation

Change the target language to find translations.

Tips: browse the semantic fields (see From ideas to words) in two languages to learn more.

last searches on the dictionary :

Todd Palin ·
Super OS ·
incest taboo ·
Victorians ·
jeanne d arc ·
RSO Records ·
GPR179 ·
Rail guns ·
Alan A'Court ·
Dompo language ·

2215 online visitors

computed in 0.046s

I would like to report:

section :

a spelling or a grammatical mistake

an offensive content(racist, pornographic, injurious, etc.)

a copyright violation

an error

a missing statement

other

please precise: