Content deleted Content added
m Categorizing article - You can help! |
No edit summary |
||
Line 3:
For example, in groups equipped with a [[bilinear mapping]] such as the [[Weil pairing]] or [[Tate pairing]], generalizations of the [[Diffie–Hellman problem|computational Diffie–Hellman problem]] are believed to be infeasible while the simpler [[decisional Diffie–Hellman assumption|decisional Diffie–Hellman problem]] can be easily solved using the pairing function. The first group is sometimes referred to as a '''Gap Group''' because of the assumed difference in difficulty between these two problems in the group.
While first used for [[cryptanalysis]], pairings have since been used to construct many cryptographic systems for which no other efficient implementation is known, such as [[identity based encryption]]
==External links==
| |||