Subject: Re: [Cfrg] New Version Notification for draft-irtf-cfrg-pairing-friendly-curves-06.txt

From: Yumi Sakemi <[email-masked]>
Date: Tue, 16 Jun 2020 16:06:43 +0900

Dear CFRG members

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

In the latest draft, comments from Chloe who is an Expert Reviewer
 were reflected.
If you want to know the details of how to revise, you can check them
by closed issues on the official CFRG GitHub page.

https://github.com/cfrg/draft-irtf-cfrg-pairing-friendly-curves/issues?q=is%3Aissue+is%3Aclosed

Best regards,
Yumi

2020年6月16日(火) 16:04 <[email-masked]>:
>
>
> A new version of I-D, draft-irtf-cfrg-pairing-friendly-curves-06.txt
> has been successfully submitted by Yumi Sakemi and posted to the
> IETF repository.
>
> Name:           draft-irtf-cfrg-pairing-friendly-curves
> Revision:       06
> Title:          Pairing-Friendly Curves
> Document date:  2020-06-15
> Group:          cfrg
> Pages:          52
> URL:            https://www.ietf.org/internet-drafts/draft-irtf-cfrg-pairing-friendly-curves-06.txt
> Status:         https://datatracker.ietf.org/doc/draft-irtf-cfrg-pairing-friendly-curves/
> Htmlized:       https://tools.ietf.org/html/draft-irtf-cfrg-pairing-friendly-curves-06
> Htmlized:       https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-pairing-friendly-curves
> Diff:           https://www.ietf.org/rfcdiff?url2=draft-irtf-cfrg-pairing-friendly-curves-06
>
> 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.
>
>
>
>
> 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.
>
> The IETF Secretariat
>
>

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

E-Mail: [email-masked]