Skip to main content


The information below is for an old version of the document.
Document Type
This is an older version of an Internet-Draft whose latest revision state is "Active".
Authors Watson Ladd , Benjamin Kaduk
Last updated 2017-10-16
Replaces draft-ladd-spake2
RFC stream Internet Research Task Force (IRTF)
IETF conflict review conflict-review-irtf-cfrg-spake2, conflict-review-irtf-cfrg-spake2, conflict-review-irtf-cfrg-spake2, conflict-review-irtf-cfrg-spake2, conflict-review-irtf-cfrg-spake2, conflict-review-irtf-cfrg-spake2
Additional resources Mailing list discussion
Stream IRTF state Active RG Document
Consensus boilerplate Unknown
Document shepherd (None)
IESG IESG state I-D Exists
Telechat date (None)
Responsible AD (None)
Send notices to (None)
Network Working Group                                            W. Ladd
Internet-Draft                                               UC Berkeley
Intended status: Informational                             B. Kaduk, Ed.
Expires: April 19, 2018                                           Akamai
                                                        October 16, 2017

                             SPAKE2, a PAKE


   This Internet-Draft describes SPAKE2, a secure, efficient password
   based key exchange protocol.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on April 19, 2018.

Copyright Notice

   Copyright (c) 2017 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
   ( in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Ladd & Kaduk             Expires April 19, 2018                 [Page 1]
Internet-Draft               SPAKE2, a PAKE                 October 2017

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Definition of SPAKE2  . . . . . . . . . . . . . . . . . . . .   2
   3.  Table of points for common groups . . . . . . . . . . . . . .   3
   4.  Security Considerations . . . . . . . . . . . . . . . . . . .   5
   5.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   6
   6.  Acknowledgments . . . . . . . . . . . . . . . . . . . . . . .   6
   7.  References  . . . . . . . . . . . . . . . . . . . . . . . . .   6
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   7

1.  Introduction

   This document describes a means for two parties that share a password
   to derive a shared key.  This method is compatible with any group, is
   computationally efficient, and has a strong security proof.

2.  Definition of SPAKE2

2.1.  Setup

   Let G be a group in which the Diffie-Hellman problem is hard of order
   ph, with p a big prime and h a cofactor.  We denote the operations in
   the group additively.  Let H be a hash function from arbitrary
   strings to bit strings of a fixed length.  Common choices for H are
   SHA256 or SHA512.  We assume there is a representation of elements of
   G as byte strings: common choices would be SEC1 uncompressed [SEC1]
   for elliptic curve groups or big endian integers of a particular
   length for prime field DH.

   || denotes concatenation of strings.  We also let len(S) denote the
   length of a string in bytes, represented as an eight-byte little-
   endian number.

   We fix two elements M and N as defined in the table in this document
   for common groups, as well as a generator G of the group.  G is
   specified in the document defining the group, and so we do not recall
   it here.

   Let A and B be two parties.  We will assume that A and B are also
   representations of the parties such as MAC addresses or other names
   (hostnames, usernames, etc).  We assume they share an integer w.
   Typically w will be the hash of a user-supplied password, truncated
   and taken mod p.  Protocols using this protocol must define the
   method used to compute w: it may be necessary to carry out
   normalization.  The hashing algorithm SHOULD be designed to slow down
   brute force attackers.

Ladd & Kaduk             Expires April 19, 2018                 [Page 2]
Internet-Draft               SPAKE2, a PAKE                 October 2017

   We present two protocols below.  Note that it is insecure to use the
   same password with both protocols, this MUST NOT be done.

2.2.  SPAKE2

   A picks x randomly and uniformly from the integers in [0,ph)
   divisible by h, and calculates X=xG and T=wM+X, then transmits T to

   B selects y randomly and uniformly from the integers in [0,ph),
   divisible by h and calculates Y=yG, S=wN+Y, then transmits S to A.

   Both A and B calculate a group element K.  A calculates it as
   x(S-wN), while B calculates it as y(T-wM).  A knows S because it has
   received it, and likewise B knows T.

   This K is a shared secret, but the scheme as described is not secure.
   K MUST be combined with the values transmitted and received via a
   hash function to have a secure protocol.  If higher-level protocols
   prescribe a method for doing so, that SHOULD be used.  Otherwise we
   can compute K' as H(len(A)||A||len(B)||B||len(S)||S||
   len(T)||T||len(K)||K || len(w) || w) and use K' as the key.

2.3.  SPAKE2+

   This protocol and security proof appear in [TDH].  We use the same
   setup as for SPAKE2, except that we have two secrets, w0 and w1.  The
   server, here Bob, stores L=w1*g and w0.

   When executing SPAKE2+, A selects x uniformly at random from the
   numbers in the range [0, ph) divisible by h, and lets X=xG+w0*M, then
   transmits X to B.  B selects y uniformly at random from the numbers
   in [0, ph) divisible by h, then computes Y=yG+w0*N, and transmits it
   to Alice.

   A computes Z as x(Y-w0*N), and V as w1(Y-w0*N).  B computes Z as y(X-
   w0*M) and V as yL.  Both share Z and V as common keys.  It is
   essential that both Z and V be used in combination with the
   transcript to derive the keying material.  For higher-level protocols
   without sufficient transcript hashing, let K' be
   and use K' as the established key.

3.  Table of points for common groups

   Every curve presented in the table below has an OID from [RFC5480].
   We construct a string using the OID and the needed constant, for
   instance " point generation seed (M)" for P-512.  This

Ladd & Kaduk             Expires April 19, 2018                 [Page 3]
Internet-Draft               SPAKE2, a PAKE                 October 2017

   string is turned into an infinite sequence of bytes by hashing with
   SHA256, and hashing that output again to generate the next 32 bytes,
   and so on.  This pattern is repeated for each group and value, with
   the string modified appropriately.

   The initial segment of bytes of length equal to that of an encoded
   group element is taken, and is then formatted as required for the
   group.  In the case of Weierstrass points, this means setting the
   first byte to 0x02 or 0x03 depending on the low-order bit.  For
   Ed25519 style formats this means taking all the bytes as the
   representation of the group element.  This string of bytes is then
   interpreted as a point in the group.  If this is impossible, then the
   next non-overlapping segment of sufficient length is taken.  We
   multiply that point by the cofactor h, and if that is not the
   identity, output it.

   These bytestrings are compressed points as in [SEC1] for curves from

   For P256:

   M =

   N =

   For P384:

   M =

   N =

   For P521:

   M =

   N =

   The following python snippet generates the above points:

Ladd & Kaduk             Expires April 19, 2018                 [Page 4]
Internet-Draft               SPAKE2, a PAKE                 October 2017

def canon_pointstr(self, s):
    return chr(ord(s[0]) & 1 | 2) + s[1:]

def iterated_hash(seed, n):
    h = seed
    for i in xrange(n):
        h =
    return h

def bighash(seed, start, sz):
    n = -(-sz // 32)
    hashes = [iterated_hash(seed, i) for i in xrange(start, start + n)]
    return ''.join(hashes)[:sz]

def gen_point(seed, ec, order):
    for i in xrange(1, 1000):
        pointstr = ec.canon_pointstr(bighash(seed, i, ec.nbytes_point()))
            p = ec.decode_point(pointstr)
            if ec.mul(p, order) == ec.identity():
                return pointstr, i
        except Exception:

4.  Security Considerations

   A security proof of SPAKE2 for prime order groups is found in [REF].
   Note that the choice of M and N is critical for the security proof.
   The generation method specified in this document is designed to
   eliminate concerns related to knowing discrete logs of M and N.

   SPAKE2+ appears in [TDH], along with proof.

   There is no key-confirmation as this is a one round protocol.  It is
   expected that a protocol using this key exchange mechanism provides
   key confirmation separately if desired.

   Elements should be checked for group membership: failure to properly
   validate group elements can lead to attacks.  In particular it is
   essential to verify that received points are valid compressions of
   points on an elliptic curve when using elliptic curves.  It is not
   necessary to validate membership in the prime order subgroup: the
   multiplication by cofactors eliminates this issue.

   The choices of random numbers MUST BE uniform.  Note that to pick a
   random multiple of h in [0, ph) one can pick a random integer in
   [0,p) and multiply by h.  Reuse of ephemerals results in dictionary
   attacks and MUST NOT be done.

Ladd & Kaduk             Expires April 19, 2018                 [Page 5]
Internet-Draft               SPAKE2, a PAKE                 October 2017

   SPAKE2 does not support augmentation.  As a result, the server has to
   store a password equivalent.  This is considered a significant
   drawback, and so SPAKE2+ also appears in this document.

   As specified the shared secret K is not suitable for use as a shared
   key.  It MUST be passed to a hash function along with the public
   values used to derive it and the party identities to avoid attacks.
   In protocols which do not perform this separately, the value denoted
   K' MUST be used instead.

5.  IANA Considerations

   No IANA action is required.

6.  Acknowledgments

   Special thanks to Nathaniel McCallum for generation of test vectors.
   Thanks to Mike Hamburg for advice on how to deal with cofactors.
   Greg Hudson suggested addition of warnings on the reuse of x and y.
   Thanks to Fedor Brunner, Adam Langley, and the members of the CFRG
   for comments and advice.  Trevor Perrin informed me of SPAKE2+.

7.  References

   [REF]      Abdalla, M. and D. Pointcheval, "Simple Password-Based
              Encrypted Key Exchange Protocols.", Feb 2005.

              Appears in A.  Menezes, editor.  Topics in Cryptography-
              CT-RSA 2005, Volume 3376 of Lecture Notes in Computer
              Science, pages 191-208, San Francisco, CA, US.  Springer-
              Verlag, Berlin, Germany.

   [RFC5480]  Turner, S., Brown, D., Yiu, K., Housley, R., and T. Polk,
              "Elliptic Curve Cryptography Subject Public Key
              Information", RFC 5480, DOI 10.17487/RFC5480, March 2009,

              Elliptic Curve Cryptography", version 2.0", May 2009.

   [TDH]      Cash, D., Kiltz, E., and V. Shoup, "The Twin-Diffie
              Hellman Problem and Applications", 2008.

              EUROCRYPT 2008.  Volume 4965 of Lecture notes in Computer
              Science, pages 127-145.  Springer-Verlag, Berlin, Germany.

Ladd & Kaduk             Expires April 19, 2018                 [Page 6]
Internet-Draft               SPAKE2, a PAKE                 October 2017

Authors' Addresses

   Watson Ladd
   UC Berkeley


   Benjamin Kaduk (editor)
   Akamai Technologies


Ladd & Kaduk             Expires April 19, 2018                 [Page 7]