[Cfrg] I-D Action: draft-irtf-cfrg-pairing-friendly-curves-04.txt

internet-drafts@ietf.org Tue, 28 April 2020 11:19 UTC

Return-Path: <internet-drafts@ietf.org>
X-Original-To: cfrg@ietf.org
Delivered-To: cfrg@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id 2ED493A1377; Tue, 28 Apr 2020 04:19:11 -0700 (PDT)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: i-d-announce@ietf.org
Cc: cfrg@ietf.org
X-Test-IDTracker: no
X-IETF-IDTracker: 6.128.0
Auto-Submitted: auto-generated
Precedence: bulk
Reply-To: cfrg@ietf.org
Message-ID: <158807275110.30968.7143445908199241552@ietfa.amsl.com>
Date: Tue, 28 Apr 2020 04:19:11 -0700
Archived-At: <https://mailarchive.ietf.org/arch/msg/cfrg/7LX6ER7C-zGGiVSayCXJuKRrZG0>
Subject: [Cfrg] I-D Action: draft-irtf-cfrg-pairing-friendly-curves-04.txt
X-BeenThere: cfrg@irtf.org
X-Mailman-Version: 2.1.29
List-Id: Crypto Forum Research Group <cfrg.irtf.org>
List-Unsubscribe: <https://www.irtf.org/mailman/options/cfrg>, <mailto:cfrg-request@irtf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/cfrg/>
List-Post: <mailto:cfrg@irtf.org>
List-Help: <mailto:cfrg-request@irtf.org?subject=help>
List-Subscribe: <https://www.irtf.org/mailman/listinfo/cfrg>, <mailto:cfrg-request@irtf.org?subject=subscribe>
X-List-Received-Date: Tue, 28 Apr 2020 11:19:11 -0000

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
	Filename        : draft-irtf-cfrg-pairing-friendly-curves-04.txt
	Pages           : 44
	Date            : 2020-04-28

   Pairing-based cryptography, a variant of elliptic curve cryptography,
   has received attention for its flexible and applicable functionality.
   Pairing is a special map defined over 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 a 100-bit security level due to the
   effect of the attack.  In this memo, we summarize the adoption status
   of pairing-friendly curves in standards, libraries and applications,
   and classify them in 128-bit, 192-bit, and 256-bit security levels.
   Then, from the viewpoints of "security" and "widely use", we select
   the recommended pairing-friendly curves considering exTNFS.

The IETF datatracker status page for this draft is:

There are also htmlized versions available at:

A diff from the previous version is available at:

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: