draft-ietf-dnsext-ecc-key-06.txt   draft-ietf-dnsext-ecc-key-07.txt 
INTERNET-DRAFT ECC Keys in the DNS INTERNET-DRAFT ECC Keys in the DNS
Expires: June 2005 December 2004 Expires: January 2006 July 2005
Elliptic Curve KEYs in the DNS Elliptic Curve KEYs in the DNS
-------- ----- ---- -- --- --- -------- ----- ---- -- --- ---
<draft-ietf-dnsext-ecc-key-06.txt> <draft-ietf-dnsext-ecc-key-07.txt>
Richard C. Schroeppel Richard C. Schroeppel
Donald Eastlake 3rd Donald Eastlake 3rd
Status of This Document Status of This Document
By submitting this Internet-Draft, I certify that any applicable By submitting this Internet-Draft, each author represents that any
patent or other IPR claims of which I am aware have been disclosed, applicable patent or other IPR claims of which he or she is aware
or will be disclosed, and any of which I become aware will be have been or will be disclosed, and any of which he or she becomes
disclosed, in accordance with RFC 3668. aware will be disclosed, in accordance with Section 6 of BCP 79.
This draft is intended to be become a Proposed Standard RFC. This draft is intended to be become a Proposed Standard RFC.
Distribution of this document is unlimited. Comments should be sent Distribution of this document is unlimited. Comments should be sent
to the DNS mailing list <namedroppers@ops.ietf.org>. to the DNS mailing list <namedroppers@ops.ietf.org>.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as Internet- other groups may also distribute working documents as Internet-
Drafts. Drafts.
skipping to change at page 1, line 47 skipping to change at page 1, line 47
The list of Internet-Draft Shadow Directories can be accessed at The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html http://www.ietf.org/shadow.html
Abstract Abstract
The standard method for storing elliptic curve cryptographic keys and The standard method for storing elliptic curve cryptographic keys and
signatures in the Domain Name System is specified. signatures in the Domain Name System is specified.
Copyright Notice Copyright Notice
Copyright (C) The Internet Society. All Rights Reserved. Copyright (C) The Internet Society (2005). All Rights Reserved.
INTERNET-DRAFT ECC Keys in the DNS INTERNET-DRAFT ECC Keys in the DNS
Acknowledgement Acknowledgement
The assistance of Hilarie K. Orman in the production of this document The assistance of Hilarie K. Orman in the production of this document
is greatfully acknowledged. is greatfully acknowledged.
Table of Contents Table of Contents
skipping to change at page 3, line 12 skipping to change at page 3, line 12
Author's Addresses........................................16 Author's Addresses........................................16
Expiration and File Name..................................16 Expiration and File Name..................................16
INTERNET-DRAFT ECC Keys in the DNS INTERNET-DRAFT ECC Keys in the DNS
1. Introduction 1. Introduction
The Domain Name System (DNS) is the global hierarchical replicated The Domain Name System (DNS) is the global hierarchical replicated
distributed database system for Internet addressing, mail proxy, and distributed database system for Internet addressing, mail proxy, and
other information. The DNS has been extended to include digital other information. The DNS has been extended to include digital
signatures and cryptographic keys as described in [RFC intro, signatures and cryptographic keys as described in [RFC 4033, 4034,
protocol, records]. 4035].
This document describes how to store elliptic curve cryptographic This document describes how to store elliptic curve cryptographic
(ECC) keys and signatures in the DNS so they can be used for a (ECC) keys and signatures in the DNS so they can be used for a
variety of security purposes. Familiarity with ECC cryptography is variety of security purposes. Familiarity with ECC cryptography is
assumed [Menezes]. assumed [Menezes].
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in [RFC 2119]. document are to be interpreted as described in [RFC 2119].
2. Elliptic Curve Data in Resource Records 2. Elliptic Curve Data in Resource Records
Elliptic curve public keys are stored in the DNS within the RDATA Elliptic curve public keys are stored in the DNS within the RDATA
portions of key RRs, such as RRKEY and KEY [RFC records] RRs, with portions of key RRs, such as RRKEY and KEY [RFC 4034] RRs, with the
the structure shown below. structure shown below.
The research world continues to work on the issue of which is the The research world continues to work on the issue of which is the
best elliptic curve system, which finite field to use, and how to best elliptic curve system, which finite field to use, and how to
best represent elements in the field. So, representations are best represent elements in the field. So, representations are
defined for every type of finite field, and every type of elliptic defined for every type of finite field, and every type of elliptic
curve. The reader should be aware that there is a unique finite curve. The reader should be aware that there is a unique finite
field with a particular number of elements, but many possible field with a particular number of elements, but many possible
representations of that field and its elements. If two different representations of that field and its elements. If two different
representations of a field are given, they are interconvertible with representations of a field are given, they are interconvertible with
a tedious but practical precomputation, followed by a fast a tedious but practical precomputation, followed by a fast
skipping to change at page 11, line 46 skipping to change at page 11, line 46
SIG RR's RDLENGTH. They are right justified, high-order-octet first. SIG RR's RDLENGTH. They are right justified, high-order-octet first.
The same conditional formula for calculating the length from LQ is The same conditional formula for calculating the length from LQ is
used as for all the other length fields above. used as for all the other length fields above.
The data signed is determined as specified in [RFC 2535]. Then the The data signed is determined as specified in [RFC 2535]. Then the
following steps are taken where Q, P, G, and Y are as specified in following steps are taken where Q, P, G, and Y are as specified in
the public key [Schneier]: the public key [Schneier]:
hash = SHA-1 ( data ) hash = SHA-1 ( data )
Generate random [RFC 1750] K such that 0 < K < Q. (Never sign two Generate random [RFC 4086] K such that 0 < K < Q. (Never sign two
different messages with the same K. K should be chosen from a different messages with the same K. K should be chosen from a
very large space: If an opponent learns a K value for a single very large space: If an opponent learns a K value for a single
signature, the user's signing key is compromised, and a forger signature, the user's signing key is compromised, and a forger
can sign arbitrary messages. There is no harm in signing the can sign arbitrary messages. There is no harm in signing the
same message multiple times with the same key or different same message multiple times with the same key or different
keys.) keys.)
R = (the W-coordinate of ( K*G on the elliptic curve )) interpreted R = (the W-coordinate of ( K*G on the elliptic curve )) interpreted
INTERNET-DRAFT ECC Keys in the DNS INTERNET-DRAFT ECC Keys in the DNS
skipping to change at page 14, line 9 skipping to change at page 14, line 9
Assignment of meaning to the remaining ECC data flag bits or to Assignment of meaning to the remaining ECC data flag bits or to
values of ECC fields outside the ranges for which meaning in values of ECC fields outside the ranges for which meaning in
defined in this document requires an IETF consensus as defined in defined in this document requires an IETF consensus as defined in
[RFC 2434]. [RFC 2434].
INTERNET-DRAFT ECC Keys in the DNS INTERNET-DRAFT ECC Keys in the DNS
Copyright and Disclaimer Copyright and Disclaimer
Copyright (C) The Internet Society 2004. This document is subject Copyright (C) The Internet Society 2005. This document is subject
to the rights, licenses and restrictions contained in BCP 78 and to the rights, licenses and restrictions contained in BCP 78, and
except as set forth therein, the authors retain all their rights. except as set forth therein, the authors retain all their rights.
This document and the information contained herein are provided on This document and the information contained herein are provided on
an "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE an "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE
REPRESENTS OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY AND REPRESENTS OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY AND
THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT
THE USE OF THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR THE USE OF THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR
ANY IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A ANY IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A
PARTICULAR PURPOSE. PARTICULAR PURPOSE.
skipping to change at page 15, line 15 skipping to change at page 15, line 15
INTERNET-DRAFT ECC Keys in the DNS INTERNET-DRAFT ECC Keys in the DNS
Informational References Informational References
[RFC 1034] - P. Mockapetris, "Domain names - concepts and [RFC 1034] - P. Mockapetris, "Domain names - concepts and
facilities", 11/01/1987. facilities", 11/01/1987.
[RFC 1035] - P. Mockapetris, "Domain names - implementation and [RFC 1035] - P. Mockapetris, "Domain names - implementation and
specification", 11/01/1987. specification", 11/01/1987.
[RFC 1750] - D. Eastlake, S. Crocker, J. Schiller, "Randomness [RFC 2671] - P. Vixie, "Extension Mechanisms for DNS (EDNS0)",
Recommendations for Security", 12/29/1994. August 1999.
[RFC intro] - "DNS Security Introduction and Requirements", R. [RFC 4033] - Arends, R., Austein, R., Larson, M., Massey, D., and
Arends, M. Larson, R. Austein, D. Massey, S. Rose, work in S. Rose, "DNS Security Introduction and Requirements", RFC 4033,
progress, draft-ietf-dnsext-dnssec-intro-*.txt. March 2005.
[RFC protocol] - "Protocol Modifications for the DNS Security [RFC 4035] - Arends, R., Austein, R., Larson, M., Massey, D., and
Extensions", R. Arends, M. Larson, R. Austein, D. Massey, S. Rose, S. Rose, "Protocol Modifications for the DNS Security Extensions",
work in progress, draft-ietf-dnsext-dnssec-protocol-*.txt. RFC 4035, March 2005.
[RFC 2671] - P. Vixie, "Extension Mechanisms for DNS (EDNS0)", [RFC 4086] - Eastlake, D., 3rd, Schiller, J., and S. Crocker,
August 1999. "Randomness Requirements for Security", BCP 106, RFC 4086, June
2005.
[Schneier] - Bruce Schneier, "Applied Cryptography: Protocols, [Schneier] - Bruce Schneier, "Applied Cryptography: Protocols,
Algorithms, and Source Code in C", 1996, John Wiley and Sons Algorithms, and Source Code in C", 1996, John Wiley and Sons
[Menezes] - Alfred Menezes, "Elliptic Curve Public Key [Menezes] - Alfred Menezes, "Elliptic Curve Public Key
Cryptosystems", 1993 Kluwer. Cryptosystems", 1993 Kluwer.
[Silverman] - Joseph Silverman, "The Arithmetic of Elliptic [Silverman] - Joseph Silverman, "The Arithmetic of Elliptic
Curves", 1986, Springer Graduate Texts in mathematics #106. Curves", 1986, Springer Graduate Texts in mathematics #106.
Normative Refrences Normative Refrences
[RFC 2119] - S. Bradner, "Key words for use in RFCs to Indicate [RFC 2119] - S. Bradner, "Key words for use in RFCs to Indicate
Requirement Levels", March 1997. Requirement Levels", March 1997.
[RFC 2434] - T. Narten, H. Alvestrand, "Guidelines for Writing an [RFC 2434] - T. Narten, H. Alvestrand, "Guidelines for Writing an
IANA Considerations Section in RFCs", October 1998. IANA Considerations Section in RFCs", October 1998.
[RFC records] - "Resource Records for the DNS Security Extensions", [RFC 4034] - Arends, R., Austein, R., Larson, M., Massey, D., and
R. Arends, R. Austein, M. Larson, D. Massey, S. Rose, work in S. Rose, "Resource Records for the DNS Security Extensions", RFC
progress, draft-ietf-dnsext-dnssec-records- *.txt. 4034, March 2005.
INTERNET-DRAFT ECC Keys in the DNS INTERNET-DRAFT ECC Keys in the DNS
Author's Addresses Author's Addresses
Rich Schroeppel Rich Schroeppel
500 S. Maple Drive 500 S. Maple Drive
Woodland Hills, UT 84653 USA Woodland Hills, UT 84653 USA
Telephone: +1-505-844-9079(w) Telephone: +1-505-844-9079(w)
+1-801-423-7998(h)
Email: rschroe@sandia.gov Email: rschroe@sandia.gov
Donald E. Eastlake 3rd Donald E. Eastlake 3rd
Motorola Laboratories Motorola Laboratories
155 Beaver Street 155 Beaver Street
Milford, MA 01757 USA Milford, MA 01757 USA
Telephone: +1 508-786-7554 (w) Telephone: +1 508-786-7554 (w)
+1 508-634-2066 (h)
EMail: Donald.Eastlake@motorola.com EMail: Donald.Eastlake@motorola.com
Expiration and File Name Expiration and File Name
This draft expires in June 2004. This draft expires in January 2006.
Its file name is draft-ietf-dnsext-ecc-key-06.txt. Its file name is draft-ietf-dnsext-ecc-key-07.txt.
 End of changes. 

This html diff was produced by rfcdiff 1.25, available from http://www.levkowetz.com/ietf/tools/rfcdiff/