I-D Action: draft-kato-optimal-ate-pairings-01.txt

internet-drafts@ietf.org Thu, 24 March 2016 15:09 UTC

Return-Path: <internet-drafts@ietf.org>
X-Original-To: i-d-announce@ietf.org
Delivered-To: i-d-announce@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id 43BB612DCFF for <i-d-announce@ietf.org>; Thu, 24 Mar 2016 08:09:08 -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
Subject: I-D Action: draft-kato-optimal-ate-pairings-01.txt
X-Test-IDTracker: no
X-IETF-IDTracker: 6.17.0
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <20160324150908.3932.5973.idtracker@ietfa.amsl.com>
Date: Thu, 24 Mar 2016 08:09:08 -0700
Archived-At: <http://mailarchive.ietf.org/arch/msg/i-d-announce/KtNDg6kKyNNEaTnbuOBpkvFr_1w>
X-BeenThere: i-d-announce@ietf.org
X-Mailman-Version: 2.1.17
Reply-To: internet-drafts@ietf.org
List-Id: Internet Draft Announcements only <i-d-announce.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/i-d-announce>, <mailto:i-d-announce-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/i-d-announce/>
List-Post: <mailto:i-d-announce@ietf.org>
List-Help: <mailto:i-d-announce-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/i-d-announce>, <mailto:i-d-announce-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 24 Mar 2016 15:09:08 -0000

A New Internet-Draft is available from the on-line Internet-Drafts directories.


        Title           : Optimal Ate Pairing
        Authors         : Akihiro Kato
                          Michael Scott
                          Tetsutaro Kobayashi
                          Yuto Kawahara
	Filename        : draft-kato-optimal-ate-pairings-01.txt
	Pages           : 17
	Date            : 2016-03-18

Abstract:
   Pairing is a special map from two elliptic curve that called Pairing-
   friend curves to a finite field and is useful mathematical tools for
   constructing cryptographic primitives.  It allows us to construct
   powerful primitives. (e.g. [3] and [4])

   There are some types of pairing and its choice has an impact on the
   performance of the primitive.  For example, Tate Pairing [3] and Ate
   Pairing [4] are specified in IETF.  This memo focuses on Optimal Ate
   Pairing [2] which is an improvement of Ate Pairing.

   This memo defines Optimal Ate Pairing for any pairing-friendly curve.
   We can obtain concrete algorithm by deciding parameters and building
   blocks based on the form of a curve and the description in this memo.
   It enables us to reduce the cost for specifying Optimal Ate Pairing
   over additional curves.  Furthermore, this memo provides concrete
   algorithm for Optimal Ate Pairing over BN-curves [7] and its test
   vectors.


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-kato-optimal-ate-pairings/

There's also a htmlized version available at:
https://tools.ietf.org/html/draft-kato-optimal-ate-pairings-01

A diff from the previous version is available at:
https://www.ietf.org/rfcdiff?url2=draft-kato-optimal-ate-pairings-01


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/