Constructing Elliptic Curves with Prescribed Embedding Degrees

Abstract

Pairing-based cryptosystems depend on the existence of groups where the Decision Diffie-Hellman problem is easy to solve, but the Computational Diffie-Hellman problem is hard. Such is the case of elliptic curve groups whose embedding degree is large enough to maintain a good security level, but small enough for arithmetic operations to be feasible. However… (More)
DOI: 10.1007/3-540-36413-7_19

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Statistics

01020'02'04'06'08'10'12'14'16'18
Citations per Year

135 Citations

Semantic Scholar estimates that this publication has 135 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics