Paper 2008/300

Cheon's algorithm, pairing inversion and the discrete logarithm problem

David J. Mireles Morales

Abstract

We relate the fixed argument pairing inversion problems (FAPI) and the discrete logarithm problem on an elliptic curve. This is done using the reduction from the DLP to the Diffie-Hellman problem developed by Boneh, Lipton, Maurer and Wolf. This approach fails when only one of the FAPI problems can be solved. In this case we use Cheon's algorithm to get a reduction.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
DLPDiffie-Hellman problemFAPICheon's algorithm
Contact author(s)
david mireles @ gmail com
History
2008-07-07: received
Short URL
https://ia.cr/2008/300
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/300,
      author = {David J.  Mireles Morales},
      title = {Cheon's algorithm, pairing inversion and the discrete logarithm problem},
      howpublished = {Cryptology ePrint Archive, Paper 2008/300},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/300}},
      url = {https://eprint.iacr.org/2008/300}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.