Abstract
The vector decomposition problem for m-torsion points on an elliptic curve was discussed. The study proves sufficient conditions for which vector decomposition (VDP) on a two-dimensional vector space was at least as hard as the computational Diffie-Hellman Problem (CDHP) on a one-dimensional subspace. It was proved that any elliptic curve for which sufficient conditions hold was bound to be supersingular. In addition to this, a study gives family of hyperelliptic curves of genus two that were suitable for the VDP.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 548 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2004 |
| Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics