Debian Codegraph @

rfc3279.html

raw
1 <pre>Network Working Group W. Polk
2 Request for Comments: 3279 NIST
3 Obsoletes: <a href="./rfc2528">2528</a> R. Housley
4 Category: Standards Track RSA Laboratories
5 L. Bassham
6 NIST
7 April 2002
8
9 <span class="h1">Algorithms and Identifiers for the</span>
10 <span class="h1">Internet X.509 Public Key Infrastructure</span>
11 <span class="h1">Certificate and Certificate Revocation List (CRL) Profile</span>
12
13 Status of this Memo
14
15 This document specifies an Internet standards track protocol for the
16 Internet community, and requests discussion and suggestions for
17 improvements. Please refer to the current edition of the "Internet
18 Official Protocol Standards" (STD 1) for the standardization state
19 and status of this protocol. Distribution of this memo is unlimited.
20
21 Copyright Notice
22
23 Copyright (C) The Internet Society (2002). All Rights Reserved.
24
25 Abstract
26
27 This document specifies algorithm identifiers and ASN.1 encoding
28 formats for digital signatures and subject public keys used in the
29 Internet X.509 Public Key Infrastructure (PKI). Digital signatures
30 are used to sign certificates and certificate revocation list (CRLs).
31 Certificates include the public key of the named subject.
32
33 Table of Contents
34
35 <a href="#section-1">1</a> Introduction . . . . . . . . . . . . . . . . . . . . . . <a href="#page-2">2</a>
36 <a href="#section-2">2</a> Algorithm Support . . . . . . . . . . . . . . . . . . . . <a href="#page-3">3</a>
37 <a href="#section-2.1">2.1</a> One-Way Hash Functions . . . . . . . . . . . . . . . . <a href="#page-3">3</a>
38 <a href="#section-2.1.1">2.1.1</a> MD2 One-Way Hash Functions . . . . . . . . . . . . . <a href="#page-3">3</a>
39 <a href="#section-2.1.2">2.1.2</a> MD5 One-Way Hash Functions . . . . . . . . . . . . . <a href="#page-4">4</a>
40 <a href="#section-2.1.3">2.1.3</a> SHA-1 One-Way Hash Functions . . . . . . . . . . . . <a href="#page-4">4</a>
41 <a href="#section-2.2">2.2</a> Signature Algorithms . . . . . . . . . . . . . . . . . <a href="#page-4">4</a>
42 <a href="#section-2.2.1">2.2.1</a> RSA Signature Algorithm . . . . . . . . . . . . . . . <a href="#page-5">5</a>
43 <a href="#section-2.2.2">2.2.2</a> DSA Signature Algorithm . . . . . . . . . . . . . . . <a href="#page-6">6</a>
44 <a href="#section-2.2.3">2.2.3</a> Elliptic Curve Digital Signature Algorithm . . . . . <a href="#page-7">7</a>
45 <a href="#section-2.3">2.3</a> Subject Public Key Algorithms . . . . . . . . . . . . . <a href="#page-7">7</a>
46 <a href="#section-2.3.1">2.3.1</a> RSA Keys . . . . . . . . . . . . . . . . . . . . . . <a href="#page-8">8</a>
47 <a href="#section-2.3.2">2.3.2</a> DSA Signature Keys . . . . . . . . . . . . . . . . . <a href="#page-9">9</a>
48 <a href="#section-2.3.3">2.3.3</a> Diffie-Hellman Key Exchange Keys . . . . . . . . . . <a href="#page-10">10</a>
49
50
51
52 <span class="grey">Polk, et al. Standards Track [Page 1]</span></pre>
53 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
54 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
55
56
57 <a href="#section-2.3.4">2.3.4</a> KEA Public Keys . . . . . . . . . . . . . . . . . . . <a href="#page-11">11</a>
58 <a href="#section-2.3.5">2.3.5</a> ECDSA and ECDH Public Keys . . . . . . . . . . . . . <a href="#page-13">13</a>
59 <a href="#section-3">3</a> ASN.1 Module . . . . . . . . . . . . . . . . . . . . . . <a href="#page-18">18</a>
60 <a href="#section-4">4</a> References . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-24">24</a>
61 <a href="#section-5">5</a> Security Considerations . . . . . . . . . . . . . . . . . <a href="#page-25">25</a>
62 <a href="#section-6">6</a> Intellectual Property Rights . . . . . . . . . . . . . . <a href="#page-26">26</a>
63 <a href="#section-7">7</a> Author Addresses . . . . . . . . . . . . . . . . . . . . <a href="#page-26">26</a>
64 <a href="#section-8">8</a> Full Copyright Statement . . . . . . . . . . . . . . . . <a href="#page-27">27</a>
65
66 <span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a> Introduction</span>
67
68 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
69 "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
70 document are to be interpreted as described in [<a href="./rfc2119">RFC 2119</a>].
71
72 This document specifies algorithm identifiers and ASN.1 [<a href="#ref-X.660" title="Canonical Encoding Rules (CER) and Distinguished Encoding Rules (DER)">X.660</a>]
73 encoding formats for digital signatures and subject public keys used
74 in the Internet X.509 Public Key Infrastructure (PKI). This
75 specification supplements [<a href="./rfc3280">RFC 3280</a>], "Internet X.509 Public Key
76 Infrastructure: Certificate and Certificate Revocation List (CRL)
77 Profile." Implementations of this specification MUST also conform to
78 <a href="./rfc3280">RFC 3280</a>.
79
80 This specification defines the contents of the signatureAlgorithm,
81 signatureValue, signature, and subjectPublicKeyInfo fields within
82 Internet X.509 certificates and CRLs.
83
84 This document identifies one-way hash functions for use in the
85 generation of digital signatures. These algorithms are used in
86 conjunction with digital signature algorithms.
87
88 This specification describes the encoding of digital signatures
89 generated with the following cryptographic algorithms:
90
91 * Rivest-Shamir-Adelman (RSA);
92 * Digital Signature Algorithm (DSA); and
93 * Elliptic Curve Digital Signature Algorithm (ECDSA).
94
95 This document specifies the contents of the subjectPublicKeyInfo
96 field in Internet X.509 certificates. For each algorithm, the
97 appropriate alternatives for the the keyUsage extension are provided.
98 This specification describes encoding formats for public keys used
99 with the following cryptographic algorithms:
100
101 * Rivest-Shamir-Adelman (RSA);
102 * Digital Signature Algorithm (DSA);
103 * Diffie-Hellman (DH);
104 * Key Encryption Algorithm (KEA);
105
106
107
108 <span class="grey">Polk, et al. Standards Track [Page 2]</span></pre>
109 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
110 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
111
112
113 * Elliptic Curve Digital Signature Algorithm (ECDSA); and
114 * Elliptic Curve Diffie-Hellman (ECDH).
115
116 <span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a> Algorithm Support</span>
117
118 This section describes cryptographic algorithms which may be used
119 with the Internet X.509 certificate and CRL profile [<a href="./rfc3280">RFC 3280</a>]. This
120 section describes one-way hash functions and digital signature
121 algorithms which may be used to sign certificates and CRLs, and
122 identifies object identifiers (OIDs) for public keys contained in a
123 certificate.
124
125 Conforming CAs and applications MUST, at a minimum, support digital
126 signatures and public keys for one of the specified algorithms. When
127 using any of the algorithms identified in this specification,
128 conforming CAs and applications MUST support them as described.
129
130 <span class="h3"><a class="selflink" id="section-2.1" href="#section-2.1">2.1</a> One-way Hash Functions</span>
131
132 This section identifies one-way hash functions for use in the
133 Internet X.509 PKI. One-way hash functions are also called message
134 digest algorithms. SHA-1 is the preferred one-way hash function for
135 the Internet X.509 PKI. However, PEM uses MD2 for certificates [RFC
136 1422] [<a href="./rfc1423">RFC 1423</a>] and MD5 is used in other legacy applications. For
137 these reasons, MD2 and MD5 are included in this profile. The data
138 that is hashed for certificate and CRL signing is fully described in
139 [<a href="./rfc3280">RFC 3280</a>].
140
141 <span class="h4"><a class="selflink" id="section-2.1.1" href="#section-2.1.1">2.1.1</a> MD2 One-way Hash Function</span>
142
143 MD2 was developed by Ron Rivest for RSA Security. RSA Security has
144 recently placed the MD2 algorithm in the public domain. Previously,
145 RSA Data Security had granted license for use of MD2 for non-
146 commercial Internet Privacy-Enhanced Mail (PEM). MD2 may continue to
147 be used with PEM certificates, but SHA-1 is preferred. MD2 produces
148 a 128-bit "hash" of the input. MD2 is fully described in [<a href="./rfc1319">RFC 1319</a>].
149
150 At the Selected Areas in Cryptography '95 conference in May 1995,
151 Rogier and Chauvaud presented an attack on MD2 that can nearly find
152 collisions [<a href="#ref-RC95" title="&quot;The compression function of MD2 is not collision free,&quot;">RC95</a>]. Collisions occur when one can find two different
153 messages that generate the same message digest. A checksum operation
154 in MD2 is the only remaining obstacle to the success of the attack.
155 For this reason, the use of MD2 for new applications is discouraged.
156 It is still reasonable to use MD2 to verify existing signatures, as
157 the ability to find collisions in MD2 does not enable an attacker to
158 find new messages having a previously computed hash value.
159
160
161
162
163
164 <span class="grey">Polk, et al. Standards Track [Page 3]</span></pre>
165 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
166 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
167
168
169 <span class="h4"><a class="selflink" id="section-2.1.2" href="#section-2.1.2">2.1.2</a> MD5 One-way Hash Function</span>
170
171 MD5 was developed by Ron Rivest for RSA Security. RSA Security has
172 placed the MD5 algorithm in the public domain. MD5 produces a 128-
173 bit "hash" of the input. MD5 is fully described in [<a href="./rfc1321">RFC 1321</a>].
174
175 Den Boer and Bosselaers [DB94] have found pseudo-collisions for MD5,
176 but there are no other known cryptanalytic results. The use of MD5
177 for new applications is discouraged. It is still reasonable to use
178 MD5 to verify existing signatures.
179
180 <span class="h4"><a class="selflink" id="section-2.1.3" href="#section-2.1.3">2.1.3</a> SHA-1 One-way Hash Function</span>
181
182 SHA-1 was developed by the U.S. Government. SHA-1 produces a 160-bit
183 "hash" of the input. SHA-1 is fully described in [FIPS 180-1]. <a href="./rfc3174">RFC</a>
184 <a href="./rfc3174">3174</a> [<a href="./rfc3174">RFC 3174</a>] also describes SHA-1, and it provides an
185 implementation of the algorithm.
186
187 <span class="h3"><a class="selflink" id="section-2.2" href="#section-2.2">2.2</a> Signature Algorithms</span>
188
189 Certificates and CRLs conforming to [<a href="./rfc3280">RFC 3280</a>] may be signed with any
190 public key signature algorithm. The certificate or CRL indicates the
191 algorithm through an algorithm identifier which appears in the
192 signatureAlgorithm field within the Certificate or CertificateList.
193 This algorithm identifier is an OID and has optionally associated
194 parameters. This section identifies algorithm identifiers and
195 parameters that MUST be used in the signatureAlgorithm field in a
196 Certificate or CertificateList.
197
198 Signature algorithms are always used in conjunction with a one-way
199 hash function.
200
201 This section identifies OIDS for RSA, DSA, and ECDSA. The contents
202 of the parameters component for each algorithm vary; details are
203 provided for each algorithm.
204
205 The data to be signed (e.g., the one-way hash function output value)
206 is formatted for the signature algorithm to be used. Then, a private
207 key operation (e.g., RSA encryption) is performed to generate the
208 signature value. This signature value is then ASN.1 encoded as a BIT
209 STRING and included in the Certificate or CertificateList in the
210 signature field.
211
212
213
214
215
216
217
218
219
220 <span class="grey">Polk, et al. Standards Track [Page 4]</span></pre>
221 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
222 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
223
224
225 <span class="h4"><a class="selflink" id="section-2.2.1" href="#section-2.2.1">2.2.1</a> RSA Signature Algorithm</span>
226
227 The RSA algorithm is named for its inventors: Rivest, Shamir, and
228 Adleman. This profile includes three signature algorithms based on
229 the RSA asymmetric encryption algorithm. The signature algorithms
230 combine RSA with either the MD2, MD5, or the SHA-1 one-way hash
231 functions.
232
233 The signature algorithm with SHA-1 and the RSA encryption algorithm
234 is implemented using the padding and encoding conventions described
235 in PKCS #1 [<a href="./rfc2313">RFC 2313</a>]. The message digest is computed using the
236 SHA-1 hash algorithm.
237
238 The RSA signature algorithm, as specified in PKCS #1 [<a href="./rfc2313">RFC 2313</a>]
239 includes a data encoding step. In this step, the message digest and
240 the OID for the one-way hash function used to compute the digest are
241 combined. When performing the data encoding step, the md2, md5, and
242 id-sha1 OIDs MUST be used to specify the MD2, MD5, and SHA-1 one-way
243 hash functions, respectively:
244
245 md2 OBJECT IDENTIFIER ::= {
246 iso(1) member-body(2) US(840) rsadsi(113549)
247 digestAlgorithm(2) 2 }
248
249 md5 OBJECT IDENTIFIER ::= {
250 iso(1) member-body(2) US(840) rsadsi(113549)
251 digestAlgorithm(2) 5 }
252
253 id-sha1 OBJECT IDENTIFIER ::= {
254 iso(1) identified-organization(3) oiw(14) secsig(3)
255 algorithms(2) 26 }
256
257 The signature algorithm with MD2 and the RSA encryption algorithm is
258 defined in PKCS #1 [<a href="./rfc2313">RFC 2313</a>]. As defined in PKCS #1 [<a href="./rfc2313">RFC 2313</a>], the
259 ASN.1 OID used to identify this signature algorithm is:
260
261 md2WithRSAEncryption OBJECT IDENTIFIER ::= {
262 iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1)
263 pkcs-1(1) 2 }
264
265 The signature algorithm with MD5 and the RSA encryption algorithm is
266 defined in PKCS #1 [<a href="./rfc2313">RFC 2313</a>]. As defined in PKCS #1 [<a href="./rfc2313">RFC 2313</a>], the
267 ASN.1 OID used to identify this signature algorithm is:
268
269 md5WithRSAEncryption OBJECT IDENTIFIER ::= {
270 iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1)
271 pkcs-1(1) 4 }
272
273
274
275
276 <span class="grey">Polk, et al. Standards Track [Page 5]</span></pre>
277 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
278 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
279
280
281 The ASN.1 object identifier used to identify this signature algorithm
282 is:
283
284 sha-1WithRSAEncryption OBJECT IDENTIFIER ::= {
285 iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1)
286 pkcs-1(1) 5 }
287
288 When any of these three OIDs appears within the ASN.1 type
289 AlgorithmIdentifier, the parameters component of that type SHALL be
290 the ASN.1 type NULL.
291
292 The RSA signature generation process and the encoding of the result
293 is described in detail in PKCS #1 [<a href="./rfc2313">RFC 2313</a>].
294
295 <span class="h4"><a class="selflink" id="section-2.2.2" href="#section-2.2.2">2.2.2</a> DSA Signature Algorithm</span>
296
297 The Digital Signature Algorithm (DSA) is defined in the Digital
298 Signature Standard (DSS). DSA was developed by the U.S. Government,
299 and DSA is used in conjunction with the SHA-1 one-way hash function.
300 DSA is fully described in [FIPS 186]. The ASN.1 OID used to identify
301 this signature algorithm is:
302
303 id-dsa-with-sha1 OBJECT IDENTIFIER ::= {
304 iso(1) member-body(2) us(840) x9-57 (10040)
305 x9cm(4) 3 }
306
307 When the id-dsa-with-sha1 algorithm identifier appears as the
308 algorithm field in an AlgorithmIdentifier, the encoding SHALL omit
309 the parameters field. That is, the AlgorithmIdentifier SHALL be a
310 SEQUENCE of one component: the OBJECT IDENTIFIER id-dsa-with-sha1.
311
312 The DSA parameters in the subjectPublicKeyInfo field of the
313 certificate of the issuer SHALL apply to the verification of the
314 signature.
315
316 When signing, the DSA algorithm generates two values. These values
317 are commonly referred to as r and s. To easily transfer these two
318 values as one signature, they SHALL be ASN.1 encoded using the
319 following ASN.1 structure:
320
321 Dss-Sig-Value ::= SEQUENCE {
322 r INTEGER,
323 s INTEGER }
324
325
326
327
328
329
330
331
332 <span class="grey">Polk, et al. Standards Track [Page 6]</span></pre>
333 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span>
334 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
335
336
337 <span class="h4"><a class="selflink" id="section-2.2.3" href="#section-2.2.3">2.2.3</a> ECDSA Signature Algorithm</span>
338
339 The Elliptic Curve Digital Signature Algorithm (ECDSA) is defined in
340 [<a href="#ref-X9.62" title="&quot;Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA)&quot;">X9.62</a>]. The ASN.1 object identifiers used to identify ECDSA are
341 defined in the following arc:
342
343 ansi-X9-62 OBJECT IDENTIFIER ::= {
344 iso(1) member-body(2) us(840) 10045 }
345
346 id-ecSigType OBJECT IDENTIFIER ::= {
347 ansi-X9-62 signatures(4) }
348
349 ECDSA is used in conjunction with the SHA-1 one-way hash function.
350 The ASN.1 object identifier used to identify ECDSA with SHA-1 is:
351
352 ecdsa-with-SHA1 OBJECT IDENTIFIER ::= {
353 id-ecSigType 1 }
354
355 When the ecdsa-with-SHA1 algorithm identifier appears as the
356 algorithm field in an AlgorithmIdentifier, the encoding MUST omit the
357 parameters field. That is, the AlgorithmIdentifier SHALL be a
358 SEQUENCE of one component: the OBJECT IDENTIFIER ecdsa-with-SHA1.
359
360 The elliptic curve parameters in the subjectPublicKeyInfo field of
361 the certificate of the issuer SHALL apply to the verification of the
362 signature.
363
364 When signing, the ECDSA algorithm generates two values. These values
365 are commonly referred to as r and s. To easily transfer these two
366 values as one signature, they MUST be ASN.1 encoded using the
367 following ASN.1 structure:
368
369 Ecdsa-Sig-Value ::= SEQUENCE {
370 r INTEGER,
371 s INTEGER }
372
373 <span class="h3"><a class="selflink" id="section-2.3" href="#section-2.3">2.3</a> Subject Public Key Algorithms</span>
374
375 Certificates conforming to [<a href="./rfc3280">RFC 3280</a>] may convey a public key for any
376 public key algorithm. The certificate indicates the algorithm
377 through an algorithm identifier. This algorithm identifier is an OID
378 and optionally associated parameters.
379
380 This section identifies preferred OIDs and parameters for the RSA,
381 DSA, Diffie-Hellman, KEA, ECDSA, and ECDH algorithms. Conforming CAs
382 MUST use the identified OIDs when issuing certificates containing
383
384
385
386
387
388 <span class="grey">Polk, et al. Standards Track [Page 7]</span></pre>
389 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span>
390 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
391
392
393 public keys for these algorithms. Conforming applications supporting
394 any of these algorithms MUST, at a minimum, recognize the OID
395 identified in this section.
396
397 <span class="h4"><a class="selflink" id="section-2.3.1" href="#section-2.3.1">2.3.1</a> RSA Keys</span>
398
399 The OID rsaEncryption identifies RSA public keys.
400
401 pkcs-1 OBJECT IDENTIFIER ::= { iso(1) member-body(2) us(840)
402 rsadsi(113549) pkcs(1) 1 }
403
404 rsaEncryption OBJECT IDENTIFIER ::= { pkcs-1 1}
405
406 The rsaEncryption OID is intended to be used in the algorithm field
407 of a value of type AlgorithmIdentifier. The parameters field MUST
408 have ASN.1 type NULL for this algorithm identifier.
409
410 The RSA public key MUST be encoded using the ASN.1 type RSAPublicKey:
411
412 RSAPublicKey ::= SEQUENCE {
413 modulus INTEGER, -- n
414 publicExponent INTEGER } -- e
415
416 where modulus is the modulus n, and publicExponent is the public
417 exponent e. The DER encoded RSAPublicKey is the value of the BIT
418 STRING subjectPublicKey.
419
420 This OID is used in public key certificates for both RSA signature
421 keys and RSA encryption keys. The intended application for the key
422 MAY be indicated in the key usage field (see [<a href="./rfc3280">RFC 3280</a>]). The use of
423 a single key for both signature and encryption purposes is not
424 recommended, but is not forbidden.
425
426 If the keyUsage extension is present in an end entity certificate
427 which conveys an RSA public key, any combination of the following
428 values MAY be present:
429
430 digitalSignature;
431 nonRepudiation;
432 keyEncipherment; and
433 dataEncipherment.
434
435 If the keyUsage extension is present in a CA or CRL issuer
436 certificate which conveys an RSA public key, any combination of the
437 following values MAY be present:
438
439 digitalSignature;
440 nonRepudiation;
441
442
443
444 <span class="grey">Polk, et al. Standards Track [Page 8]</span></pre>
445 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span>
446 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
447
448
449 keyEncipherment;
450 dataEncipherment;
451 keyCertSign; and
452 cRLSign.
453
454 However, this specification RECOMMENDS that if keyCertSign or cRLSign
455 is present, both keyEncipherment and dataEncipherment SHOULD NOT be
456 present.
457
458 <span class="h4"><a class="selflink" id="section-2.3.2" href="#section-2.3.2">2.3.2</a> DSA Signature Keys</span>
459
460 The Digital Signature Algorithm (DSA) is defined in the Digital
461 Signature Standard (DSS) [FIPS 186]. The DSA OID supported by this
462 profile is:
463
464 id-dsa OBJECT IDENTIFIER ::= {
465 iso(1) member-body(2) us(840) x9-57(10040) x9cm(4) 1 }
466
467 The id-dsa algorithm syntax includes optional domain parameters.
468 These parameters are commonly referred to as p, q, and g. When
469 omitted, the parameters component MUST be omitted entirely. That is,
470 the AlgorithmIdentifier MUST be a SEQUENCE of one component: the
471 OBJECT IDENTIFIER id-dsa.
472
473 If the DSA domain parameters are present in the subjectPublicKeyInfo
474 AlgorithmIdentifier, the parameters are included using the following
475 ASN.1 structure:
476
477 Dss-Parms ::= SEQUENCE {
478 p INTEGER,
479 q INTEGER,
480 g INTEGER }
481
482 The AlgorithmIdentifier within subjectPublicKeyInfo is the only place
483 within a certificate where the parameters may be used. If the DSA
484 algorithm parameters are omitted from the subjectPublicKeyInfo
485 AlgorithmIdentifier and the CA signed the subject certificate using
486 DSA, then the certificate issuer's DSA parameters apply to the
487 subject's DSA key. If the DSA domain parameters are omitted from the
488 SubjectPublicKeyInfo AlgorithmIdentifier and the CA signed the
489 subject certificate using a signature algorithm other than DSA, then
490 the subject's DSA domain parameters are distributed by other means.
491 If the subjectPublicKeyInfo AlgorithmIdentifier field omits the
492 parameters component, the CA signed the subject with a signature
493 algorithm other than DSA, and the subject's DSA parameters are not
494 available through other means, then clients MUST reject the
495 certificate.
496
497
498
499
500 <span class="grey">Polk, et al. Standards Track [Page 9]</span></pre>
501 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span>
502 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
503
504
505 The DSA public key MUST be ASN.1 DER encoded as an INTEGER; this
506 encoding shall be used as the contents (i.e., the value) of the
507 subjectPublicKey component (a BIT STRING) of the SubjectPublicKeyInfo
508 data element.
509
510 DSAPublicKey ::= INTEGER -- public key, Y
511
512 If the keyUsage extension is present in an end entity certificate
513 which conveys a DSA public key, any combination of the following
514 values MAY be present:
515
516 digitalSignature;
517 nonRepudiation;
518
519 If the keyUsage extension is present in a CA or CRL issuer
520 certificate which conveys a DSA public key, any combination of the
521 following values MAY be present:
522
523 digitalSignature;
524 nonRepudiation;
525 keyCertSign; and
526 cRLSign.
527
528 <span class="h4"><a class="selflink" id="section-2.3.3" href="#section-2.3.3">2.3.3</a> Diffie-Hellman Key Exchange Keys</span>
529
530 The Diffie-Hellman OID supported by this profile is defined in
531 [<a href="#ref-X9.42" title="&quot;Public Key Cryptography for The Financial Services Industry: Agreement of Symmetric Keys Using Discrete Logarithm Cryptography&quot;">X9.42</a>].
532
533 dhpublicnumber OBJECT IDENTIFIER ::= { iso(1) member-body(2)
534 us(840) ansi-x942(10046) number-type(2) 1 }
535
536 The dhpublicnumber OID is intended to be used in the algorithm field
537 of a value of type AlgorithmIdentifier. The parameters field of that
538 type, which has the algorithm-specific syntax ANY DEFINED BY
539 algorithm, have the ASN.1 type DomainParameters for this algorithm.
540
541 DomainParameters ::= SEQUENCE {
542 p INTEGER, -- odd prime, p=jq +1
543 g INTEGER, -- generator, g
544 q INTEGER, -- factor of p-1
545 j INTEGER OPTIONAL, -- subgroup factor
546 validationParms ValidationParms OPTIONAL }
547
548 ValidationParms ::= SEQUENCE {
549 seed BIT STRING,
550 pgenCounter INTEGER }
551
552
553
554
555
556 <span class="grey">Polk, et al. Standards Track [Page 10]</span></pre>
557 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span>
558 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
559
560
561 The fields of type DomainParameters have the following meanings:
562
563 p identifies the prime p defining the Galois field;
564
565 g specifies the generator of the multiplicative subgroup of order
566 g;
567
568 q specifies the prime factor of p-1;
569
570 j optionally specifies the value that satisfies the equation
571 p=jq+1 to support the optional verification of group parameters;
572
573 seed optionally specifies the bit string parameter used as the
574 seed for the domain parameter generation process; and
575
576 pgenCounter optionally specifies the integer value output as part
577 of the of the domain parameter prime generation process.
578
579 If either of the domain parameter generation components (pgenCounter
580 or seed) is provided, the other MUST be present as well.
581
582 The Diffie-Hellman public key MUST be ASN.1 encoded as an INTEGER;
583 this encoding shall be used as the contents (i.e., the value) of the
584 subjectPublicKey component (a BIT STRING) of the SubjectPublicKeyInfo
585 data element.
586
587 DHPublicKey ::= INTEGER -- public key, y = g^x mod p
588
589 If the keyUsage extension is present in a certificate which conveys a
590 DH public key, the following values may be present:
591
592 keyAgreement;
593 encipherOnly; and
594 decipherOnly.
595
596 If present, the keyUsage extension MUST assert keyAgreement and MAY
597 assert either encipherOnly and decipherOnly. The keyUsage extension
598 MUST NOT assert both encipherOnly and decipherOnly.
599
600 <span class="h4"><a class="selflink" id="section-2.3.4" href="#section-2.3.4">2.3.4</a> KEA Public Keys</span>
601
602 This section identifies the preferred OID and parameters for the
603 inclusion of a KEA public key in a certificate. The Key Exchange
604 Algorithm (KEA) is a key agreement algorithm. Two parties may
605 generate a "pairwise key" if and only if they share the same KEA
606 parameters. The KEA parameters are not included in a certificate;
607 instead a domain identifier is supplied in the parameters field.
608
609
610
611
612 <span class="grey">Polk, et al. Standards Track [Page 11]</span></pre>
613 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span>
614 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
615
616
617 When the SubjectPublicKeyInfo field contains a KEA key, the algorithm
618 identifier and parameters SHALL be as defined in [<a href="#ref-SDN.701r" title="&quot;Message Security Protocol 4.0&quot;">SDN.701r</a>]:
619
620 id-keyExchangeAlgorithm OBJECT IDENTIFIER ::=
621 { 2 16 840 1 101 2 1 1 22 }
622
623 KEA-Parms-Id ::= OCTET STRING
624
625 CAs MUST populate the parameters field of the AlgorithmIdentifier
626 within the SubjectPublicKeyInfo field of each certificate containing
627 a KEA public key with an 80-bit parameter identifier (OCTET STRING),
628 also known as the domain identifier. The domain identifier is
629 computed in three steps:
630
631 (1) the KEA domain parameters (p, q, and g) are DER encoded using
632 the Dss-Parms structure;
633
634 (2) a 160-bit SHA-1 hash is generated from the parameters; and
635
636 (3) the 160-bit hash is reduced to 80-bits by performing an
637 "exclusive or" of the 80 high order bits with the 80 low order
638 bits.
639
640 The resulting value is encoded such that the most significant byte of
641 the 80-bit value is the first octet in the octet string. The Dss-
642 Parms is provided above in <a href="#section-2.3.2">Section 2.3.2</a>.
643
644 A KEA public key, y, is conveyed in the subjectPublicKey BIT STRING
645 such that the most significant bit (MSB) of y becomes the MSB of the
646 BIT STRING value field and the least significant bit (LSB) of y
647 becomes the LSB of the BIT STRING value field. This results in the
648 following encoding:
649
650 BIT STRING tag;
651 BIT STRING length;
652 0 (indicating that there are zero unused bits in the final octet
653 of y); and
654 BIT STRING value field including y.
655
656 The key usage extension may optionally appear in a KEA certificate.
657 If a KEA certificate includes the keyUsage extension, only the
658 following values may be asserted:
659
660 keyAgreement;
661 encipherOnly; and
662 decipherOnly.
663
664
665
666
667
668 <span class="grey">Polk, et al. Standards Track [Page 12]</span></pre>
669 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span>
670 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
671
672
673 If present, the keyUsage extension MUST assert keyAgreement and MAY
674 assert either encipherOnly and decipherOnly. The keyUsage extension
675 MUST NOT assert both encipherOnly and decipherOnly.
676
677 <span class="h4"><a class="selflink" id="section-2.3.5" href="#section-2.3.5">2.3.5</a> ECDSA and ECDH Keys</span>
678
679 This section identifies the preferred OID and parameter encoding for
680 the inclusion of an ECDSA or ECDH public key in a certificate. The
681 Elliptic Curve Digital Signature Algorithm (ECDSA) is defined in
682 [<a href="#ref-X9.62" title="&quot;Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA)&quot;">X9.62</a>]. ECDSA is the elliptic curve mathematical analog of the
683 Digital Signature Algorithm [FIPS 186]. The Elliptic Curve Diffie
684 Hellman (ECDH) algorithm is a key agreement algorithm defined in
685 [<a href="#ref-X9.63" title="&quot;Public Key Cryptography For The Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography&quot;">X9.63</a>].
686
687 ECDH is the elliptic curve mathematical analog of the Diffie-Hellman
688 key agreement algorithm as specified in [<a href="#ref-X9.42" title="&quot;Public Key Cryptography for The Financial Services Industry: Agreement of Symmetric Keys Using Discrete Logarithm Cryptography&quot;">X9.42</a>]. The ECDSA and ECDH
689 specifications use the same OIDs and parameter encodings. The ASN.1
690 object identifiers used to identify these public keys are defined in
691 the following arc:
692
693 ansi-X9-62 OBJECT IDENTIFIER ::=
694 { iso(1) member-body(2) us(840) 10045 }
695
696 When certificates contain an ECDSA or ECDH public key, the
697 id-ecPublicKey algorithm identifier MUST be used. The id-ecPublicKey
698 algorithm identifier is defined as follows:
699
700 id-public-key-type OBJECT IDENTIFIER ::= { ansi-X9.62 2 }
701
702 id-ecPublicKey OBJECT IDENTIFIER ::= { id-publicKeyType 1 }
703
704 This OID is used in public key certificates for both ECDSA signature
705 keys and ECDH encryption keys. The intended application for the key
706 may be indicated in the key usage field (see [<a href="./rfc3280">RFC 3280</a>]). The use of
707 a single key for both signature and encryption purposes is not
708 recommended, but is not forbidden.
709
710 ECDSA and ECDH require use of certain parameters with the public key.
711 The parameters may be inherited from the issuer, implicitly included
712 through reference to a "named curve," or explicitly included in the
713 certificate.
714
715 EcpkParameters ::= CHOICE {
716 ecParameters ECParameters,
717 namedCurve OBJECT IDENTIFIER,
718 implicitlyCA NULL }
719
720
721
722
723
724 <span class="grey">Polk, et al. Standards Track [Page 13]</span></pre>
725 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span>
726 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
727
728
729 When the parameters are inherited, the parameters field SHALL contain
730 implictlyCA, which is the ASN.1 value NULL. When parameters are
731 specified by reference, the parameters field SHALL contain the
732 named-Curve choice, which is an object identifier. When the
733 parameters are explicitly included, they SHALL be encoded in the
734 ASN.1 structure ECParameters:
735
736 ECParameters ::= SEQUENCE {
737 version ECPVer, -- version is always 1
738 fieldID FieldID, -- identifies the finite field over
739 -- which the curve is defined
740 curve Curve, -- coefficients a and b of the
741 -- elliptic curve
742 base ECPoint, -- specifies the base point P
743 -- on the elliptic curve
744 order INTEGER, -- the order n of the base point
745 cofactor INTEGER OPTIONAL -- The integer h = #E(Fq)/n
746 }
747
748 ECPVer ::= INTEGER {ecpVer1(1)}
749
750 Curve ::= SEQUENCE {
751 a FieldElement,
752 b FieldElement,
753 seed BIT STRING OPTIONAL }
754
755 FieldElement ::= OCTET STRING
756
757 ECPoint ::= OCTET STRING
758
759 The value of FieldElement SHALL be the octet string representation of
760 a field element following the conversion routine in [<a href="#ref-X9.62" title="&quot;Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA)&quot;">X9.62</a>], <a href="#section-4.3.3">Section</a>
761 <a href="#section-4.3.3">4.3.3</a>. The value of ECPoint SHALL be the octet string representation
762 of an elliptic curve point following the conversion routine in
763 [<a href="#ref-X9.62" title="&quot;Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA)&quot;">X9.62</a>], Section 4.3.6. Note that this octet string may represent an
764 elliptic curve point in compressed or uncompressed form.
765
766 Implementations that support elliptic curve according to this
767 specification MUST support the uncompressed form and MAY support the
768 compressed form.
769
770 The components of type ECParameters have the following meanings:
771
772 version specifies the version number of the elliptic curve
773 parameters. It MUST have the value 1 (ecpVer1).
774
775
776
777
778
779
780 <span class="grey">Polk, et al. Standards Track [Page 14]</span></pre>
781 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span>
782 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
783
784
785 fieldID identifies the finite field over which the elliptic curve
786 is defined. Finite fields are represented by values of the
787 parameterized type FieldID, constrained to the values of the
788 objects defined in the information object set FieldTypes.
789 Additional detail regarding fieldID is provided below.
790
791 curve specifies the coefficients a and b of the elliptic curve E.
792 Each coefficient is represented as a value of type FieldElement,
793 an OCTET STRING. seed is an optional parameter used to derive the
794 coefficients of a randomly generated elliptic curve.
795
796 base specifies the base point P on the elliptic curve. The base
797 point is represented as a value of type ECPoint, an OCTET STRING.
798
799 order specifies the order n of the base point.
800
801 cofactor is the integer h = #E(Fq)/n. This parameter is specified
802 as OPTIONAL. However, the cofactor MUST be included in ECDH
803 public key parameters. The cofactor is not required to support
804 ECDSA, except in parameter validation. The cofactor MAY be
805 included to support parameter validation for ECDSA keys.
806 Parameter validation is not required by this specification.
807
808 The AlgorithmIdentifier within SubjectPublicKeyInfo is the only place
809 within a certificate where the parameters may be used. If the
810 elliptic curve parameters are specified as implicitlyCA in the
811 SubjectPublicKeyInfo AlgorithmIdentifier and the CA signed the
812 subject certificate using ECDSA, then the certificate issuer's ECDSA
813 parameters apply to the subject's ECDSA key. If the elliptic curve
814 parameters are specified as implicitlyCA in the SubjectPublicKeyInfo
815 AlgorithmIdentifier and the CA signed the certificate using a
816 signature algorithm other than ECDSA, then clients MUST not make use
817 of the elliptic curve public key.
818
819 FieldID ::= SEQUENCE {
820 fieldType OBJECT IDENTIFIER,
821 parameters ANY DEFINED BY fieldType }
822
823 FieldID is a SEQUENCE of two components, fieldType and parameters.
824 The fieldType contains an object identifier value that uniquely
825 identifies the type contained in the parameters.
826
827 The object identifier id-fieldType specifies an arc containing the
828 object identifiers of each field type. It has the following value:
829
830 id-fieldType OBJECT IDENTIFIER ::= { ansi-X9-62 fieldType(1) }
831
832
833
834
835
836 <span class="grey">Polk, et al. Standards Track [Page 15]</span></pre>
837 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span>
838 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
839
840
841 The object identifiers prime-field and characteristic-two-field name
842 the two kinds of fields defined in this Standard. They have the
843 following values:
844
845 prime-field OBJECT IDENTIFIER ::= { id-fieldType 1 }
846
847 Prime-p ::= INTEGER -- Field size p (p in bits)
848
849 characteristic-two-field OBJECT IDENTIFIER ::= { id-fieldType 2 }
850
851 Characteristic-two ::= SEQUENCE {
852 m INTEGER, -- Field size 2^m
853 basis OBJECT IDENTIFIER,
854 parameters ANY DEFINED BY basis }
855
856 The object identifier id-characteristic-two-basis specifies an arc
857 containing the object identifiers for each type of basis for the
858 characteristic-two finite fields. It has the following value:
859
860 id-characteristic-two-basis OBJECT IDENTIFIER ::= {
861 characteristic-two-field basisType(1) }
862
863 The object identifiers gnBasis, tpBasis and ppBasis name the three
864 kinds of basis for characteristic-two finite fields defined by
865 [<a href="#ref-X9.62" title="&quot;Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA)&quot;">X9.62</a>]. They have the following values:
866
867 gnBasis OBJECT IDENTIFIER ::= { id-characteristic-two-basis 1 }
868
869 -- for gnBasis, the value of the parameters field is NULL
870
871 tpBasis OBJECT IDENTIFIER ::= { id-characteristic-two-basis 2 }
872
873 -- type of parameters field for tpBasis is Trinomial
874
875 Trinomial ::= INTEGER
876
877 ppBasis OBJECT IDENTIFIER ::= { id-characteristic-two-basis 3 }
878
879 -- type of parameters field for ppBasis is Pentanomial
880
881 Pentanomial ::= SEQUENCE {
882 k1 INTEGER,
883 k2 INTEGER,
884 k3 INTEGER }
885
886
887
888
889
890
891
892 <span class="grey">Polk, et al. Standards Track [Page 16]</span></pre>
893 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span>
894 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
895
896
897 The elliptic curve public key (an ECPoint which is an OCTET STRING)
898 is mapped to a subjectPublicKey (a BIT STRING) as follows: the most
899 significant bit of the OCTET STRING becomes the most significant bit
900 of the BIT STRING, and the least significant bit of the OCTET STRING
901 becomes the least significant bit of the BIT STRING. Note that this
902 octet string may represent an elliptic curve point in compressed or
903 uncompressed form. Implementations that support elliptic curve
904 according to this specification MUST support the uncompressed form
905 and MAY support the compressed form.
906
907 If the keyUsage extension is present in a CA or CRL issuer
908 certificate which conveys an elliptic curve public key, any
909 combination of the following values MAY be present:
910
911 digitalSignature;
912 nonRepudiation; and
913 keyAgreement.
914
915 If the keyAgreement value is present, either of the following values
916 MAY be present:
917
918 encipherOnly; and
919 decipherOnly.
920
921 The keyUsage extension MUST NOT assert both encipherOnly and
922 decipherOnly.
923
924 If the keyUsage extension is present in a CA certificate which
925 conveys an elliptic curve public key, any combination of the
926 following values MAY be present:
927
928 digitalSignature;
929 nonRepudiation;
930 keyAgreement;
931 keyCertSign; and
932 cRLSign.
933
934 As above, if the keyUsage extension asserts keyAgreement then it MAY
935 assert either encipherOnly and decipherOnly. However, this
936 specification RECOMMENDS that if keyCertSign or cRLSign is present,
937 keyAgreement, encipherOnly, and decipherOnly SHOULD NOT be present.
938
939
940
941
942
943
944
945
946
947
948 <span class="grey">Polk, et al. Standards Track [Page 17]</span></pre>
949 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span>
950 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
951
952
953 <span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a> ASN.1 Module</span>
954
955 PKIX1Algorithms88 { iso(1) identified-organization(3) dod(6)
956 internet(1) security(5) mechanisms(5) pkix(7) id-mod(0)
957 id-mod-pkix1-algorithms(17) }
958
959 DEFINITIONS EXPLICIT TAGS ::= BEGIN
960
961 -- EXPORTS All;
962
963 -- IMPORTS NONE;
964
965 --
966 -- One-way Hash Functions
967 --
968
969 md2 OBJECT IDENTIFIER ::= {
970 iso(1) member-body(2) us(840) rsadsi(113549)
971 digestAlgorithm(2) 2 }
972
973 md5 OBJECT IDENTIFIER ::= {
974 iso(1) member-body(2) us(840) rsadsi(113549)
975 digestAlgorithm(2) 5 }
976
977 id-sha1 OBJECT IDENTIFIER ::= {
978 iso(1) identified-organization(3) oiw(14) secsig(3)
979 algorithms(2) 26 }
980
981 --
982 -- DSA Keys and Signatures
983 --
984
985 -- OID for DSA public key
986
987 id-dsa OBJECT IDENTIFIER ::= {
988 iso(1) member-body(2) us(840) x9-57(10040) x9algorithm(4) 1 }
989
990 -- encoding for DSA public key
991
992 DSAPublicKey ::= INTEGER -- public key, y
993
994 Dss-Parms ::= SEQUENCE {
995 p INTEGER,
996 q INTEGER,
997 g INTEGER }
998
999
1000
1001
1002
1003
1004 <span class="grey">Polk, et al. Standards Track [Page 18]</span></pre>
1005 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span>
1006 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
1007
1008
1009 -- OID for DSA signature generated with SHA-1 hash
1010
1011 id-dsa-with-sha1 OBJECT IDENTIFIER ::= {
1012 iso(1) member-body(2) us(840) x9-57 (10040) x9algorithm(4) 3 }
1013
1014 -- encoding for DSA signature generated with SHA-1 hash
1015
1016 Dss-Sig-Value ::= SEQUENCE {
1017 r INTEGER,
1018 s INTEGER }
1019
1020 --
1021 -- RSA Keys and Signatures
1022 --
1023
1024 -- arc for RSA public key and RSA signature OIDs
1025
1026 pkcs-1 OBJECT IDENTIFIER ::= {
1027 iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1) 1 }
1028
1029 -- OID for RSA public keys
1030
1031 rsaEncryption OBJECT IDENTIFIER ::= { pkcs-1 1 }
1032
1033 -- OID for RSA signature generated with MD2 hash
1034
1035 md2WithRSAEncryption OBJECT IDENTIFIER ::= { pkcs-1 2 }
1036
1037 -- OID for RSA signature generated with MD5 hash
1038
1039 md5WithRSAEncryption OBJECT IDENTIFIER ::= { pkcs-1 4 }
1040
1041 -- OID for RSA signature generated with SHA-1 hash
1042
1043 sha1WithRSAEncryption OBJECT IDENTIFIER ::= { pkcs-1 5 }
1044
1045 -- encoding for RSA public key
1046
1047 RSAPublicKey ::= SEQUENCE {
1048 modulus INTEGER, -- n
1049 publicExponent INTEGER } -- e
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060 <span class="grey">Polk, et al. Standards Track [Page 19]</span></pre>
1061 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span>
1062 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
1063
1064
1065 --
1066 -- Diffie-Hellman Keys
1067 --
1068
1069 dhpublicnumber OBJECT IDENTIFIER ::= {
1070 iso(1) member-body(2) us(840) ansi-x942(10046)
1071 number-type(2) 1 }
1072
1073 -- encoding for DSA public key
1074
1075 DHPublicKey ::= INTEGER -- public key, y = g^x mod p
1076
1077 DomainParameters ::= SEQUENCE {
1078 p INTEGER, -- odd prime, p=jq +1
1079 g INTEGER, -- generator, g
1080 q INTEGER, -- factor of p-1
1081 j INTEGER OPTIONAL, -- subgroup factor, j&gt;= 2
1082 validationParms ValidationParms OPTIONAL }
1083
1084 ValidationParms ::= SEQUENCE {
1085 seed BIT STRING,
1086 pgenCounter INTEGER }
1087
1088 --
1089 -- KEA Keys
1090 --
1091
1092 id-keyExchangeAlgorithm OBJECT IDENTIFIER ::=
1093 { 2 16 840 1 101 2 1 1 22 }
1094
1095 KEA-Parms-Id ::= OCTET STRING
1096
1097 --
1098 -- Elliptic Curve Keys, Signatures, and Curves
1099 --
1100
1101 ansi-X9-62 OBJECT IDENTIFIER ::= {
1102 iso(1) member-body(2) us(840) 10045 }
1103
1104 FieldID ::= SEQUENCE { -- Finite field
1105 fieldType OBJECT IDENTIFIER,
1106 parameters ANY DEFINED BY fieldType }
1107
1108 -- Arc for ECDSA signature OIDS
1109
1110 id-ecSigType OBJECT IDENTIFIER ::= { ansi-X9-62 signatures(4) }
1111
1112
1113
1114
1115
1116 <span class="grey">Polk, et al. Standards Track [Page 20]</span></pre>
1117 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span>
1118 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
1119
1120
1121 -- OID for ECDSA signatures with SHA-1
1122
1123 ecdsa-with-SHA1 OBJECT IDENTIFIER ::= { id-ecSigType 1 }
1124
1125 -- OID for an elliptic curve signature
1126 -- format for the value of an ECDSA signature value
1127
1128 ECDSA-Sig-Value ::= SEQUENCE {
1129 r INTEGER,
1130 s INTEGER }
1131
1132 -- recognized field type OIDs are defined in the following arc
1133
1134 id-fieldType OBJECT IDENTIFIER ::= { ansi-X9-62 fieldType(1) }
1135
1136 -- where fieldType is prime-field, the parameters are of type Prime-p
1137
1138 prime-field OBJECT IDENTIFIER ::= { id-fieldType 1 }
1139
1140 Prime-p ::= INTEGER -- Finite field F(p), where p is an odd prime
1141
1142 -- where fieldType is characteristic-two-field, the parameters are
1143 -- of type Characteristic-two
1144
1145 characteristic-two-field OBJECT IDENTIFIER ::= { id-fieldType 2 }
1146
1147 Characteristic-two ::= SEQUENCE {
1148 m INTEGER, -- Field size 2^m
1149 basis OBJECT IDENTIFIER,
1150 parameters ANY DEFINED BY basis }
1151
1152 -- recognized basis type OIDs are defined in the following arc
1153
1154 id-characteristic-two-basis OBJECT IDENTIFIER ::= {
1155 characteristic-two-field basisType(3) }
1156
1157 -- gnbasis is identified by OID gnBasis and indicates
1158 -- parameters are NULL
1159
1160 gnBasis OBJECT IDENTIFIER ::= { id-characteristic-two-basis 1 }
1161
1162 -- parameters for this basis are NULL
1163
1164 -- trinomial basis is identified by OID tpBasis and indicates
1165 -- parameters of type Pentanomial
1166
1167 tpBasis OBJECT IDENTIFIER ::= { id-characteristic-two-basis 2 }
1168
1169
1170
1171
1172 <span class="grey">Polk, et al. Standards Track [Page 21]</span></pre>
1173 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-22" ></span>
1174 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
1175
1176
1177 -- Trinomial basis representation of F2^m
1178 -- Integer k for reduction polynomial xm + xk + 1
1179
1180 Trinomial ::= INTEGER
1181
1182 -- for pentanomial basis is identified by OID ppBasis and indicates
1183 -- parameters of type Pentanomial
1184
1185 ppBasis OBJECT IDENTIFIER ::= { id-characteristic-two-basis 3 }
1186
1187 -- Pentanomial basis representation of F2^m
1188 -- reduction polynomial integers k1, k2, k3
1189 -- f(x) = x**m + x**k3 + x**k2 + x**k1 + 1
1190
1191 Pentanomial ::= SEQUENCE {
1192 k1 INTEGER,
1193 k2 INTEGER,
1194 k3 INTEGER }
1195
1196 -- The object identifiers gnBasis, tpBasis and ppBasis name
1197 -- three kinds of basis for characteristic-two finite fields
1198
1199 FieldElement ::= OCTET STRING -- Finite field element
1200
1201 ECPoint ::= OCTET STRING -- Elliptic curve point
1202
1203 -- Elliptic Curve parameters may be specified explicitly,
1204 -- specified implicitly through a "named curve", or
1205 -- inherited from the CA
1206
1207 EcpkParameters ::= CHOICE {
1208 ecParameters ECParameters,
1209 namedCurve OBJECT IDENTIFIER,
1210 implicitlyCA NULL }
1211
1212 ECParameters ::= SEQUENCE { -- Elliptic curve parameters
1213 version ECPVer,
1214 fieldID FieldID,
1215 curve Curve,
1216 base ECPoint, -- Base point G
1217 order INTEGER, -- Order n of the base point
1218 cofactor INTEGER OPTIONAL } -- The integer h = #E(Fq)/n
1219
1220 ECPVer ::= INTEGER {ecpVer1(1)}
1221
1222
1223
1224
1225
1226
1227
1228 <span class="grey">Polk, et al. Standards Track [Page 22]</span></pre>
1229 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-23" ></span>
1230 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
1231
1232
1233 Curve ::= SEQUENCE {
1234 a FieldElement, -- Elliptic curve coefficient a
1235 b FieldElement, -- Elliptic curve coefficient b
1236 seed BIT STRING OPTIONAL }
1237
1238 id-publicKeyType OBJECT IDENTIFIER ::= { ansi-X9-62 keyType(2) }
1239
1240 id-ecPublicKey OBJECT IDENTIFIER ::= { id-publicKeyType 1 }
1241
1242 -- Named Elliptic Curves in ANSI X9.62.
1243
1244 ellipticCurve OBJECT IDENTIFIER ::= { ansi-X9-62 curves(3) }
1245
1246 c-TwoCurve OBJECT IDENTIFIER ::= {
1247 ellipticCurve characteristicTwo(0) }
1248
1249 c2pnb163v1 OBJECT IDENTIFIER ::= { c-TwoCurve 1 }
1250 c2pnb163v2 OBJECT IDENTIFIER ::= { c-TwoCurve 2 }
1251 c2pnb163v3 OBJECT IDENTIFIER ::= { c-TwoCurve 3 }
1252 c2pnb176w1 OBJECT IDENTIFIER ::= { c-TwoCurve 4 }
1253 c2tnb191v1 OBJECT IDENTIFIER ::= { c-TwoCurve 5 }
1254 c2tnb191v2 OBJECT IDENTIFIER ::= { c-TwoCurve 6 }
1255 c2tnb191v3 OBJECT IDENTIFIER ::= { c-TwoCurve 7 }
1256 c2onb191v4 OBJECT IDENTIFIER ::= { c-TwoCurve 8 }
1257 c2onb191v5 OBJECT IDENTIFIER ::= { c-TwoCurve 9 }
1258 c2pnb208w1 OBJECT IDENTIFIER ::= { c-TwoCurve 10 }
1259 c2tnb239v1 OBJECT IDENTIFIER ::= { c-TwoCurve 11 }
1260 c2tnb239v2 OBJECT IDENTIFIER ::= { c-TwoCurve 12 }
1261 c2tnb239v3 OBJECT IDENTIFIER ::= { c-TwoCurve 13 }
1262 c2onb239v4 OBJECT IDENTIFIER ::= { c-TwoCurve 14 }
1263 c2onb239v5 OBJECT IDENTIFIER ::= { c-TwoCurve 15 }
1264 c2pnb272w1 OBJECT IDENTIFIER ::= { c-TwoCurve 16 }
1265 c2pnb304w1 OBJECT IDENTIFIER ::= { c-TwoCurve 17 }
1266 c2tnb359v1 OBJECT IDENTIFIER ::= { c-TwoCurve 18 }
1267 c2pnb368w1 OBJECT IDENTIFIER ::= { c-TwoCurve 19 }
1268 c2tnb431r1 OBJECT IDENTIFIER ::= { c-TwoCurve 20 }
1269
1270 primeCurve OBJECT IDENTIFIER ::= { ellipticCurve prime(1) }
1271
1272 prime192v1 OBJECT IDENTIFIER ::= { primeCurve 1 }
1273 prime192v2 OBJECT IDENTIFIER ::= { primeCurve 2 }
1274 prime192v3 OBJECT IDENTIFIER ::= { primeCurve 3 }
1275 prime239v1 OBJECT IDENTIFIER ::= { primeCurve 4 }
1276 prime239v2 OBJECT IDENTIFIER ::= { primeCurve 5 }
1277 prime239v3 OBJECT IDENTIFIER ::= { primeCurve 6 }
1278 prime256v1 OBJECT IDENTIFIER ::= { primeCurve 7 }
1279
1280 END
1281
1282
1283
1284 <span class="grey">Polk, et al. Standards Track [Page 23]</span></pre>
1285 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-24" ></span>
1286 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
1287
1288
1289 <span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a> References</span>
1290
1291 [FIPS 180-1] Federal Information Processing Standards Publication
1292 (FIPS PUB) 180-1, Secure Hash Standard, 17 April 1995.
1293 [Supersedes FIPS PUB 180 dated 11 May 1993.]
1294
1295 [FIPS 186-2] Federal Information Processing Standards Publication
1296 (FIPS PUB) 186, Digital Signature Standard, 27 January
1297 2000. [Supersedes FIPS PUB 186-1 dated 15 December
1298 1998.]
1299
1300 [<a id="ref-P1363">P1363</a>] IEEE P1363, "Standard Specifications for Public-Key
1301 Cryptography", 2001.
1302
1303 [<a id="ref-RC95">RC95</a>] Rogier, N. and Chauvaud, P., "The compression function
1304 of MD2 is not collision free," Presented at Selected
1305 Areas in Cryptography '95, May 1995.
1306
1307 [<a id="ref-RFC 1034">RFC 1034</a>] Mockapetris, P., "Domain Names - Concepts and
1308 Facilities", STD 13, <a href="./rfc1034">RFC 1034</a>, November 1987.
1309
1310 [<a id="ref-RFC 1319">RFC 1319</a>] Kaliski, B., "The MD2 Message-Digest Algorithm", <a href="./rfc1319">RFC</a>
1311 <a href="./rfc1319">1319</a>, April 1992.
1312
1313 [<a id="ref-RFC 1321">RFC 1321</a>] Rivest, R., "The MD5 Message-Digest Algorithm", <a href="./rfc1321">RFC</a>
1314 <a href="./rfc1321">1321</a>, April 1992.
1315
1316 [<a id="ref-RFC 1422">RFC 1422</a>] Kent, S., "Privacy Enhancement for Internet Electronic
1317 Mail: Part II: Certificate-Based Key Management", <a href="./rfc1422">RFC</a>
1318 <a href="./rfc1422">1422</a>, February 1993.
1319
1320 [<a id="ref-RFC 1423">RFC 1423</a>] Balenson, D., "Privacy Enhancement for Internet
1321 Electronic Mail: Part III: Algorithms, Modes, and
1322 Identifiers", <a href="./rfc1423">RFC 1423</a>, February 1993.
1323
1324 [<a id="ref-RFC 2119">RFC 2119</a>] Bradner, S., "Key Words for Use in RFCs to Indicate
1325 Requirement Levels", <a href="https://www.rfc-editor.org/bcp/bcp14">BCP 14</a>, <a href="./rfc2119">RFC 2119</a>, March 1997.
1326
1327 [<a id="ref-RFC 2313">RFC 2313</a>] Kaliski, B., "PKCS #1: RSA Encryption Version 1.5",
1328 <a href="./rfc2313">RFC 2313</a>, March 1998.
1329
1330 [<a id="ref-RFC 2459">RFC 2459</a>] Housley, R., Ford, W., Polk, W. and D. Solo "Internet
1331 X.509 Public Key Infrastructure: Certificate and CRL
1332 Profile", <a href="./rfc2459">RFC 2459</a>, January, 1999.
1333
1334 [<a id="ref-RFC 3174">RFC 3174</a>] Eastlake, D. and P. Jones, "US Secure Hash Algorithm 1
1335 (SHA1)", <a href="./rfc3174">RFC 3174</a>, September 2001.
1336
1337
1338
1339
1340 <span class="grey">Polk, et al. Standards Track [Page 24]</span></pre>
1341 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-25" ></span>
1342 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
1343
1344
1345 [<a id="ref-RFC 3280">RFC 3280</a>] Housley, R., Polk, W., Ford, W. and D. Solo, "Internet
1346 X.509 Public Key Infrastructure Certificate and
1347 Certificate Revocation List (CRL) Profile", <a href="./rfc3280">RFC 3280</a>,
1348 April 2002.
1349
1350 [<a id="ref-SDN.701r">SDN.701r</a>] SDN.701, "Message Security Protocol 4.0", Revision A
1351 1997-02-06.
1352
1353 [<a id="ref-X.208">X.208</a>] CCITT Recommendation X.208: Specification of Abstract
1354 Syntax Notation One (ASN.1), 1988.
1355
1356 [<a id="ref-X.660">X.660</a>] ITU-T Recommendation X.660 Information Technology -
1357 ASN.1 encoding rules: Specification of Basic Encoding
1358 Rules (BER), Canonical Encoding Rules (CER) and
1359 Distinguished Encoding Rules (DER), 1997.
1360
1361 [<a id="ref-X9.42">X9.42</a>] ANSI X9.42-2000, "Public Key Cryptography for The
1362 Financial Services Industry: Agreement of Symmetric
1363 Keys Using Discrete Logarithm Cryptography", December,
1364 1999.
1365
1366 [<a id="ref-X9.62">X9.62</a>] X9.62-1998, "Public Key Cryptography For The Financial
1367 Services Industry: The Elliptic Curve Digital
1368 Signature Algorithm (ECDSA)", January 7, 1999.
1369
1370 [<a id="ref-X9.63">X9.63</a>] ANSI X9.63-2001, "Public Key Cryptography For The
1371 Financial Services Industry: Key Agreement and Key
1372 Transport Using Elliptic Curve Cryptography", Work in
1373 Progress.
1374
1375 <span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a> Security Considerations</span>
1376
1377 This specification does not constrain the size of public keys or
1378 their parameters for use in the Internet PKI. However, the key size
1379 selected impacts the strength achieved when implementing
1380 cryptographic services. Selection of appropriate key sizes is
1381 critical to implementing appropriate security.
1382
1383 This specification does not identify particular elliptic curves for
1384 use in the Internet PKI. However, the particular curve selected
1385 impact the strength of the digital signatures. Some curves are
1386 cryptographically stronger than others!
1387
1388 In general, use of "well-known" curves, such as the "named curves"
1389 from ANSI X9.62, is a sound strategy. For additional information,
1390 refer to X9.62 <a href="#appendix-H.1.3">Appendix H.1.3</a>, "Key Length Considerations" and
1391 <a href="#appendix-A.1">Appendix A.1</a>, "Avoiding Cryptographically Weak Keys".
1392
1393
1394
1395
1396 <span class="grey">Polk, et al. Standards Track [Page 25]</span></pre>
1397 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-26" ></span>
1398 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
1399
1400
1401 This specification supplements <a href="./rfc3280">RFC 3280</a>. The security considerations
1402 section of that document applies to this specification as well.
1403
1404 <span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a> Intellectual Property Rights</span>
1405
1406 The IETF has been notified of intellectual property rights claimed in
1407 regard to some or all of the specification contained in this
1408 document. For more information consult the online list of claimed
1409 rights.
1410
1411 The IETF takes no position regarding the validity or scope of any
1412 intellectual property or other rights that might be claimed to
1413 pertain to the implementation or use of the technology described in
1414 this document or the extent to which any license under such rights
1415 might or might not be available; neither does it represent that it
1416 has made any effort to identify any such rights. Information on the
1417 IETF's procedures with respect to rights in standards-track and
1418 standards- related documentation can be found in <a href="https://www.rfc-editor.org/bcp/bcp11">BCP-11</a>. Copies of
1419 claims of rights made available for publication and any assurances of
1420 licenses to be made available, or the result of an attempt made to
1421 obtain a general license or permission for the use of such
1422 proprietary rights by implementors or users of this specification can
1423 be obtained from the IETF Secretariat.
1424
1425 <span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a> Author Addresses:</span>
1426
1427 Tim Polk
1428 NIST
1429 100 Bureau Drive, Stop 8930
1430 Gaithersburg, MD 20899-8930
1431 USA
1432 EMail: [email protected]
1433
1434 Russell Housley
1435 RSA Laboratories
1436 918 Spring Knoll Drive
1437 Herndon, VA 20170
1438 USA
1439 EMail: [email protected]
1440
1441 Larry Bassham
1442 NIST
1443 100 Bureau Drive, Stop 8930
1444 Gaithersburg, MD 20899-8930
1445 USA
1446 EMail: [email protected]
1447
1448
1449
1450
1451
1452 <span class="grey">Polk, et al. Standards Track [Page 26]</span></pre>
1453 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-27" ></span>
1454 <span class="grey"><a href="./rfc3279">RFC 3279</a> Algorithms and Identifiers April 2002</span>
1455
1456
1457 <span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. Full Copyright Statement</span>
1458
1459 Copyright (C) The Internet Society (2002). All Rights Reserved.
1460
1461 This document and translations of it may be copied and furnished to
1462 others, and derivative works that comment on or otherwise explain it
1463 or assist in its implementation may be prepared, copied, published
1464 and distributed, in whole or in part, without restriction of any
1465 kind, provided that the above copyright notice and this paragraph are
1466 included on all such copies and derivative works. However, this
1467 document itself may not be modified in any way, such as by removing
1468 the copyright notice or references to the Internet Society or other
1469 Internet organizations, except as needed for the purpose of
1470 developing Internet standards in which case the procedures for
1471 copyrights defined in the Internet Standards process must be
1472 followed, or as required to translate it into languages other than
1473 English.
1474
1475 The limited permissions granted above are perpetual and will not be
1476 revoked by the Internet Society or its successors or assigns.
1477
1478 This document and the information contained herein is provided on an
1479 "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING
1480 TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING
1481 BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION
1482 HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF
1483 MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
1484
1485 Acknowledgement
1486
1487 Funding for the RFC Editor function is currently provided by the
1488 Internet Society.
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508 Polk, et al. Standards Track [Page 27]
1509 </pre>