1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
|
<pre>Network Working Group D. EastLake
Request for Comments: 2536 IBM
Category: Standards Track March 1999
<span class="h1">DSA KEYs and SIGs in the Domain Name System (DNS)</span>
Status of this Memo
This document specifies an Internet standards track protocol for the
Internet community, and requests discussion and suggestions for
improvements. Please refer to the current edition of the "Internet
Official Protocol Standards" (STD 1) for the standardization state
and status of this protocol. Distribution of this memo is unlimited.
Copyright Notice
Copyright (C) The Internet Society (1999). All Rights Reserved.
Abstract
A standard method for storing US Government Digital Signature
Algorithm keys and signatures in the Domain Name System is described
which utilizes DNS KEY and SIG resource records.
Table of Contents
Abstract...................................................<a href="#page-1">1</a>
<a href="#section-1">1</a>. Introduction............................................<a href="#page-1">1</a>
<a href="#section-2">2</a>. DSA KEY Resource Records................................<a href="#page-2">2</a>
<a href="#section-3">3</a>. DSA SIG Resource Records................................<a href="#page-3">3</a>
<a href="#section-4">4</a>. Performance Considerations..............................<a href="#page-3">3</a>
<a href="#section-5">5</a>. Security Considerations.................................<a href="#page-4">4</a>
<a href="#section-6">6</a>. IANA Considerations.....................................<a href="#page-4">4</a>
References.................................................<a href="#page-5">5</a>
Author's Address...........................................<a href="#page-5">5</a>
Full Copyright Statement...................................<a href="#page-6">6</a>
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span>
The Domain Name System (DNS) is the global hierarchical replicated
distributed database system for Internet addressing, mail proxy, and
other information. The DNS has been extended to include digital
signatures and cryptographic keys as described in [<a href="./rfc2535">RFC 2535</a>]. Thus
the DNS can now be secured and can be used for secure key
distribution.
<span class="grey">Eastlake Standards Track [Page 1]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
<span class="grey"><a href="./rfc2536">RFC 2536</a> DSA in the DNS March 1999</span>
This document describes how to store US Government Digital Signature
Algorithm (DSA) keys and signatures in the DNS. Familiarity with the
US Digital Signature Algorithm is assumed [<a href="#ref-Schneier" title=""Applied Cryptography Second Edition: protocols, algorithms, and source code in C"">Schneier</a>]. Implementation
of DSA is mandatory for DNS security.
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. DSA KEY Resource Records</span>
DSA public keys are stored in the DNS as KEY RRs using algorithm
number 3 [<a href="./rfc2535">RFC 2535</a>]. The structure of the algorithm specific portion
of the RDATA part of this RR is as shown below. These fields, from Q
through Y are the "public key" part of the DSA KEY RR.
The period of key validity is not in the KEY RR but is indicated by
the SIG RR(s) which signs and authenticates the KEY RR(s) at that
domain name.
Field Size
----- ----
T 1 octet
Q 20 octets
P 64 + T*8 octets
G 64 + T*8 octets
Y 64 + T*8 octets
As described in [FIPS 186] and [<a href="#ref-Schneier" title=""Applied Cryptography Second Edition: protocols, algorithms, and source code in C"">Schneier</a>]: T is a key size parameter
chosen such that 0 <= T <= 8. (The meaning for algorithm 3 if the T
octet is greater than 8 is reserved and the remainder of the RDATA
portion may have a different format in that case.) Q is a prime
number selected at key generation time such that 2**159 < Q < 2**160
so Q is always 20 octets long and, as with all other fields, is
stored in "big-endian" network order. P, G, and Y are calculated as
directed by the FIPS 186 key generation algorithm [<a href="#ref-Schneier" title=""Applied Cryptography Second Edition: protocols, algorithms, and source code in C"">Schneier</a>]. P is
in the range 2**(511+64T) < P < 2**(512+64T) and so is 64 + 8*T
octets long. G and Y are quantities modulus P and so can be up to
the same length as P and are allocated fixed size fields with the
same number of octets as P.
During the key generation process, a random number X must be
generated such that 1 <= X <= Q-1. X is the private key and is used
in the final step of public key generation where Y is computed as
Y = G**X mod P
<span class="grey">Eastlake Standards Track [Page 2]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
<span class="grey"><a href="./rfc2536">RFC 2536</a> DSA in the DNS March 1999</span>
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. DSA SIG Resource Records</span>
The signature portion of the SIG RR RDATA area, when using the US
Digital Signature Algorithm, is shown below with fields in the order
they occur. See [<a href="./rfc2535">RFC 2535</a>] for fields in the SIG RR RDATA which
precede the signature itself.
Field Size
----- ----
T 1 octet
R 20 octets
S 20 octets
The data signed is determined as specified in [<a href="./rfc2535">RFC 2535</a>]. Then the
following steps are taken, as specified in [FIPS 186], where Q, P, G,
and Y are as specified in the public key [<a href="#ref-Schneier" title=""Applied Cryptography Second Edition: protocols, algorithms, and source code in C"">Schneier</a>]:
hash = SHA-1 ( data )
Generate a random K such that 0 < K < Q.
R = ( G**K mod P ) mod Q
S = ( K**(-1) * (hash + X*R) ) mod Q
Since Q is 160 bits long, R and S can not be larger than 20 octets,
which is the space allocated.
T is copied from the public key. It is not logically necessary in
the SIG but is present so that values of T > 8 can more conveniently
be used as an escape for extended versions of DSA or other algorithms
as later specified.
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Performance Considerations</span>
General signature generation speeds are roughly the same for RSA [RFC
2537] and DSA. With sufficient pre-computation, signature generation
with DSA is faster than RSA. Key generation is also faster for DSA.
However, signature verification is an order of magnitude slower than
RSA when the RSA public exponent is chosen to be small as is
recommended for KEY RRs used in domain name system (DNS) data
authentication.
Current DNS implementations are optimized for small transfers,
typically less than 512 bytes including overhead. While larger
transfers will perform correctly and work is underway to make larger
transfers more efficient, it is still advisable at this time to make
reasonable efforts to minimize the size of KEY RR sets stored within
<span class="grey">Eastlake Standards Track [Page 3]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
<span class="grey"><a href="./rfc2536">RFC 2536</a> DSA in the DNS March 1999</span>
the DNS consistent with adequate security. Keep in mind that in a
secure zone, at least one authenticating SIG RR will also be
returned.
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Security Considerations</span>
Many of the general security consideration in [<a href="./rfc2535">RFC 2535</a>] apply. Keys
retrieved from the DNS should not be trusted unless (1) they have
been securely obtained from a secure resolver or independently
verified by the user and (2) this secure resolver and secure
obtainment or independent verification conform to security policies
acceptable to the user. As with all cryptographic algorithms,
evaluating the necessary strength of the key is essential and
dependent on local policy.
The key size limitation of a maximum of 1024 bits ( T = 8 ) in the
current DSA standard may limit the security of DSA. For particularly
critical applications, implementors are encouraged to consider the
range of available algorithms and key sizes.
DSA assumes the ability to frequently generate high quality random
numbers. See [<a href="./rfc1750">RFC 1750</a>] for guidance. DSA is designed so that if
manipulated rather than random numbers are used, very high bandwidth
covert channels are possible. See [<a href="#ref-Schneier" title=""Applied Cryptography Second Edition: protocols, algorithms, and source code in C"">Schneier</a>] and more recent
research. The leakage of an entire DSA private key in only two DSA
signatures has been demonstrated. DSA provides security only if
trusted implementations, including trusted random number generation,
are used.
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. IANA Considerations</span>
Allocation of meaning to values of the T parameter that are not
defined herein requires an IETF standards actions. It is intended
that values unallocated herein be used to cover future extensions of
the DSS standard.
<span class="grey">Eastlake Standards Track [Page 4]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
<span class="grey"><a href="./rfc2536">RFC 2536</a> DSA in the DNS March 1999</span>
References
[FIPS 186] U.S. Federal Information Processing Standard: Digital
Signature Standard.
[<a id="ref-RFC 1034">RFC 1034</a>] Mockapetris, P., "Domain Names - Concepts and
Facilities", STD 13, <a href="./rfc1034">RFC 1034</a>, November 1987.
[<a id="ref-RFC 1035">RFC 1035</a>] Mockapetris, P., "Domain Names - Implementation and
Specification", STD 13, <a href="./rfc1035">RFC 1035</a>, November 1987.
[<a id="ref-RFC 1750">RFC 1750</a>] Eastlake, D., Crocker, S. and J. Schiller, "Randomness
Recommendations for Security", <a href="./rfc1750">RFC 1750</a>, December 1994.
[<a id="ref-RFC 2535">RFC 2535</a>] Eastlake, D., "Domain Name System Security Extensions",
<a href="./rfc2535">RFC 2535</a>, March 1999.
[<a id="ref-RFC 2537">RFC 2537</a>] Eastlake, D., "RSA/MD5 KEYs and SIGs in the Domain Name
System (DNS)", <a href="./rfc2537">RFC 2537</a>, March 1999.
[<a id="ref-Schneier">Schneier</a>] Schneier, B., "Applied Cryptography Second Edition:
protocols, algorithms, and source code in C", 1996.
Author's Address
Donald E. Eastlake 3rd
IBM
65 Shindegan Hill Road, RR #1
Carmel, NY 10512
Phone: +1-914-276-2668(h)
+1-914-784-7913(w)
Fax: +1-914-784-3833(w)
EMail: dee3@us.ibm.com
<span class="grey">Eastlake Standards Track [Page 5]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
<span class="grey"><a href="./rfc2536">RFC 2536</a> DSA in the DNS March 1999</span>
Full Copyright Statement
Copyright (C) The Internet Society (1999). All Rights Reserved.
This document and translations of it may be copied and furnished to
others, and derivative works that comment on or otherwise explain it
or assist in its implementation may be prepared, copied, published
and distributed, in whole or in part, without restriction of any
kind, provided that the above copyright notice and this paragraph are
included on all such copies and derivative works. However, this
document itself may not be modified in any way, such as by removing
the copyright notice or references to the Internet Society or other
Internet organizations, except as needed for the purpose of
developing Internet standards in which case the procedures for
copyrights defined in the Internet Standards process must be
followed, or as required to translate it into languages other than
English.
The limited permissions granted above are perpetual and will not be
revoked by the Internet Society or its successors or assigns.
This document and the information contained herein is provided on an
"AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING
TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING
BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION
HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
Eastlake Standards Track [Page 6]
</pre>
|
