Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Implementation of bilinear pairings over elliptic curves with embedding degree 24
- Authors
- Kim, I.T.; Park, C.; Hwang, S.O.; Park, C.-M.
- Issue Date
- 2011
- Keywords
- Ate pairing; pairing-friendly curve; Tate pairing
- Citation
- Communications in Computer and Information Science, v.262 CCIS, no.PART 1, pp.37 - 43
- Journal Title
- Communications in Computer and Information Science
- Volume
- 262 CCIS
- Number
- PART 1
- Start Page
- 37
- End Page
- 43
- ISSN
- 1865-0929
- Abstract
- Most implementations of pairing-based cryptography are using pairing-friendly curves with an embedding degree k ≤ 12. They have security levels of up to 128 bits. In this paper, we consider a family of pairing-friendly curves with embedding degree k = 24, which have an enhanced security level of 192 bits. We also describe an efficient implementation of Tate and Ate pairings using field arithmetic in ; this includes a careful selection of the parameters with small hamming weight and a novel approach to final exponentiation, which reduces the number of computations required. © 2011 Springer-Verlag.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.