On the vector decomposition problem for m-torsion points on an elliptic curve

Negar Kiyavash, Iwan M Duursma

Research output: Contribution to journalConference article

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 languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2004
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On the vector decomposition problem for m-torsion points on an elliptic curve'. Together they form a unique fingerprint.

  • Cite this