Easy decision-Diffie-Hellman groups
| dc.creator | Galbraith, Steven | |
| dc.creator | Rotger, Victor | |
| dc.date | 2004-05-04 | |
| dc.date | 2004-09-20 | |
| dc.date.accessioned | 2026-07-07T05:07:55Z | |
| dc.date.available | 2026-07-07T05:07:55Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/0405054 | |
| dc.identifier | http://arxiv.org/abs/math/0405054 | |
| dc.identifier | London Mathematical Society J. Comput. Math. 7 (2004) 201-218 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71053 | |
| dc.subject | Number Theory | |
| dc.subject | Rings and Algebras | |
| dc.title | Easy decision-Diffie-Hellman groups | |
| dc.type | text |