Multiple Public-Key Algorithm X.509 Certificates
draft-truskovsky-lamps-pq-hybrid-x509-00
LAMPS A. Truskovsky
Internet-Draft P. Lafrance
Intended status: Standards Track D. Van Geest
Expires: September 1, 2018 ISARA Corporation
S. Fluhrer
P. Kampanakis
Cisco Systems
M. Ounsworth
S. Mister
Entrust Datacard, Ltd
February 28, 2018
Multiple Public-Key Algorithm X.509 Certificates
draft-truskovsky-lamps-pq-hybrid-x509-00
Abstract
This document describes a method of embedding alternative sets of
cryptographic materials into X.509v3 digital certificates, X.509v2
Certificate Revocation Lists (CRLs), and PKCS #10 Certificate Signing
Requests (CSRs). The embedded alternative cryptographic materials
allow a Public Key Infrastructure (PKI) to use multiple cryptographic
algorithms in a single object, and allow it to transition to the new
cryptographic algorithms while maintaining backwards compatibility
with systems using the existing algorithms. Three X.509 extensions
and three PKCS #10 attributes are defined, and the signing and
verification procedures for the alternative cryptographic material
contained in the extensions and attributes are detailed.
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on September 1, 2018.
Truskovsky, et al. Expires September 1, 2018 [Page 1]
Internet-Draft MPKAC February 2018
Copyright Notice
Copyright (c) 2018 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1. Requirements Language . . . . . . . . . . . . . . . . . . 4
1.2. Terminology . . . . . . . . . . . . . . . . . . . . . . . 4
2. Alternative Public-Key Algorithm Objects . . . . . . . . . . 5
2.1. OIDs . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.2. CSR Attributes . . . . . . . . . . . . . . . . . . . . . 5
2.2.1. Subject Alt Public Key Info Attribute . . . . . . . . 5
2.2.2. Alt Signature Algorithm Attribute . . . . . . . . . . 5
2.2.3. Alt Signature Value Attribute . . . . . . . . . . . . 6
2.3. X.509v3 Extensions . . . . . . . . . . . . . . . . . . . 6
2.3.1. Subject Alt Public Key Info Extension . . . . . . . . 6
2.3.2. Alt Signature Algorithm Extension . . . . . . . . . . 7
2.3.3. Alt Signature Value Extension . . . . . . . . . . . . 7
3. Multiple Public-Key Algorithm Certificate Signing Requests . 7
3.1. Creating Multiple Public-Key Algorithm CSRs . . . . . . . 8
3.2. Verifying Multiple Public-Key Algorithm CSRs . . . . . . 9
4. Multiple Public-Key Algorithm Certificates . . . . . . . . . 10
4.1. Creating Multiple Public-Key Algorithm Certificates . . . 11
4.2. Verifying Multiple Public-Key Algorithm Certificates . . 13
5. Multiple Public-Key Algorithm Certificate Revocation Lists . 15
5.1. Creating Multiple Public-Key Algorithm Certificate
Revocation Lists . . . . . . . . . . . . . . . . . . . . 16
5.2. Verifying Multiple Public-Key Algorithm Certificate
Revocation Lists . . . . . . . . . . . . . . . . . . . . 18
Show full document text