Paper 2002/037

An efficient semantically secure elliptic curve cryptosystem based on KMOV

David Galindo, Sebastià Mart\'ın, Paz Morillo, and Jorge L. Villar

Abstract

We propose an elliptic curve scheme over the ring $\entq$, which is efficient and semantically secure in the standard model. There appears to be no previous elliptic curve cryptosystem based on factoring that enjoys both of these properties. KMOV scheme has been used as an underlying primitive to obtain efficiency and probabilistic encryption. Semantic security of the scheme is based on a new decisional assumption, namely, the Decisional Small-$x$ $e$-Multiples Assumption. Confidence on this assumption is also discussed.

Note: Revision.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
elliptic curve cryptosystemsemantic security.
Contact author(s)
dgalindo @ mat upc es
History
2002-11-27: last of 2 revisions
2002-03-22: received
See all versions
Short URL
https://ia.cr/2002/037
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2002/037,
      author = {David Galindo and Sebastià Mart\'ın and Paz Morillo and Jorge L.  Villar},
      title = {An efficient semantically secure elliptic curve cryptosystem based on KMOV},
      howpublished = {Cryptology ePrint Archive, Paper 2002/037},
      year = {2002},
      note = {\url{https://eprint.iacr.org/2002/037}},
      url = {https://eprint.iacr.org/2002/037}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.