RFC 8734: Elliptic Curve Cryptography (ECC) Brainpool Curves for Transport Layer Security (TLS) Version 1.3
- L. Bruckert,
- J. Merkle,
- M. Lochter
Abstract
Elliptic Curve Cryptography (ECC) Brainpool curves were an option for authentication and key exchange in the Transport Layer Security (TLS) protocol version 1.2 but were deprecated by the IETF for use with TLS version 1.3 because they had little usage. However, these curves have not been shown to have significant cryptographical weaknesses, and there is some interest in using several of these curves in TLS 1.3.¶
This document provides the necessary protocol mechanisms for using ECC Brainpool curves in TLS 1.3. This approach is not endorsed by the IETF.¶
Status of This Memo
This document is not an Internet Standards Track specification; it is published for informational purposes.¶
This is a contribution to the RFC Series, independently of any other RFC stream. The RFC Editor has chosen to publish this document at its discretion and makes no statement about its value for implementation or deployment. Documents approved for publication by the RFC Editor are not candidates for any level of Internet Standard; see Section 2 of RFC 7841.¶
Information about the current status of this document, any
errata, and how to provide feedback on it may be obtained at
https://
Copyright Notice
Copyright (c) 2020 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://
1. Introduction
[RFC5639] specifies a new set of elliptic curve groups over finite prime fields for use in cryptographic applications. These groups, denoted as ECC Brainpool curves, were generated in a verifiably pseudorandom way and comply with the security requirements of relevant standards from ISO [ISO1][ISO2], ANSI [ANSI1], NIST [FIPS], and SECG [SEC2].¶
[RFC8422] defines the usage of elliptic curves for authentication and key agreement in TLS 1.2 and earlier versions, and [RFC7027] defines the usage of the ECC Brainpool curves for authentication and key exchange in TLS. The latter is applicable to TLS 1.2 and earlier versions but not to TLS 1.3, which deprecates the ECC Brainpool curve IDs defined in [RFC7027] due to the lack of widespread deployment. However, there is some interest in using these curves in TLS 1.3.¶
The negotiation of ECC Brainpool curves for key exchange in TLS 1.3, according to [RFC8446], requires the definition and assignment of additional NamedGroup IDs. This document provides the necessary definition and assignment of additional SignatureScheme IDs for using three ECC Brainpool curves from [RFC5639].¶
This approach is not endorsed by the IETF. Implementers and deployers need to be aware of the strengths and weaknesses of all security mechanisms that they use.¶
2. Requirements Terminology
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶
3. Brainpool NamedGroup Types
According to [RFC8446], the
"supported
The encoding of Ephemeral Elliptic Curve Diffie-Hellman (ECDHE) parameters for sec256r1, secp384r1, and secp521r1, as defined in Section 4.2.8.2 of [RFC8446], also applies to this document.¶
Test vectors for a Diffie-Hellman key exchange using these elliptic curves are provided in Appendix A.¶
4. Brainpool SignatureScheme Types
According to [RFC8446], the name space SignatureScheme is used for the negotiation of elliptic curve groups for authentication via the "signature
5. IANA Considerations
IANA has updated the references for the ECC Brainpool curves listed in the "TLS Supported Groups" [IANA-TLS] subregistry of the "Transport Layer Security (TLS) Parameters" registry to refer to this document.¶
IANA has updated the references for the ECC Brainpool curves in the
"TLS Signature
6. Security Considerations
The security considerations of [RFC8446] apply accordingly.¶
The confidentiality
When using ECDHE key agreement with the curves brainpool
Implementations of elliptic curve cryptography for TLS may be susceptible to side-channel attacks. Particular care should be taken for implementations that internally transform curve points to points on the corresponding "twisted curve", using the map (x',y') = (x*Z^2, y*Z^3) with the coefficient Z specified for that curve in [RFC5639], in order to take advantage of an efficient arithmetic based on the twisted curve's special parameters (A = -3). Although the twisted curve itself offers the same level of security as the corresponding random curve (through mathematical equivalence), arithmetic based on small curve parameters may be harder to protect against side-channel attacks. General guidance on resistance of elliptic curve cryptography implementations against side-channel attacks is given in [BSI1] and [HMV].¶
7. References
7.1. Normative References
- [IANA-TLS]
-
IANA, "Transport Layer Security (TLS) Parameters", <https://
www >..iana .org /assignments /tls -parameters - [RFC2119]
-
Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10
.17487 , , <https:///RFC2119 www >..rfc -editor .org /info /rfc2119 - [RFC5639]
-
Lochter, M. and J. Merkle, "Elliptic Curve Cryptography (ECC) Brainpool Standard Curves and Curve Generation", RFC 5639, DOI 10
.17487 , , <https:///RFC5639 www >..rfc -editor .org /info /rfc5639 - [RFC7027]
-
Merkle, J. and M. Lochter, "Elliptic Curve Cryptography (ECC) Brainpool Curves for Transport Layer Security (TLS)", RFC 7027, DOI 10
.17487 , , <https:///RFC7027 www >..rfc -editor .org /info /rfc7027 - [RFC8174]
-
Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10
.17487 , , <https:///RFC8174 www >..rfc -editor .org /info /rfc8174 - [RFC8422]
-
Nir, Y., Josefsson, S., and M. Pegourie
-Gonnard , "Elliptic Curve Cryptography (ECC) Cipher Suites for Transport Layer Security (TLS) Versions 1.2 and Earlier", RFC 8422, DOI 10.17487 , , <https:///RFC8422 www >..rfc -editor .org /info /rfc8422 - [RFC8446]
-
Rescorla, E., "The Transport Layer Security (TLS) Protocol Version 1.3", RFC 8446, DOI 10
.17487 , , <https:///RFC8446 www >..rfc -editor .org /info /rfc8446
7.2. Informative References
- [ANSI1]
- American National Standards Institute, "Public Key Cryptography For The Financial Services Industry: the Elliptic Curve Digital Signature Algorithm (ECDSA)", ANSI X9.62, .
- [BSI1]
-
Bundesamt fuer Sicherheit in der Informationstec
hnik , "Minimum Requirements for Evaluating Side-Channel Attack Resistance of Elliptic Curve Implementations" , . - [FIPS]
-
National Institute of Standards and Technology, "Digital Signature Standard (DSS)", FIPS PUB 186-4, DOI 10
.6028 , , <https:///NIST .FIPS .186 -4 doi >..org /10 .6028 /NIST .FIPS .186 -4 - [HMV]
- Hankerson, D., Menezes, A., and S. Vanstone, "Guide to Elliptic Curve Cryptography", Springer Verlag, .
- [ISO1]
- International Organization for Standardization, "Information Technology - Security Techniques - Digital Signatures with Appendix - Part 3: Discrete Logarithm Based Mechanisms", ISO/IEC 14888-3, .
- [ISO2]
- International Organization for Standardization, "Information Technology - Security techniques - Cryptographic techniques based on elliptic curves - Part 2: Digital signatures", ISO/IEC 15946-2:2002, .
- [NIST800-57]
-
National Institute of Standards and Technology, "Recommendation for Key Management - Part 1: General (Revised)", NIST Special Publication 800-57, DOI 10
.6028 , , <https:///NIST .SP .800 -57ptlr4 doi >..org /10 .6028 /NIST .SP .800 -57ptlr4 - [SEC1]
- Standards for Efficient Cryptography Group, "SEC1: Elliptic Curve Cryptography", .
- [SEC2]
- Standards for Efficient Cryptography Group, "SEC 2: Recommended Elliptic Curve Domain Parameters", .
Appendix A. Test Vectors
This non-normative Appendix provides some test vectors (for example, Diffie-Hellman key exchanges using each of the curves defined in Table 1). The following notation is used in all of the subsequent sections:¶
- d_A:
- the secret key of party A¶
- x_qA:
- the x-coordinate of the public key of party A¶
- y_qA:
- the y-coordinate of the public key of party A¶
- d_B:
- the secret key of party B¶
- x_qB:
- the x-coordinate of the public key of party B¶
- y_qB:
- the y-coordinate of the public key of party B¶
- x_Z:
- the x-coordinate of the shared secret that results from completion of the Diffie-Hellman computation, i.e., the hex representation of the premaster secret¶
- y_Z:
- the y-coordinate of the shared secret that results from completion of the Diffie-Hellman computation¶
The field elements x_qA, y_qA, x_qB, y_qB, x_Z, and y_Z are represented as hexadecimal values using the Field
A.1. 256-Bit Curve
Curve brainpoolP256r1¶
A.2. 384-Bit Curve
Curve brainpoolP384r1¶
A.3. 512-Bit Curve
Curve brainpoolP512r1¶