[Cfrg] I submitted 3 drafts related to a pairing

[KATO Akihiro <[e-mail]>]

Hi cfrg folks,

A special map called a pairing on elliptic curves allow cryptographic
protocols to achieve functionally or efficiency.

We have recently submitted three I-Ds related paring.

draft-kato-fsu-key-exchange-00.txt
draft-kato-optimal-ate-pairings-00.txt
draft-kasamatsu-bncurves-01.txt

The I-Ds specifies key exchange protocols, pairing algorithm, and pairing
friendly curves respectively.

Those I-Ds are related to following Kasamatsu Kohei's post:
http://www.ietf.org/mail-archive/web/cfrg/current/msg04104.html

We would appreciate your comments and suggestions on our I-Ds and works.

Regards.

KATO, Akihiro


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


Title : FSU Key Exchange
Authors : Akihiro Kato
Thomas Hardjono
Tetsutaro Kobayashi
Tsunekazu Saito
Koutarou Suzuki
Filename : draft-kato-fsu-key-exchange-00.txt
Pages : 25
Date : 2015-07-06

Abstract:
This draft proposes an identity-based authenticated key exchange
protocol following the extended Canetti-Krawczyk (id-eCK) model. The
protocol is currently the most efficient among the id-eCK protocols.


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-kato-fsu-key-exchange/

There's also a htmlized version available at:
https://tools.ietf.org/html/draft-kato-fsu-key-exchange-00

-------
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-00.txt
	Pages           : 17
	Date            : 2015-07-06

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-00



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


    Title         : Barreto-Naehrig Curves
    Author(s)     : K. Kasamatsu, et al
    Filename      : draft-kasamatsu-bncurves
    Pages         : 24
    Date          : 2015-07-06

   Elliptic curves with pairings are useful tools for constructing
   cryptographic primitives.  In this memo, we specify domain parameters
   of Barreto-Naehrig curves (BN-curves) [8].  The BN-curve is an
   elliptic curve suitable for pairings and allows us to achieve high
   security and efficiency of cryptographic schemes.  This memo
   specifies domain parameters of four 254-bit BN-curves [1] [2] [5]
   which allow us to obtain efficient implementations.


A URL for this Internet-Draft is:
https://www.ietf.org/internet-drafts/draft-kasamatsu-bncurves-01.txt