Name
Abstract | ||
|---|---|---|
During the past decade pairing-based cryptosystems have been through a huge development, and the implementation of bilinear pairings has been improved greatly. Two pairing models, namely symmetric and asymmetric pairings, are widely used and have common cryptographic properties in most cryptosystems. Symmetric pairings are more convenient to construct cryptographic schemes, but asymmetric pairings are more efficient and suitable for implementation due to their flexible embedding degrees. In this paper we revisit symmetric pairings on supersingular elliptic curves over large characteristic fields. We show that a special family of supersingular elliptic curves with embedding degree 3 admits a kind of fast symmetric pairings, whose computational costs might be twice the costs for the current fastest asymmetric pairings. ? 2014 Springer International Publishing. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-04873-4_8 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
supersingular elliptic curve,symmetric pairing,verschiebung isogeny | Supersingular elliptic curve,Embedding,Algebra,Cryptography,Pairing,Cryptosystem,Mathematics,Bilinear interpolation | Conference |
Volume | Issue | ISSN |
8365 LNCS | null | 16113349 |
Citations | PageRank | References |
2 | 0.36 | 27 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xusheng Zhang | 1 | 39 | 13.00 |
| Kunpeng Wang | 2 | 41 | 11.79 |