Re: [pkng] Possible research areas for pkng

"David A. Cooper" <david.cooper@nist.gov> Thu, 12 November 2009 15:23 UTC

Return-Path: <david.cooper@nist.gov>
X-Original-To: pkng@core3.amsl.com
Delivered-To: pkng@core3.amsl.com
Received: from localhost (localhost [127.0.0.1]) by core3.amsl.com (Postfix) with ESMTP id 2DD7C3A695A for <pkng@core3.amsl.com>; Thu, 12 Nov 2009 07:23:26 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -5.625
X-Spam-Level:
X-Spam-Status: No, score=-5.625 tagged_above=-999 required=5 tests=[AWL=-0.484, BAYES_00=-2.599, HTML_MESSAGE=0.001, MIME_HTML_ONLY=1.457, RCVD_IN_DNSWL_MED=-4]
Received: from mail.ietf.org ([64.170.98.32]) by localhost (core3.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id Ntl97sk3Fpca for <pkng@core3.amsl.com>; Thu, 12 Nov 2009 07:23:25 -0800 (PST)
Received: from smtp.nist.gov (rimp2.nist.gov [129.6.16.227]) by core3.amsl.com (Postfix) with ESMTP id A8DCA3A6BC6 for <pkng@irtf.org>; Thu, 12 Nov 2009 07:23:24 -0800 (PST)
Received: from st26.ncsl.nist.gov (st26.ncsl.nist.gov [129.6.54.72]) by smtp.nist.gov (8.13.1/8.13.1) with ESMTP id nACFNYAL013596; Thu, 12 Nov 2009 10:23:34 -0500
Message-ID: <4AFC2875.8060108@nist.gov>
Date: Thu, 12 Nov 2009 10:23:33 -0500
From: "David A. Cooper" <david.cooper@nist.gov>
User-Agent: Thunderbird 2.0.0.23 (X11/20090822)
MIME-Version: 1.0
To: Tim Polk <tim.polk@nist.gov>
References: <D7A0423E5E193F40BE6E94126930C49307898F9041@MBCLUSTER.xchange.nist.gov>, <4AFBCDF3.9000302@cs.tcd.ie> <D7A0423E5E193F40BE6E94126930C49307898F9046@MBCLUSTER.xchange.nist.gov>
In-Reply-To: <D7A0423E5E193F40BE6E94126930C49307898F9046@MBCLUSTER.xchange.nist.gov>
Content-Type: text/html; charset="us-ascii"
Content-Transfer-Encoding: 7bit
X-NIST-MailScanner: Found to be clean
X-NIST-MailScanner-From: david.cooper@nist.gov
Cc: "pkng@irtf.org" <pkng@irtf.org>
Subject: Re: [pkng] Possible research areas for pkng
X-BeenThere: pkng@irtf.org
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: "Public Key Next Generation \(PKNG\) Research Group" <pkng.irtf.org>
List-Unsubscribe: <https://www.irtf.org/mailman/listinfo/pkng>, <mailto:pkng-request@irtf.org?subject=unsubscribe>
List-Archive: <http://www.irtf.org/mail-archive/web/pkng>
List-Post: <mailto:pkng@irtf.org>
List-Help: <mailto:pkng-request@irtf.org?subject=help>
List-Subscribe: <https://www.irtf.org/mailman/listinfo/pkng>, <mailto:pkng-request@irtf.org?subject=subscribe>
X-List-Received-Date: Thu, 12 Nov 2009 15:23:26 -0000

Tim,

The paper you are referring to was presented at IDtrust 2009 (http://middleware.internet2.edu/idtrust/2009/program.html" rel="nofollow">http://middleware.internet2.edu/idtrust/2009/program.html), and both the paper and Ray's presentation slides are available from the conferences web site:

   paper: http://middleware.internet2.edu/idtrust/2009/papers/07-perlner-quantum.pdf" rel="nofollow">http://middleware.internet2.edu/idtrust/2009/papers/07-perlner-quantum.pdf
   presentation slides: http://middleware.internet2.edu/idtrust/2009/slides/07-perlner-quantum.ppt" rel="nofollow">http://middleware.internet2.edu/idtrust/2009/slides/07-perlner-quantum.ppt

Dave

Polk, William T. wrote:
I don't know if the cfrg has looked at these algorithms or not; I was using a paper by Ray Perlner and David Cooper as the source for candidate algorithms.  When I get back to NIST, I'll get a copy and ship to both pkng and cfrg.

Tim
________________________________________
From: Stephen Farrell [stephen.farrell@cs.tcd.ie]
Sent: Thursday, November 12, 2009 3:57 AM
To: Polk, William T.
Cc: pkng@irtf.org
Subject: Re: [pkng] Possible research areas for pkng

Polk, William T. wrote:
  
Folks,

While I am not losing any sleep over quantum computing, success in this technology area would be a real game changer for PKI.  There is a set of algorithms that are plausibly quantum resistant, but they are generally unsuitable for X.509 style PKI.  Keys are huge with one algorithm, and can only be used to generate limited numbers of signatures with another.  I would be very interested in any work that explored alternative infrastructures better suited to these algorithms.  It behooves us to be ready...
    
Good one. Have cfrg done any of the basic work there? I would assume
that they'd be better placed to nominate potential algorithms, and
our job would be to see what that meant for our non-infrastructure.

S.