id: 05988754
dt: a
an: 05988754
au: Costello, Craig; Lauter, Kristin; Naehrig, Michael
ti: Attractive subfamilies of BLS curves for implementing high-security
    pairings.
so: Bernstein, Daniel J. (ed.) et al., Progress in cryptology ‒ INDOCRYPT
    2011. 12th international conference on cryptology in India, Chennai,
    India, December 11‒14, 2011. Proceedings. Berlin: Springer (ISBN
    978-3-642-25577-9/pbk). Lecture Notes in Computer Science 7107, 320-342
    (2011).
py: 2011
pu: Berlin: Springer
la: EN
cc: 
ut: Pairing-friendly; high-security pairings; BLS curves
ci: 
li: doi:10.1007/978-3-642-25578-6_23
ab: Summary: Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for
    implementing high-security pairings. This paper shows that particular
    choices of the pairing-friendly search parameter give rise to four
    subfamilies of BLS curves, all of which offer highly efficient and
    implementation-friendly pairing instantiations. Curves from these
    particular subfamilies are defined over prime fields that support very
    efficient towering options for the full extension field. The
    coefficients for a specific curve and its correct twist are
    automatically determined without any computational effort. The choice
    of an extremely sparse search parameter is immediately reflected by a
    highly efficient optimal ate Miller loop and final exponentiation. As a
    resource for implementors, we give a list with examples of
    implementation-friendly BLS curves through several high-security
    levels.
rv: