draft-ietf-httpauth-mutual-algo-03.txt   draft-ietf-httpauth-mutual-algo-04.txt 
HTTPAUTH Working Group Y. Oiwa HTTPAUTH Working Group Y. Oiwa
Internet-Draft H. Watanabe Internet-Draft H. Watanabe
Intended status: Experimental H. Takagi Intended status: Experimental H. Takagi
Expires: January 7, 2016 ITRI, AIST Expires: July 10, 2016 ITRI, AIST
K. Maeda K. Maeda
T. Hayashi T. Hayashi
Lepidum Lepidum
Y. Ioku Y. Ioku
Individual Individual
July 6, 2015 January 7, 2016
Mutual Authentication Protocol for HTTP: KAM3-based Cryptographic Mutual Authentication Protocol for HTTP: KAM3-based Cryptographic
Algorithms Algorithms
draft-ietf-httpauth-mutual-algo-03 draft-ietf-httpauth-mutual-algo-04
Abstract Abstract
This document specifies some cryptographic algorithms which will be This document specifies some cryptographic algorithms which will be
used for the Mutual user authentication method for the Hyper-text used for the Mutual user authentication method for the Hyper-text
Transport Protocol (HTTP). Transport Protocol (HTTP).
Status of this Memo Status of this Memo
This Internet-Draft is submitted in full conformance with the This Internet-Draft is submitted in full conformance with the
skipping to change at page 1, line 39 skipping to change at page 1, line 39
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on January 7, 2016. This Internet-Draft will expire on July 10, 2016.
Copyright Notice Copyright Notice
Copyright (c) 2015 IETF Trust and the persons identified as the Copyright (c) 2016 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License. described in the Simplified BSD License.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 3 1.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 3
2. Cryptographic Overview (Non-normative) . . . . . . . . . . . . 3 2. Cryptographic Overview (Non-normative) . . . . . . . . . . . . 3
3. Authentication Algorithms . . . . . . . . . . . . . . . . . . 4 3. Authentication Algorithms . . . . . . . . . . . . . . . . . . 4
3.1. Support Functions and Notations . . . . . . . . . . . . . 5 3.1. Support Functions and Notations . . . . . . . . . . . . . 5
3.2. Functions for Discrete-Logarithm Settings . . . . . . . . 6 3.2. Functions for Discrete-Logarithm Settings . . . . . . . . 5
3.3. Functions for Elliptic-Curve Settings . . . . . . . . . . 7 3.3. Functions for Elliptic-Curve Settings . . . . . . . . . . 7
4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 8 4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 8
5. Security Considerations . . . . . . . . . . . . . . . . . . . 9 5. Security Considerations . . . . . . . . . . . . . . . . . . . 9
5.1. General Implementation Considerations . . . . . . . . . . 9 5.1. General Implementation Considerations . . . . . . . . . . 9
5.2. Cryptographic Assumptions and Considerations . . . . . . . 9 5.2. Cryptographic Assumptions and Considerations . . . . . . . 9
6. Notice on intellectual properties . . . . . . . . . . . . . . 10 6. Notice on intellectual properties . . . . . . . . . . . . . . 10
7. References . . . . . . . . . . . . . . . . . . . . . . . . . . 10 7. References . . . . . . . . . . . . . . . . . . . . . . . . . . 10
7.1. Normative References . . . . . . . . . . . . . . . . . . . 10 7.1. Normative References . . . . . . . . . . . . . . . . . . . 10
7.2. Informative References . . . . . . . . . . . . . . . . . . 11 7.2. Informative References . . . . . . . . . . . . . . . . . . 11
Appendix A. (Informative) Group Parameters for Appendix A. (Informative) Group Parameters for
Discrete-Logarithm Based Algorithms . . . . . . . . . 11 Discrete-Logarithm Based Algorithms . . . . . . . . . 11
Appendix B. (Informative) Derived Numerical Values . . . . . . . 13 Appendix B. (Informative) Derived Numerical Values . . . . . . . 13
Appendix C. (Informative) Draft Change Log . . . . . . . . . . . 14 Appendix C. (Informative) Draft Change Log . . . . . . . . . . . 14
C.1. Changes in HTTPAUTH-WG revision 03 . . . . . . . . . . . . 14 C.1. Changes in HTTPAUTH-WG revision 04 . . . . . . . . . . . . 14
C.2. Changes in HTTPAUTH-WG revision 02 . . . . . . . . . . . . 14 C.2. Changes in HTTPAUTH-WG revision 03 . . . . . . . . . . . . 14
C.3. Changes in HTTPAUTH-WG revision 01 . . . . . . . . . . . . 14 C.3. Changes in HTTPAUTH-WG revision 02 . . . . . . . . . . . . 14
C.4. Changes in HTTPAUTH-WG revision 00 . . . . . . . . . . . . 14 C.4. Changes in HTTPAUTH-WG revision 01 . . . . . . . . . . . . 14
C.5. Changes in HTTPAUTH revision 02 . . . . . . . . . . . . . 14 C.5. Changes in HTTPAUTH-WG revision 00 . . . . . . . . . . . . 14
C.6. Changes in HTTPAUTH revision 01 . . . . . . . . . . . . . 14 C.6. Changes in HTTPAUTH revision 02 . . . . . . . . . . . . . 14
C.7. Changes in revision 02 . . . . . . . . . . . . . . . . . . 14 C.7. Changes in HTTPAUTH revision 01 . . . . . . . . . . . . . 14
C.8. Changes in revision 01 . . . . . . . . . . . . . . . . . . 15 C.8. Changes in revision 02 . . . . . . . . . . . . . . . . . . 15
C.9. Changes in revision 00 . . . . . . . . . . . . . . . . . . 15 C.9. Changes in revision 01 . . . . . . . . . . . . . . . . . . 15
C.10. Changes in revision 00 . . . . . . . . . . . . . . . . . . 15
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 15 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 15
1. Introduction 1. Introduction
This document specifies some algorithms for Mutual authentication This document specifies some algorithms for Mutual authentication
protocol for Hyper-Text Transport Protocol (HTTP) protocol for Hyper-Text Transport Protocol (HTTP)
[I-D.ietf-httpauth-mutual]. The algorithms are based on so-called [I-D.ietf-httpauth-mutual]. The algorithms are based on so-called
"Augmented Password-based Authenticated Key Exchange" (Augmented "Augmented Password-based Authenticated Key Exchange" (Augmented
PAKE) techniques. In particular, it uses one of three key exchange PAKE) techniques. In particular, it uses one of three key exchange
algorithm defined in the ISO 11770-4: "Key management - Mechanisms algorithm defined in the ISO 11770-4: "Key management - Mechanisms
skipping to change at page 5, line 20 skipping to change at page 5, line 20
For the elliptic-curve settings, the underlying groups are the For the elliptic-curve settings, the underlying groups are the
elliptic curves over the prime fields P-256 and P-521, respectively, elliptic curves over the prime fields P-256 and P-521, respectively,
specified in the appendix D.1.2 of FIPS PUB 186-4 [FIPS.186-4.2013] specified in the appendix D.1.2 of FIPS PUB 186-4 [FIPS.186-4.2013]
specification. The hash functions H, which are referenced by the specification. The hash functions H, which are referenced by the
core document, are SHA-256 for the P-256 curve and SHA-512 for the core document, are SHA-256 for the P-256 curve and SHA-512 for the
P-521 curve, respectively. Cofactors of these curves are 1. The P-521 curve, respectively. Cofactors of these curves are 1. The
hash iteration count nIterPi is 16384. The representation of the hash iteration count nIterPi is 16384. The representation of the
parameters kc1, ks1, vkc, and vks is hex-fixed-number. parameters kc1, ks1, vkc, and vks is hex-fixed-number.
[[Editorial Note: remove before submission] We should take a care on
recent hot discussion topic on the choice of elliptic curves for
cryptography.]]
Note: This algorithm is based on the Key Agreement Mechanism 3 (KAM3) Note: This algorithm is based on the Key Agreement Mechanism 3 (KAM3)
defined in Section 6.3 of ISO/IEC 11770-4 [ISO.11770-4.2006] with a defined in Section 6.3 of ISO/IEC 11770-4 [ISO.11770-4.2006] with a
few modifications/improvements. However, implementers should use few modifications/improvements. However, implementers should use
this document as the normative reference, because the algorithm has this document as the normative reference, because the algorithm has
been changed in several minor details as well as major improvements. been changed in several minor details as well as major improvements.
3.1. Support Functions and Notations 3.1. Support Functions and Notations
The algorithm definitions use several support functions and notations The algorithm definitions use several support functions and notations
defined below: defined below:
skipping to change at page 7, line 34 skipping to change at page 7, line 28
o h: for the cofactor of the group. o h: for the cofactor of the group.
o r: for the order of the subgroup generated by G. o r: for the order of the subgroup generated by G.
The function P(p) converts a curve point p into an integer The function P(p) converts a curve point p into an integer
representing point p, by computing x * 2 + (y mod 2), where (x, y) representing point p, by computing x * 2 + (y mod 2), where (x, y)
are the coordinates of point p. P'(z) is the inverse of function P, are the coordinates of point p. P'(z) is the inverse of function P,
that is, it converts an integer z to a point p that satisfies P(p) = that is, it converts an integer z to a point p that satisfies P(p) =
z. If such p exists, it is uniquely defined. Otherwise, z does not z. If such p exists, it is uniquely defined. Otherwise, z does not
represent a valid curve point. The operator + indicates the represent a valid curve point.
elliptic-curve group operation, and the operation [x] * p denotes an
integer-multiplication of point p: it calculates p + p + ... (x The operator + indicates the elliptic-curve group operation, and the
times) ... + p. See the literature on elliptic-curve cryptography operation [x] * p denotes an integer-multiplication of point p: it
for the exact algorithms used for those functions (e.g. Section 3 of calculates p + p + ... (x times) ... + p. See the literature on
[RFC6090], which uses different notations, though.) 0_E represents elliptic-curve cryptography for the exact algorithms used for those
the infinity point. The equation (x / y mod z) denotes a natural functions (e.g. Section 3 of [RFC6090], which uses different
number w less than z that satisfies (w * y) mod z = x mod z. notations, though.) 0_E represents the infinity point. The equation
(x / y mod z) denotes a natural number w less than z that satisfies
(w * y) mod z = x mod z.
The function J is defined as The function J is defined as
J(pi) = [pi] * G. J(pi) = [pi] * G.
The value of K_c1 is derived as The value of K_c1 is derived as
K_c1 = P(K_c1'), where K_c1' = [S_c1] * G, K_c1 = P(K_c1'), where K_c1' = [S_c1] * G,
where S_c1 is a random number within range [1, r-1]. The value of where S_c1 is a random number within range [1, r-1]. The value of
skipping to change at page 10, line 44 skipping to change at page 10, line 44
csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf>. csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf>.
[FIPS.186-4.2013] [FIPS.186-4.2013]
National Institute of Standards and Technology, "Digital National Institute of Standards and Technology, "Digital
Signature Standard (DSS)", FIPS PUB 186-4, July 2013, <htt Signature Standard (DSS)", FIPS PUB 186-4, July 2013, <htt
p://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf>. p://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf>.
[I-D.ietf-httpauth-mutual] [I-D.ietf-httpauth-mutual]
Oiwa, Y., Watanabe, H., Takagi, H., Maeda, K., Hayashi, Oiwa, Y., Watanabe, H., Takagi, H., Maeda, K., Hayashi,
T., and Y. Ioku, "Mutual Authentication Protocol for T., and Y. Ioku, "Mutual Authentication Protocol for
HTTP", draft-ietf-httpauth-mutual-05 (work in progress), HTTP", draft-ietf-httpauth-mutual-06 (work in progress),
July 2015. January 2016.
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, March 1997. Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/
RFC2119, March 1997,
<http://www.rfc-editor.org/info/rfc2119>.
[RFC3526] Kivinen, T. and M. Kojo, "More Modular Exponential (MODP) [RFC3526] Kivinen, T. and M. Kojo, "More Modular Exponential (MODP)
Diffie-Hellman groups for Internet Key Exchange (IKE)", Diffie-Hellman groups for Internet Key Exchange (IKE)",
RFC 3526, May 2003. RFC 3526, DOI 10.17487/RFC3526, May 2003,
<http://www.rfc-editor.org/info/rfc3526>.
7.2. Informative References 7.2. Informative References
[ISO.11770-4.2006] [ISO.11770-4.2006]
International Organization for Standardization, International Organization for Standardization,
"Information technology - Security techniques - Key "Information technology - Security techniques - Key
management - Part 4: Mechanisms based on weak secrets", management - Part 4: Mechanisms based on weak secrets",
ISO Standard 11770-4, May 2006. ISO Standard 11770-4, May 2006.
[RFC6090] McGrew, D., Igoe, K., and M. Salter, "Fundamental Elliptic [RFC6090] McGrew, D., Igoe, K., and M. Salter, "Fundamental Elliptic
Curve Cryptography Algorithms", RFC 6090, February 2011. Curve Cryptography Algorithms", RFC 6090, DOI 10.17487/
RFC6090, February 2011,
<http://www.rfc-editor.org/info/rfc6090>.
Appendix A. (Informative) Group Parameters for Discrete-Logarithm Based Appendix A. (Informative) Group Parameters for Discrete-Logarithm Based
Algorithms Algorithms
The MODP group used for the iso-kam3-dl-2048-sha256 algorithm is The MODP group used for the iso-kam3-dl-2048-sha256 algorithm is
defined by the following parameters. defined by the following parameters.
The prime is: The prime is:
q = 0xFFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1 q = 0xFFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1
skipping to change at page 14, line 13 skipping to change at page 14, line 13
| values. | | | | | | | values. | | | | | |
| minimum | 2048 | 4096 | 1 | 1 | | | minimum | 2048 | 4096 | 1 | 1 | |
| allowed S_c1 | | | | | | | allowed S_c1 | | | | | |
+----------------+---------+---------+---------+---------+----------+ +----------------+---------+---------+---------+---------+----------+
(The numbers marked with an * do not include any enclosing quotation (The numbers marked with an * do not include any enclosing quotation
marks.) marks.)
Appendix C. (Informative) Draft Change Log Appendix C. (Informative) Draft Change Log
C.1. Changes in HTTPAUTH-WG revision 03 C.1. Changes in HTTPAUTH-WG revision 04
o Authors address updated.
C.2. Changes in HTTPAUTH-WG revision 03
o IANA registration information added. o IANA registration information added.
C.2. Changes in HTTPAUTH-WG revision 02 C.3. Changes in HTTPAUTH-WG revision 02
o No technical changes: references updated. o No technical changes: references updated.
C.3. Changes in HTTPAUTH-WG revision 01 C.4. Changes in HTTPAUTH-WG revision 01
o Changed behavior on failed generation of K_s1. o Changed behavior on failed generation of K_s1.
o Security considerations updated. o Security considerations updated.
C.4. Changes in HTTPAUTH-WG revision 00 C.5. Changes in HTTPAUTH-WG revision 00
o Added a note on the choice of elliptic curves. o Added a note on the choice of elliptic curves.
C.5. Changes in HTTPAUTH revision 02 C.6. Changes in HTTPAUTH revision 02
o Added nIterPi parameter to adjust to the changes to the core o Added nIterPi parameter to adjust to the changes to the core
draft. draft.
o Added a note on the verification of exchange transaction. o Added a note on the verification of exchange transaction.
C.6. Changes in HTTPAUTH revision 01 C.7. Changes in HTTPAUTH revision 01
o Notation change: integer output of hash function will be notated o Notation change: integer output of hash function will be notated
as INT(H(*)), changed from H(*). as INT(H(*)), changed from H(*).
C.7. Changes in revision 02 C.8. Changes in revision 02
o Implementation hints in appendix changed (number of characters for o Implementation hints in appendix changed (number of characters for
base64-fixed-number does not contain double-quotes). base64-fixed-number does not contain double-quotes).
C.8. Changes in revision 01 C.9. Changes in revision 01
o Parameter names renamed. o Parameter names renamed.
o Some expressions clarified without changing the value. o Some expressions clarified without changing the value.
C.9. Changes in revision 00 C.10. Changes in revision 00
The document is separated from the revision 08 of the core The document is separated from the revision 08 of the core
documentation. documentation.
Authors' Addresses Authors' Addresses
Yutaka Oiwa Yutaka Oiwa
National Institute of Advanced Industrial Science and Technology National Institute of Advanced Industrial Science and Technology
Information Technology Research Institute Information Technology Research Institute
Tsukuba Central 2 Tsukuba Central 1
1-1-1 Umezono 1-1-1 Umezono
Tsukuba-shi, Ibaraki Tsukuba-shi, Ibaraki
JP JP
Email: mutual-auth-contact-ml@aist.go.jp Email: mutual-auth-contact-ml@aist.go.jp
Hajime Watanabe Hajime Watanabe
National Institute of Advanced Industrial Science and Technology National Institute of Advanced Industrial Science and Technology
Information Technology Research Institute Information Technology Research Institute
Tsukuba Central 2 Tsukuba Central 1
1-1-1 Umezono 1-1-1 Umezono
Tsukuba-shi, Ibaraki Tsukuba-shi, Ibaraki
JP JP
Hiromitsu Takagi Hiromitsu Takagi
National Institute of Advanced Industrial Science and Technology National Institute of Advanced Industrial Science and Technology
Information Technology Research Institute Information Technology Research Institute
Tsukuba Central 2 Tsukuba Central 1
1-1-1 Umezono 1-1-1 Umezono
Tsukuba-shi, Ibaraki Tsukuba-shi, Ibaraki
JP JP
Kaoru Maeda Kaoru Maeda
Lepidum Co. Ltd. Lepidum Co. Ltd.
#602, Village Sasazuka 3 #602, Village Sasazuka 3
1-30-3 Sasazuka 1-30-3 Sasazuka
Shibuya-ku, Tokyo Shibuya-ku, Tokyo
JP JP
 End of changes. 25 change blocks. 
44 lines changed or deleted 52 lines changed or added

This html diff was produced by rfcdiff 1.42. The latest version is available from http://tools.ietf.org/tools/rfcdiff/