• DocumentCode
    2098289
  • Title

    Constructing Pairing-friendly Elliptic Curves with Small rho

  • Author

    Wang, Mingqiang ; Jie, Cai

  • Author_Institution
    Sch. of Math., Shandong Univ., Jinan, China
  • fYear
    2011
  • fDate
    17-18 Sept. 2011
  • Firstpage
    195
  • Lastpage
    198
  • Abstract
    In this paper, we provide a method of constructing pairing-friendly elliptic curves on which the optimal pairing can be defined and the resulting curves have small ρ value approximate to 1. Our algorithm is explicit and works for arbitrary embedding degree k and large prime subgroup order r.
  • Keywords
    public key cryptography; arbitrary embedding degree; optimal pairing; pairing-friendly elliptic curves construction; prime subgroup order; Approximation algorithms; Elliptic curve cryptography; Elliptic curves; Lattices; Polynomials; Cyclotomic polynomial; Optimal pairing; Pairing lattice; Pairing-friendly;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Internet Computing & Information Services (ICICIS), 2011 International Conference on
  • Conference_Location
    Hong Kong
  • Print_ISBN
    978-1-4577-1561-7
  • Type

    conf

  • DOI
    10.1109/ICICIS.2011.56
  • Filename
    6063228
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2098289