Easy decision-Diffie-Hellman groups

Details Easy decision-Diffie-Hellman groups Easy decision-Diffie-Hellman groups

2004-05-04

arxiv.org/abs/math/0405054v2

London Mathematical Society J. Comput. Math. 7 (2004) 201-218

Mathematics

Number Theory

Scientific paper

The decision-Diffie-Hellman problem (DDH) is a central computational problem in cryptography. It is known that the Weil and Tate pairings can be used to solve many DDH problems on elliptic curves. Distortion maps are an important tool for solving DDH problems using pairings and it is known that distortion maps exist for all supersingular elliptic curves. We present an algorithm to construct suitable distortion maps. The algorithm is efficient on the curves usable in practice, and hence all DDH problems on these curves are easy. We also discuss the issue of which DDH problems on ordinary curves are easy.

Affiliated with

Also associated with

No associations

Rating

Easy decision-Diffie-Hellman groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Easy decision-Diffie-Hellman groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Easy decision-Diffie-Hellman groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-346329