CMP Algorithms
draft-ietf-lamps-cmp-algorithms-00
| The information below is for an old version of the document |
| Document |
Type |
|
Active Internet-Draft (lamps WG)
|
|
Author |
|
Hendrik Brockhaus
|
|
Last updated |
|
2020-10-24
|
|
Stream |
|
IETF
|
|
Intended RFC status |
|
(None)
|
|
Formats |
|
pdf
htmlized (tools)
htmlized
bibtex
|
| Stream |
WG state
|
|
WG Document
|
|
Document shepherd |
|
No shepherd assigned
|
| IESG |
IESG state |
|
I-D Exists
|
|
Consensus Boilerplate |
|
Unknown
|
|
Telechat date |
|
|
|
Responsible AD |
|
(None)
|
|
Send notices to |
|
(None)
|
LAMPS Working Group H. Brockhaus
Internet-Draft Siemens
Intended status: Standards Track October 24, 2020
Expires: April 27, 2021
CMP Algorithms
draft-ietf-lamps-cmp-algorithms-00
Abstract
This document describes the conventions for using several
cryptographic algorithms with the Certificate Management Protocol
(CMP). CMP is used to enroll and further manage the lifecycle of
X.509 certificates.
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 April 27, 2021.
Copyright Notice
Copyright (c) 2020 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.
Brockhaus Expires April 27, 2021 [Page 1]
Internet-Draft CMP Algorithms October 2020
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
1.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 2
2. Message Digest Algorithms . . . . . . . . . . . . . . . . . . 3
2.1. SHA2 . . . . . . . . . . . . . . . . . . . . . . . . . . 3
3. Signature Algorithms . . . . . . . . . . . . . . . . . . . . 3
3.1. DSA . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
3.2. RSA . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
3.3. ECDSA . . . . . . . . . . . . . . . . . . . . . . . . . . 5
4. Key Management Algorithms . . . . . . . . . . . . . . . . . . 5
4.1. Key Agreement Algorithms . . . . . . . . . . . . . . . . 6
4.1.1. Diffie-Hellman . . . . . . . . . . . . . . . . . . . 6
4.1.2. ECDH . . . . . . . . . . . . . . . . . . . . . . . . 6
4.2. Key Transport Algorithms . . . . . . . . . . . . . . . . 7
4.2.1. RSA . . . . . . . . . . . . . . . . . . . . . . . . . 7
4.3. Symmetric Key-Encryption Algorithms . . . . . . . . . . . 7
4.3.1. AES Key Wrap with Padding . . . . . . . . . . . . . . 8
4.4. Key Derivation Algorithms . . . . . . . . . . . . . . . . 8
4.4.1. Password-based Key Derivation Function 2 . . . . . . 8
5. Content Encryption Algorithms . . . . . . . . . . . . . . . . 9
5.1. AES . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
6. Message Authentication Code Algorithms . . . . . . . . . . . 9
6.1. Password-based MAC . . . . . . . . . . . . . . . . . . . 9
6.2. Diffie-Hellman-based MAC . . . . . . . . . . . . . . . . 10
6.3. HMAC SHA2 . . . . . . . . . . . . . . . . . . . . . . . . 10
7. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 10
8. Security Considerations . . . . . . . . . . . . . . . . . . . 10
9. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 10
10. References . . . . . . . . . . . . . . . . . . . . . . . . . 11
10.1. Normative References . . . . . . . . . . . . . . . . . . 11
10.2. Informative References . . . . . . . . . . . . . . . . . 13
Appendix A. History of changes . . . . . . . . . . . . . . . . . 13
Author's Address . . . . . . . . . . . . . . . . . . . . . . . . 13
1. Introduction
1.1. Terminology
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in BCP 14 [RFC2119]
[RFC8174] when, and only when, they appear in all capitals, as shown
here.
Brockhaus Expires April 27, 2021 [Page 2]
Internet-Draft CMP Algorithms October 2020
2. Message Digest Algorithms
Show full document text