A provably secure elliptic curve scheme with fast encryption

David Galindo, Sebastià Martín, Tsuyoshi Takagi, Jorge L. Villar

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure against passive adversaries in the standard model. The scheme uses arithmetic modulo n 2, where n is an USA modulus, and merges ideas from Paillier and Rabin related schemes. Despite the typical bit length of n, our encryption algorithm is the fastest elliptic curve based encryption algorithm to the best of our knowledge, even faster than El Gamal elliptic curve encryption. The one-wayness (OW-CPA) of the new cryptosystem is as hard as factoring n while the semantic security (IND-CPA) is proved under a reasonable decisional assumption. Two new length-preserving trapdoor permutations equivalent to factoring are also described. κ Springer-Verlag 2004.

Original languageEnglish
Pages (from-to)245-259
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3348
Publication statusPublished - Dec 1 2004

Fingerprint

Elliptic Curves
Encryption
Cryptography
Factoring
Semantic Security
Modular arithmetic
Elliptic Curve Cryptosystem
Cryptosystem
Standard Model
Modulus
Permutation
Semantics

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

A provably secure elliptic curve scheme with fast encryption. / Galindo, David; Martín, Sebastià; Takagi, Tsuyoshi; Villar, Jorge L.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3348, 01.12.2004, p. 245-259.

Research output: Contribution to journalArticle

@article{71f7ebfad48c48d39a70b3a47a3e6279,
title = "A provably secure elliptic curve scheme with fast encryption",
abstract = "We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure against passive adversaries in the standard model. The scheme uses arithmetic modulo n 2, where n is an USA modulus, and merges ideas from Paillier and Rabin related schemes. Despite the typical bit length of n, our encryption algorithm is the fastest elliptic curve based encryption algorithm to the best of our knowledge, even faster than El Gamal elliptic curve encryption. The one-wayness (OW-CPA) of the new cryptosystem is as hard as factoring n while the semantic security (IND-CPA) is proved under a reasonable decisional assumption. Two new length-preserving trapdoor permutations equivalent to factoring are also described. κ Springer-Verlag 2004.",
author = "David Galindo and Sebasti{\`a} Mart{\'i}n and Tsuyoshi Takagi and Villar, {Jorge L.}",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3348",
pages = "245--259",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - A provably secure elliptic curve scheme with fast encryption

AU - Galindo, David

AU - Martín, Sebastià

AU - Takagi, Tsuyoshi

AU - Villar, Jorge L.

PY - 2004/12/1

Y1 - 2004/12/1

N2 - We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure against passive adversaries in the standard model. The scheme uses arithmetic modulo n 2, where n is an USA modulus, and merges ideas from Paillier and Rabin related schemes. Despite the typical bit length of n, our encryption algorithm is the fastest elliptic curve based encryption algorithm to the best of our knowledge, even faster than El Gamal elliptic curve encryption. The one-wayness (OW-CPA) of the new cryptosystem is as hard as factoring n while the semantic security (IND-CPA) is proved under a reasonable decisional assumption. Two new length-preserving trapdoor permutations equivalent to factoring are also described. κ Springer-Verlag 2004.

AB - We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure against passive adversaries in the standard model. The scheme uses arithmetic modulo n 2, where n is an USA modulus, and merges ideas from Paillier and Rabin related schemes. Despite the typical bit length of n, our encryption algorithm is the fastest elliptic curve based encryption algorithm to the best of our knowledge, even faster than El Gamal elliptic curve encryption. The one-wayness (OW-CPA) of the new cryptosystem is as hard as factoring n while the semantic security (IND-CPA) is proved under a reasonable decisional assumption. Two new length-preserving trapdoor permutations equivalent to factoring are also described. κ Springer-Verlag 2004.

UR - http://www.scopus.com/inward/record.url?scp=34249310876&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34249310876&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:34249310876

VL - 3348

SP - 245

EP - 259

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -