[CFRG] Fwd: I-D Action: draft-irtf-cfrg-pairing-friendly-curves-09.txt

[Yumi Sakemi <[e-mail]>]

Dear CFRG members

We submitted the version 09 of the draft "Pairing-Friendly Curves".

In the latest draft,  we update the document status and have some
editorial changes.
Because we are currently considering Rene's latest comments, I'm sorry
but this version does not reflect them.

For more information, please access the following URL.
https://datatracker.ietf.org/doc/draft-irtf-cfrg-pairing-friendly-curves/

Best regards,
Yumi


---------- Forwarded message ---------
From: <[e-mail]>
Date: 2020年11月16日(月) 23:10
Subject: I-D Action: draft-irtf-cfrg-pairing-friendly-curves-09.txt
To: <[e-mail]>
Cc: <[e-mail]>



A New Internet-Draft is available from the on-line Internet-Drafts directories.
This draft is a work item of the Crypto Forum RG of the IRTF.

        Title           : Pairing-Friendly Curves
        Authors         : Yumi Sakemi
                          Tetsutaro Kobayashi
                          Tsunekazu Saito
                          Riad S. Wahby
        Filename        : draft-irtf-cfrg-pairing-friendly-curves-09.txt
        Pages           : 54
        Date            : 2020-11-16

Abstract:
   Pairing-based cryptography, a subfield of elliptic curve
   cryptography, has received attention due to its flexible and
   practical functionality.  Pairings are special maps defined using
   elliptic curves and it can be applied to construct several
   cryptographic protocols such as identity-based encryption, attribute-
   based encryption, and so on.  At CRYPTO 2016, Kim and Barbulescu
   proposed an efficient number field sieve algorithm named exTNFS for
   the discrete logarithm problem in a finite field.  Several types of
   pairing-friendly curves such as Barreto-Naehrig curves are affected
   by the attack.  In particular, a Barreto-Naehrig curve with a 254-bit
   characteristic was adopted by a lot of cryptographic libraries as a
   parameter of 128-bit security, however, it ensures no more than the
   100-bit security level due to the effect of the attack.  In this
   memo, we list the security levels of certain pairing-friendly curves,
   and motivate our choices of curves.  First, we summarize the adoption
   status of pairing-friendly curves in standards, libraries and
   applications, and classify them in the 128-bit, 192-bit, and 256-bit
   security levels.  Then, from the viewpoints of "security" and "widely
   used", we select the recommended pairing-friendly curves considering
   exTNFS.


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-irtf-cfrg-pairing-friendly-curves/

There is also an HTML version available at:
https://www.ietf.org/archive/id/draft-irtf-cfrg-pairing-friendly-curves-09.html

A diff from the previous version is available at:
https://www.ietf.org/rfcdiff?url2=draft-irtf-cfrg-pairing-friendly-curves-09


Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org.

Internet-Drafts are also available by anonymous FTP at:
ftp://ftp.ietf.org/internet-drafts/


_______________________________________________
I-D-Announce mailing list
[e-mail]
https://www.ietf.org/mailman/listinfo/i-d-announce
Internet-Draft directories: http://www.ietf.org/shadow.html
or ftp://ftp.ietf.org/ietf/1shadow-sites.txt


-- 
Yumi Sakemi, Ph. D.
Lepidum Co. Ltd.

E-Mail: [e-mail]