idnits 2.17.00 (12 Aug 2021) /tmp/idnits62961/draft-merkle-tls-brainpool-03.txt: Checking boilerplate required by RFC 5378 and the IETF Trust (see https://trustee.ietf.org/license-info): ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/1id-guidelines.txt: ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/checklist : ---------------------------------------------------------------------------- -- The draft header indicates that this document updates RFC4492, but the abstract doesn't seem to mention this, which it should. Miscellaneous warnings: ---------------------------------------------------------------------------- == The copyright year in the IETF Trust and authors Copyright Line does not match the current year (Using the creation date from RFC4492, updated by this document, for RFC5378 checks: 1998-03-18) -- The document seems to lack a disclaimer for pre-RFC5378 work, but may have content which was first submitted before 10 November 2008. If you have contacted all the original authors and they are all willing to grant the BCP78 rights to the IETF Trust, then this is fine, and you can ignore this comment. If not, you may need to add the pre-RFC5378 disclaimer. (See the Legal Provisions document at https://trustee.ietf.org/license-info for more information.) -- The document date (July 2, 2013) is 3244 days in the past. Is this intentional? Checking references for intended status: Informational ---------------------------------------------------------------------------- == Unused Reference: 'RFC2119' is defined on line 143, but no explicit reference was found in the text == Unused Reference: 'RFC6347' is defined on line 159, but no explicit reference was found in the text == Unused Reference: 'RFC6090' is defined on line 205, but no explicit reference was found in the text ** Obsolete normative reference: RFC 4492 (Obsoleted by RFC 8422) ** Obsolete normative reference: RFC 5246 (Obsoleted by RFC 8446) ** Obsolete normative reference: RFC 6347 (Obsoleted by RFC 9147) Summary: 3 errors (**), 0 flaws (~~), 4 warnings (==), 3 comments (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 2 Network Working Group J. Merkle 3 Internet-Draft secunet Security Networks 4 Updates: 4492 (if approved) M. Lochter 5 Intended status: Informational Bundesamt fuer Sicherheit in der 6 Expires: January 3, 2014 Informationstechnik (BSI) 7 July 2, 2013 9 ECC Brainpool Curves for Transport Layer Security (TLS) 10 draft-merkle-tls-brainpool-03 12 Abstract 14 This document specifies the use of several ECC Brainpool curves for 15 authentication and key exchange in the Transport Layer Security (TLS) 16 protocol. 18 Status of This Memo 20 This Internet-Draft is submitted in full conformance with the 21 provisions of BCP 78 and BCP 79. 23 Internet-Drafts are working documents of the Internet Engineering 24 Task Force (IETF). Note that other groups may also distribute 25 working documents as Internet-Drafts. The list of current Internet- 26 Drafts is at http://datatracker.ietf.org/drafts/current/. 28 Internet-Drafts are draft documents valid for a maximum of six months 29 and may be updated, replaced, or obsoleted by other documents at any 30 time. It is inappropriate to use Internet-Drafts as reference 31 material or to cite them other than as "work in progress." 33 This Internet-Draft will expire on January 3, 2014. 35 Copyright Notice 37 Copyright (c) 2013 IETF Trust and the persons identified as the 38 document authors. All rights reserved. 40 This document is subject to BCP 78 and the IETF Trust's Legal 41 Provisions Relating to IETF Documents 42 (http://trustee.ietf.org/license-info) in effect on the date of 43 publication of this document. Please review these documents 44 carefully, as they describe your rights and restrictions with respect 45 to this document. Code Components extracted from this document must 46 include Simplified BSD License text as described in Section 4.e of 47 the Trust Legal Provisions and are provided without warranty as 48 described in the Simplified BSD License. 50 Table of Contents 52 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3 53 2. Security Considerations . . . . . . . . . . . . . . . . . . . . 4 54 3. IANA Considerations . . . . . . . . . . . . . . . . . . . . . . 5 55 4. References . . . . . . . . . . . . . . . . . . . . . . . . . . 6 56 4.1. Normative References . . . . . . . . . . . . . . . . . . . 6 57 4.2. Informative References . . . . . . . . . . . . . . . . . . 6 58 Appendix A. Test Vectors . . . . . . . . . . . . . . . . . . . . . 8 59 A.1. 256 Bit Curve . . . . . . . . . . . . . . . . . . . . . . . 8 60 A.2. 384 Bit Curve . . . . . . . . . . . . . . . . . . . . . . . 9 61 A.3. 512 Bit Curve . . . . . . . . . . . . . . . . . . . . . . . 9 63 1. Introduction 65 In [RFC5639], a new set of elliptic curve groups over finite prime 66 fields for use in cryptographic applications was specified. These 67 groups, denoted as ECC Brainpool curves, were generated in a 68 verifiably pseudo-random way and comply with the security 69 requirements of relevant standards from ISO [ISO1] [ISO2], ANSI 70 [ANSI1], NIST [FIPS], and SecG [SEC2]. 72 [RFC4492] defines the usage of elliptic curves for authentication and 73 key agreement in TLS 1.0 and TLS 1.1, and these mechanisms are also 74 applicable to TLS 1.2 [RFC5246]. While the ASN.1 object identifiers 75 defined in [RFC5639] already allow usage of the ECC Brainpool curves 76 for TLS (client or server) authentication through reference in X.509 77 certificates according to [RFC3279] and [RFC5480] , their negotiation 78 for key exchange according to [RFC4492] requires the definition and 79 assignment of additional NamedCurve IDs. This document specifies 80 such values for three curves from [RFC5639]. 82 Test vectors for a Diffie-Hellman key exchange using these ECC 83 Brainpool curves are provided in Appendix A 85 2. Security Considerations 87 The security considerations of [RFC5246] apply accordingly. 89 The confidentiality, authenticity and integrity of the TLS 90 communication is limited by the weakest cryptographic primitive 91 applied. In order to achieve a maximum security level when using one 92 of the elliptic curves from Table 1 for authentication and / or key 93 exchange in TLS, the key derivation function, the algorithms and key 94 lengths of symmetric encryption and message authentication as well as 95 the algorithm, bit length and hash function used for signature 96 generation should be chosen according to the recommendations of 97 [NIST800-57] and [RFC5639]. Furthermore, the private Diffie-Hellman 98 keys should be selected with the same bit length as the order of the 99 group generated by the base point G and with approximately maximum 100 entropy. 102 Implementations of elliptic curve cryptography for TLS may be 103 susceptible to side-channel attacks. Particular care should be taken 104 for implementations that internally transform curve points to points 105 on the corresponding "twisted curve", using the map (x',y') = (x*Z^2, 106 y*Z^3) with the coefficient Z specified for that curve in [RFC5639], 107 in order to take advantage of an an efficient arithmetic based on the 108 twisted curve's special parameters (A = -3): although the twisted 109 curve itself offers the same level of security as the corresponding 110 random curve (through mathematical equivalence), an arithmetic based 111 on small curve parameters may be harder to protect against side- 112 channel attacks. General guidance on resistence of elliptic curve 113 cryptography implementations against side-channel-attacks is given in 114 [BSI1] and [HMV]. 116 3. IANA Considerations 118 IANA is requested to assign numbers for the ECC Brainpool curves, 119 defined in [RFC5639], found in Table 1 in the Transport Layer 120 Security (TLS) Parameters registry EC Named Curve [IANA-TLS]. These 121 curves are suitable for use with DTLS. 123 +-------+-----------------+---------+-----------+ 124 | Value | Description | DTLS-OK | Reference | 125 +-------+-----------------+---------+-----------+ 126 | TBD1 | brainpoolP256r1 | Y | This doc | 127 | | | | | 128 | TBD2 | brainpoolP384r1 | Y | This doc | 129 | | | | | 130 | TBD3 | brainpoolP512r1 | Y | This doc | 131 +-------+-----------------+---------+-----------+ 133 Table 1 135 4. References 137 4.1. Normative References 139 [IANA-TLS] Internet Assigned Numbers Authority, "Transport Layer 140 Security (TLS) Parameters", . 143 [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate 144 Requirement Levels", BCP 14, RFC 2119, March 1997. 146 [RFC4492] Blake-Wilson, S., Bolyard, N., Gupta, V., Hawk, C., and 147 B. Moeller, "Elliptic Curve Cryptography (ECC) Cipher 148 Suites for Transport Layer Security (TLS)", RFC 4492, 149 May 2006. 151 [RFC5246] Dierks, T. and E. Rescorla, "The Transport Layer 152 Security (TLS) Protocol Version 1.2", RFC 5246, 153 August 2008. 155 [RFC5639] Lochter, M. and J. Merkle, "Elliptic Curve Cryptography 156 (ECC) Brainpool Standard Curves and Curve Generation", 157 RFC 5639, March 2010. 159 [RFC6347] Rescorla, E. and N. Modadugu, "Datagram Transport Layer 160 Security Version 1.2", RFC 6347, January 2012. 162 4.2. Informative References 164 [ANSI1] American National Standards Institute, "Public Key 165 Cryptography For The Financial Services Industry: The 166 Elliptic Curve Digital Signature Algorithm (ECDSA)", 167 ANSI X9.62, 2005. 169 [BSI1] Bundesamt fuer Sicherheit in der Informationstechnik, 170 "Minimum Requirements for Evaluating Side-Channel 171 Attack Resistance of Elliptic Curve Implementations", 172 July 2011. 174 [FIPS] National Institute of Standards and Technology, 175 "Digital Signature Standard (DSS)", FIPS PUB 186-2, 176 December 1998. 178 [HMV] Hankerson, D., Menezes, A., and S. Vanstone, "Guide to 179 Elliptic Curve Cryptography", Springer Verlag, 2004. 181 [ISO1] International Organization for Standardization, 182 "Information Technology - Security Techniques - Digital 183 Signatures with Appendix - Part 3: Discrete Logarithm 184 Based Mechanisms", ISO/IEC 14888-3, 2006. 186 [ISO2] International Organization for Standardization, 187 "Information Technology - Security Techniques - 188 Cryptographic Techniques Based on Elliptic Curves - 189 Part 2: Digital signatures", ISO/IEC 15946-2, 2002. 191 [NIST800-57] National Institute of Standards and Technology, 192 "Recommendation for Key Management - Part 1: General 193 (Revised)", NIST Special Publication 800-57, 194 March 2007. 196 [RFC3279] Bassham, L., Polk, W., and R. Housley, "Algorithms and 197 Identifiers for the Internet X.509 Public Key 198 Infrastructure Certificate and Certificate Revocation 199 List (CRL) Profile", RFC 3279, April 2002. 201 [RFC5480] Turner, S., Brown, D., Yiu, K., Housley, R., and T. 202 Polk, "Elliptic Curve Cryptography Subject Public Key 203 Information", RFC 5480, March 2009. 205 [RFC6090] McGrew, D., Igoe, K., and M. Salter, "Fundamental 206 Elliptic Curve Cryptography Algorithms", RFC 6090, 207 February 2011. 209 [SEC1] Certicom Research, "Elliptic Curve Cryptography", 210 Standards for Efficient Cryptography (SEC) 1, 211 September 2000. 213 [SEC2] Certicom Research, "Recommended Elliptic Curve Domain 214 Parameters", Standards for Efficient Cryptography 215 (SEC) 2, September 2000. 217 Appendix A. Test Vectors 219 This section provides some test vectors for example Diffie-Hellman 220 key exchanges using each of the curves defined in Table 1 . In all 221 of the following sections the following notation is used: 223 d_A: the secret key of party A 225 x_qA: the x-coordinate of the public key of party A 227 y_qA: the y-coordinate of the public key of party A 229 d_B: the secret key of party B 231 x_qB: the x-coordinate of the public key of party B 233 y_qB: the y-coordinate of the public key of party B 235 x_Z: the x-coordinate of the shared secret that results from 236 completion of the Diffie-Hellman computation, i.e. the hex 237 representation of the pre-master secret 239 y_Z: the y-coordinate of the shared secret that results from 240 completion of the Diffie-Hellman computation 242 The field elements x_qA, y_qA, x_qB, y_qB, x_Z, y_Z are represented 243 as hexadecimal values using the FieldElement-to-OctetString 244 conversion method specified in [SEC1]. 246 A.1. 256 Bit Curve 248 Curve brainpoolP256r1 250 dA = 251 81DB1EE100150FF2EA338D708271BE38300CB54241D79950F77B063039804F1D 253 x_qA = 254 44106E913F92BC02A1705D9953A8414DB95E1AAA49E81D9E85F929A8E3100BE5 256 y_qA = 257 8AB4846F11CACCB73CE49CBDD120F5A900A69FD32C272223F789EF10EB089BDC 259 dB = 260 55E40BC41E37E3E2AD25C3C6654511FFA8474A91A0032087593852D3E7D76BD3 262 x_qB = 263 8D2D688C6CF93E1160AD04CC4429117DC2C41825E1E9FCA0ADDD34E6F1B39F7B 264 y_qB = 265 990C57520812BE512641E47034832106BC7D3E8DD0E4C7F1136D7006547CEC6A 267 x_Z = 268 89AFC39D41D3B327814B80940B042590F96556EC91E6AE7939BCE31F3A18BF2B 270 y_Z = 271 49C27868F4ECA2179BFD7D59B1E3BF34C1DBDE61AE12931648F43E59632504DE 273 A.2. 384 Bit Curve 275 Curve brainpoolP384r1 277 dA = 1E20F5E048A5886F1F157C74E91BDE2B98C8B52D58E5003D57053FC4B0BD6 278 5D6F15EB5D1EE1610DF870795143627D042 280 x_qA = 68B665DD91C195800650CDD363C625F4E742E8134667B767B1B47679358 281 8F885AB698C852D4A6E77A252D6380FCAF068 283 y_qA = 55BC91A39C9EC01DEE36017B7D673A931236D2F1F5C83942D049E3FA206 284 07493E0D038FF2FD30C2AB67D15C85F7FAA59 286 dB = 032640BC6003C59260F7250C3DB58CE647F98E1260ACCE4ACDA3DD869F74E 287 01F8BA5E0324309DB6A9831497ABAC96670 289 x_qB = 4D44326F269A597A5B58BBA565DA5556ED7FD9A8A9EB76C25F46DB69D19 290 DC8CE6AD18E404B15738B2086DF37E71D1EB4 292 y_qB = 62D692136DE56CBE93BF5FA3188EF58BC8A3A0EC6C1E151A21038A42E91 293 85329B5B275903D192F8D4E1F32FE9CC78C48 295 x_Z = 0BD9D3A7EA0B3D519D09D8E48D0785FB744A6B355E6304BC51C229FBBCE2 296 39BBADF6403715C35D4FB2A5444F575D4F42 298 y_Z = 0DF213417EBE4D8E40A5F76F66C56470C489A3478D146DECF6DF0D94BAE9 299 E598157290F8756066975F1DB34B2324B7BD 301 A.3. 512 Bit Curve 303 Curve brainpoolP512r1 305 dA = 16302FF0DBBB5A8D733DAB7141C1B45ACBC8715939677F6A56850A38BD87B 306 D59B09E80279609FF333EB9D4C061231FB26F92EEB04982A5F1D1764CAD5766542 307 2 309 x_qA = 0A420517E406AAC0ACDCE90FCD71487718D3B953EFD7FBEC5F7F27E28C6 310 149999397E91E029E06457DB2D3E640668B392C2A7E737A7F0BF04436D11640FD0 311 9FD 312 y_qA = 72E6882E8DB28AAD36237CD25D580DB23783961C8DC52DFA2EC138AD472 313 A0FCEF3887CF62B623B2A87DE5C588301EA3E5FC269B373B60724F5E82A6AD147F 314 DE7 316 dB = 230E18E1BCC88A362FA54E4EA3902009292F7F8033624FD471B5D8ACE49D1 317 2CFABBC19963DAB8E2F1EBA00BFFB29E4D72D13F2224562F405CB80503666B2542 318 9 320 x_qB = 9D45F66DE5D67E2E6DB6E93A59CE0BB48106097FF78A081DE781CDB31FC 321 E8CCBAAEA8DD4320C4119F1E9CD437A2EAB3731FA9668AB268D871DEDA55A54731 322 99F 324 y_qB = 2FDC313095BCDD5FB3A91636F07A959C8E86B5636A1E930E8396049CB48 325 1961D365CC11453A06C719835475B12CB52FC3C383BCE35E27EF194512B7187628 326 5FA 328 x_Z = A7927098655F1F9976FA50A9D566865DC530331846381C87256BAF322624 329 4B76D36403C024D7BBF0AA0803EAFF405D3D24F11A9B5C0BEF679FE1454B21C4CD 330 1F 332 y_Z = 7DB71C3DEF63212841C463E881BDCF055523BD368240E6C3143BD8DEF8B3 333 B3223B95E0F53082FF5E412F4222537A43DF1C6D25729DDB51620A832BE6A26680 334 A2 336 Authors' Addresses 338 Johannes Merkle 339 secunet Security Networks 340 Mergenthaler Allee 77 341 65760 Eschborn 342 Germany 344 Phone: +49 201 5454 3091 345 EMail: johannes.merkle@secunet.com 347 Manfred Lochter 348 Bundesamt fuer Sicherheit in der Informationstechnik (BSI) 349 Postfach 200363 350 53133 Bonn 351 Germany 353 Phone: +49 228 9582 5643 354 EMail: manfred.lochter@bsi.bund.de