react-native-queue-player 1.0.0

package/android/src/main/cpp/third_party/curve25519/source/ed25519_verify.c

@@ -0,0 +1,313 @@
+/* The MIT License (MIT)
+ * 
+ * Copyright (c) 2015 mehdi sotoodeh
+ * 
+ * Permission is hereby granted, free of charge, to any person obtaining 
+ * a copy of this software and associated documentation files (the 
+ * "Software"), to deal in the Software without restriction, including 
+ * without limitation the rights to use, copy, modify, merge, publish, 
+ * distribute, sublicense, and/or sell copies of the Software, and to 
+ * permit persons to whom the Software is furnished to do so, subject to 
+ * the following conditions:
+ * 
+ * The above copyright notice and this permission notice shall be included 
+ * in all copies or substantial portions of the Software.
+ * 
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS 
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 
+ * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY 
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, 
+ * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE 
+ * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ */
+
+#include "../include/external_calls.h"
+#include "curve25519_mehdi.h"
+#include "../include/ed25519_signature.h"
+#include "sha512.h"
+
+/*
+ * Arithmetic on twisted Edwards curve y^2 - x^2 = 1 + dx^2y^2
+ * with d = -(121665/121666) mod p
+ *      d = 0x52036CEE2B6FFE738CC740797779E89800700A4D4141D8AB75EB4DCA135978A3
+ *      p = 2**255 - 19
+ *      p = 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFED
+ * Base point: y=4/5 mod p
+ *      x = 0x216936D3CD6E53FEC0A4E231FDD6DC5C692CC7609525A7B2C9562D608F25D51A
+ *      y = 0x6666666666666666666666666666666666666666666666666666666666666658
+ * Base point order:
+ *      l = 2**252 + 27742317777372353535851937790883648493
+ *      l = 0x1000000000000000000000000000000014DEF9DEA2F79CD65812631A5CF5D3ED
+ */
+
+typedef struct {
+    unsigned char pk[32];
+    PE_POINT q_table[16];
+} EDP_SIGV_CTX;
+
+extern const U_WORD _w_P[K_WORDS];
+extern const U_WORD _w_di[K_WORDS];
+
+extern const PA_POINT _w_base_folding8[256];
+extern const U_WORD _w_NxBPO[16][K_WORDS];
+
+#define _w_BPO _w_NxBPO[1]
+
+#define _w_Zero     _w_base_folding8[0].T2d
+#define _w_One      _w_base_folding8[0].YpX
+
+const U_WORD _w_I[K_WORDS] = /* sqrt(-1) */
+    W256(0x4A0EA0B0,0xC4EE1B27,0xAD2FE478,0x2F431806,0x3DFBD7A7,0x2B4D0099,0x4FC1DF0B,0x2B832480);
+
+static const U_WORD _w_d[K_WORDS] =
+    W256(0x135978A3,0x75EB4DCA,0x4141D8AB,0x00700A4D,0x7779E898,0x8CC74079,0x2B6FFE73,0x52036CEE);
+
+void ed25519_CalculateX(OUT U_WORD *X, IN const U_WORD *Y, U_WORD parity)
+{
+    U_WORD u[K_WORDS], v[K_WORDS], a[K_WORDS], b[K_WORDS];
+
+    /* Calculate sqrt((y^2 - 1)/(d*y^2 + 1)) */
+
+    ecp_SqrReduce(u, Y);            /* u = y^2 */
+    ecp_MulReduce(v, u, _w_d);      /* v = dy^2 */
+    ecp_SubReduce(u, u, _w_One);    /* u = y^2-1 */
+    ecp_AddReduce(v, v, _w_One);    /* v = dy^2+1 */
+
+    /* Calculate:  sqrt(u/v) = u*v^3 * (u*v^7)^((p-5)/8) */
+
+    ecp_SqrReduce(b, v);
+    ecp_MulReduce(a, u, b);
+    ecp_MulReduce(a, a, v);         /* a = u*v^3 */
+    ecp_SqrReduce(b, b);            /* b = v^4 */
+    ecp_MulReduce(b, a, b);         /* b = u*v^7 */
+    ecp_ModExp2523(b, b);
+    ecp_MulReduce(X, b, a);
+
+    /* Check if we have correct sqrt, else, multiply by sqrt(-1) */
+
+    ecp_SqrReduce(b, X);
+    ecp_MulReduce(b, b, v);
+    ecp_SubReduce(b, b, u);
+    ecp_Mod(b);
+    if (ecp_CmpNE(b, _w_Zero)) ecp_MulReduce(X, X, _w_I);
+
+    while (ecp_CmpLT(X, _w_P) == 0) ecp_Sub(X, X, _w_P);
+
+    /* match parity */
+    if (((X[0] ^ parity) & 1) != 0)
+        ecp_Sub(X, _w_P, X);
+}
+
+void ed25519_UnpackPoint(Affine_POINT *r, const unsigned char *p)
+{
+    U8 parity = ecp_DecodeInt(r->y, p);
+    ed25519_CalculateX(r->x, r->y, parity);
+}
+
+void ecp_SrqMulReduce(U_WORD *Z, const U_WORD *X, int n, const U_WORD *Y)
+{
+    U_WORD t[K_WORDS];
+    ecp_SqrReduce(t, X);
+    while (n-- > 1) ecp_SqrReduce(t, t);
+    ecp_MulReduce(Z, t, Y);
+}
+
+void ecp_ModExp2523(U_WORD *Y, const U_WORD *X)
+{
+    U_WORD x2[K_WORDS], x9[K_WORDS], x11[K_WORDS], x5[K_WORDS], x10[K_WORDS];
+    U_WORD x20[K_WORDS], x50[K_WORDS], x100[K_WORDS], t[K_WORDS];
+
+    ecp_SqrReduce(x2, X);                       /* 2 */
+    ecp_SrqMulReduce(x9, x2, 2, X);             /* 9 */
+    ecp_MulReduce(x11, x9, x2);                 /* 11 */
+    ecp_SqrReduce(t, x11);                      /* 22 */
+    ecp_MulReduce(x5, t, x9);                   /* 31 = 2^5 - 2^0 */
+    ecp_SrqMulReduce(x10, x5, 5, x5);           /* 2^10 - 2^0 */
+    ecp_SrqMulReduce(x20, x10, 10, x10);        /* 2^20 - 2^0 */
+    ecp_SrqMulReduce(t, x20, 20, x20);          /* 2^40 - 2^0 */
+    ecp_SrqMulReduce(x50, t, 10, x10);          /* 2^50 - 2^0 */
+    ecp_SrqMulReduce(x100, x50, 50, x50);       /* 2^100 - 2^0 */
+    ecp_SrqMulReduce(t, x100, 100, x100);       /* 2^200 - 2^0 */
+    ecp_SrqMulReduce(t, t, 50, x50);            /* 2^250 - 2^0 */
+    ecp_SqrReduce(t, t); ecp_SqrReduce(t, t);   /* 2^252 - 2^2 */
+    ecp_MulReduce(Y, t, X);                     /* 2^252 - 3 */
+}
+
+/*
+    Assumptions: pre-computed q
+    Cost: 8M + 6add
+    Return: P = P + Q
+*/
+void edp_AddPoint(Ext_POINT *r, const Ext_POINT *p, const PE_POINT *q)
+{
+    U_WORD a[K_WORDS], b[K_WORDS], c[K_WORDS], d[K_WORDS], e[K_WORDS];
+
+    ecp_SubReduce(a, p->y, p->x);           /* A = (Y1-X1)*(Y2-X2) */
+    ecp_MulReduce(a, a, q->YmX);
+    ecp_AddReduce(b, p->y, p->x);           /* B = (Y1+X1)*(Y2+X2) */
+    ecp_MulReduce(b, b, q->YpX);
+    ecp_MulReduce(c, p->t, q->T2d);         /* C = T1*2d*T2 */
+    ecp_MulReduce(d, p->z, q->Z2);          /* D = Z1*2*Z2 */
+    ecp_SubReduce(e, b, a);                 /* E = B-A */
+    ecp_AddReduce(b, b, a);                 /* H = B+A */
+    ecp_SubReduce(a, d, c);                 /* F = D-C */
+    ecp_AddReduce(d, d, c);                 /* G = D+C */
+
+    ecp_MulReduce(r->x, e, a);              /* E*F */
+    ecp_MulReduce(r->y, b, d);              /* H*G */
+    ecp_MulReduce(r->t, e, b);              /* E*H */
+    ecp_MulReduce(r->z, d, a);              /* G*F */
+}
+
+int ed25519_VerifySignature(
+    const unsigned char *signature,             /* IN: signature (R,S) */
+    const unsigned char *publicKey,             /* IN: public key */
+    const unsigned char *msg, size_t msg_size)  /* IN: message to sign */
+{
+    EDP_SIGV_CTX ctx;
+
+    ed25519_Verify_Init(&ctx, publicKey);
+
+    return ed25519_Verify_Check(&ctx, signature, msg, msg_size);
+}
+
+#define QTABLE_SET(d,s) \
+    edp_AddPoint(&T, &Q, &ctx->q_table[s]); \
+    edp_ExtPoint2PE(&ctx->q_table[d], &T)
+
+void * ed25519_Verify_Init(
+    void *context,                      /* IO: null or context buffer to use */
+    const unsigned char *publicKey)     /* IN: [32 bytes] public key */
+{
+    int i;
+    Ext_POINT Q, T;
+    EDP_SIGV_CTX *ctx = (EDP_SIGV_CTX*)context;
+
+    if (ctx == 0) ctx = (EDP_SIGV_CTX*)mem_alloc(sizeof(EDP_SIGV_CTX));
+
+    if (ctx)
+    {
+        memcpy(ctx->pk, publicKey, 32);
+        i = ecp_DecodeInt(Q.y, publicKey);
+        ed25519_CalculateX(Q.x, Q.y, ~i);       /* Invert parity for -Q */
+        ecp_MulMod(Q.t, Q.x, Q.y);
+        ecp_SetValue(Q.z, 1);
+
+        /* pre-compute q-table */
+
+        /* Calculate: Q0=Q, Q1=(2^64)*Q, Q2=(2^128)*Q, Q3=(2^192)*Q */
+
+        ecp_SetValue(ctx->q_table[0].YpX, 1);           /* -- -- -- -- */
+        ecp_SetValue(ctx->q_table[0].YmX, 1);
+        ecp_SetValue(ctx->q_table[0].T2d, 0);
+        ecp_SetValue(ctx->q_table[0].Z2, 2);
+
+        edp_ExtPoint2PE(&ctx->q_table[1], &Q);          /* -- -- -- q0 */
+
+        for (i = 0; i < 64; i++) edp_DoublePoint(&Q);
+
+        edp_ExtPoint2PE(&ctx->q_table[2], &Q);          /* -- -- q1 -- */
+        QTABLE_SET(3,1);                                /* -- -- q1 q0 */
+
+        do edp_DoublePoint(&Q); while (++i < 128);
+
+        edp_ExtPoint2PE(&ctx->q_table[4], &Q);          /* -- q2 -- -- */
+        QTABLE_SET(5, 1);                               /* -- q2 -- q0 */
+        QTABLE_SET(6, 2);                               /* -- q2 q1 -- */
+        QTABLE_SET(7, 3);                               /* -- q2 q1 q0 */
+
+        do edp_DoublePoint(&Q); while (++i < 192);
+
+        edp_ExtPoint2PE(&ctx->q_table[8], &Q);          /* q3 -- -- -- */
+        QTABLE_SET(9, 1);                               /* q3 -- -- q0 */
+        QTABLE_SET(10, 2);                              /* q3 -- q1 -- */
+        QTABLE_SET(11, 3);                              /* q3 -- q1 q0 */
+        QTABLE_SET(12, 4);                              /* q3 q2 -- -- */
+        QTABLE_SET(13, 5);                              /* q3 q2 -- q0 */
+        QTABLE_SET(14, 6);                              /* q3 q2 q1 -- */
+        QTABLE_SET(15, 7);                              /* q3 q2 q1 q0 */
+    }
+    return ctx;
+}
+
+void ed25519_Verify_Finish(void *ctx)
+{
+    mem_free(ctx);
+}
+
+/*
+    Assumptions: qtable = pre-computed Q
+    Calculate: point R = a*P + b*Q  where P is base point
+*/
+static void edp_PolyPointMultiply(
+    Affine_POINT *r, 
+    const U_WORD *a, 
+    const U_WORD *b, 
+    const PE_POINT *qtable)
+{
+    int i = 1;
+    Ext_POINT S;
+    const PE_POINT *q0;
+    U8 u[32], v[64];
+
+    ecp_8Folds(u, a);
+    ecp_4Folds(v, b);
+
+    /* Set initial value of S */
+    q0 = &qtable[v[0]];
+    ecp_SubReduce(S.x, q0->YpX, q0->YmX);   /* 2x */
+    ecp_AddReduce(S.y, q0->YpX, q0->YmX);   /* 2y */
+    ecp_MulReduce(S.t, q0->T2d, _w_di);     /* 2xy */
+    ecp_Copy(S.z, q0->Z2);                  /* 2z */
+
+    do
+    {   /* 31D + 31A */
+        edp_DoublePoint(&S);
+        edp_AddPoint(&S, &S, &qtable[v[i]]);
+    } while (++i < 32);
+
+    do
+    {   /* 32D + 64A */
+        edp_DoublePoint(&S);
+        edp_AddAffinePoint(&S, &_w_base_folding8[u[i-32]]);
+        edp_AddPoint(&S, &S, &qtable[v[i]]);
+    } while (++i < 64);
+
+    ecp_Inverse(S.z, S.z);
+    ecp_MulMod(r->x, S.x, S.z);
+    ecp_MulMod(r->y, S.y, S.z);
+}
+
+/*
+    This function can be used for batch verification.
+    Assumptions: context = ed25519_Verify_Init(pk)
+
+*/
+int ed25519_Verify_Check(
+    const void  *context,                       /* IN: precomputes */
+    const unsigned char *signature,             /* IN: signature (R,S) */
+    const unsigned char *msg, size_t msg_size)  /* IN: message to sign */
+{
+    SHA512_CTX H;
+    Affine_POINT T;
+    U_WORD h[K_WORDS], s[K_WORDS];
+    U8 md[SHA512_DIGEST_LENGTH];
+
+    /* h = H(enc(R) + pk + m)  mod BPO */
+    SHA512_Init(&H);
+    SHA512_Update(&H, signature, 32);       /* enc(R) */
+    SHA512_Update(&H, ((EDP_SIGV_CTX*)context)->pk, 32);
+    SHA512_Update(&H, msg, msg_size);
+    SHA512_Final(md, &H);
+    eco_DigestToWords(h, md);
+    eco_Mod(h);
+
+    /* T = s*P + h*(-Q) = (s - h*a)*P = r*P = R */
+
+    ecp_BytesToWords(s, signature+32);
+    edp_PolyPointMultiply(&T, s, h, ((EDP_SIGV_CTX*)context)->q_table);
+    ed25519_PackPoint(md, T.y, T.x[0]);
+
+    return (memcmp(md, signature, 32) == 0) ? 1 : 0;
+}

package/android/src/main/cpp/third_party/curve25519/source/sha512.c

@@ -0,0 +1,294 @@
+/* crypto/sha/sha512.c */
+/* ====================================================================
+ * Copyright (c) 2004 The OpenSSL Project.  All rights reserved
+ * according to the OpenSSL license [found in ../../LICENSE].
+ * ====================================================================
+ */
+/*
+ * IMPLEMENTATION NOTES.
+ *
+ * As you might have noticed 32-bit hash algorithms:
+ *
+ * - permit SHA_LONG to be wider than 32-bit (case on CRAY);
+ * - optimized versions implement two transform functions: one operating
+ *   on [aligned] data in host byte order and one - on data in input
+ *   stream byte order;
+ * - share common byte-order neutral collector and padding function
+ *   implementations, ../md32_common.h;
+ *
+ * Neither of the above applies to this SHA-512 implementations. Reasons
+ * [in reverse order] are:
+ *
+ * - it's the only 64-bit hash algorithm for the moment of this writing,
+ *   there is no need for common collector/padding implementation [yet];
+ * - by supporting only one transform function [which operates on
+ *   *aligned* data in input stream byte order, big-endian in this case]
+ *   we minimize burden of maintenance in two ways: a) collector/padding
+ *   function is simpler; b) only one transform function to stare at;
+ * - SHA_LONG64 is required to be exactly 64-bit in order to be able to
+ *   apply a number of optimizations to mitigate potential performance
+ *   penalties caused by previous design decision;
+ *
+ * Caveat lector.
+ *
+ * Implementation relies on the fact that "long long" is 64-bit on
+ * both 32- and 64-bit platforms. If some compiler vendor comes up
+ * with 128-bit long long, adjustment to sha.h would be required.
+ * As this implementation relies on 64-bit integer type, it's totally
+ * inappropriate for platforms which don't support it, most notably
+ * 16-bit platforms.
+ *                  <appro@fy.chalmers.se>
+ */
+#include <string.h>
+#include "../include/external_calls.h"
+#include "sha512.h"
+
+#define UINT64(X)   X##ULL
+
+void SHA512_Transform (SHA512_CTX *ctx, const void *in);
+
+void SHA512_Init (SHA512_CTX *c)
+{
+    c->h[0]=UINT64(0x6a09e667f3bcc908);
+    c->h[1]=UINT64(0xbb67ae8584caa73b);
+    c->h[2]=UINT64(0x3c6ef372fe94f82b);
+    c->h[3]=UINT64(0xa54ff53a5f1d36f1);
+    c->h[4]=UINT64(0x510e527fade682d1);
+    c->h[5]=UINT64(0x9b05688c2b3e6c1f);
+    c->h[6]=UINT64(0x1f83d9abfb41bd6b);
+    c->h[7]=UINT64(0x5be0cd19137e2179);
+
+    c->Nl=0;
+    c->Nh=0;
+    c->num=0;
+    c->md_len=SHA512_DIGEST_LENGTH;
+}
+
+void SHA512_Final (unsigned char *md, SHA512_CTX *c)
+{
+    unsigned char *p=(unsigned char *)c->u.p;
+    size_t n=c->num;
+
+    p[n]=0x80;  /* There always is a room for one */
+    n++;
+    if (n > (SHA512_CBLOCK-16))
+        mem_fill (p+n,0,SHA512_CBLOCK-n), n=0,
+        SHA512_Transform (c,p);
+
+    mem_fill (p+n,0,SHA512_CBLOCK-16-n);
+#if __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
+    c->u.d[SHA512_LBLOCK-2] = c->Nh;
+    c->u.d[SHA512_LBLOCK-1] = c->Nl;
+#else
+    p[SHA512_CBLOCK-1]  = (unsigned char)(c->Nl);
+    p[SHA512_CBLOCK-2]  = (unsigned char)(c->Nl>>8);
+    p[SHA512_CBLOCK-3]  = (unsigned char)(c->Nl>>16);
+    p[SHA512_CBLOCK-4]  = (unsigned char)(c->Nl>>24);
+    p[SHA512_CBLOCK-5]  = (unsigned char)(c->Nl>>32);
+    p[SHA512_CBLOCK-6]  = (unsigned char)(c->Nl>>40);
+    p[SHA512_CBLOCK-7]  = (unsigned char)(c->Nl>>48);
+    p[SHA512_CBLOCK-8]  = (unsigned char)(c->Nl>>56);
+    p[SHA512_CBLOCK-9]  = (unsigned char)(c->Nh);
+    p[SHA512_CBLOCK-10] = (unsigned char)(c->Nh>>8);
+    p[SHA512_CBLOCK-11] = (unsigned char)(c->Nh>>16);
+    p[SHA512_CBLOCK-12] = (unsigned char)(c->Nh>>24);
+    p[SHA512_CBLOCK-13] = (unsigned char)(c->Nh>>32);
+    p[SHA512_CBLOCK-14] = (unsigned char)(c->Nh>>40);
+    p[SHA512_CBLOCK-15] = (unsigned char)(c->Nh>>48);
+    p[SHA512_CBLOCK-16] = (unsigned char)(c->Nh>>56);
+#endif
+
+    SHA512_Transform (c,p);
+
+    if (md) for (n=0; n < SHA512_DIGEST_LENGTH/8; n++)
+    {
+        M64 m;
+        m.u64 = c->h[n];
+        *(md++) = m.u8.b7;
+        *(md++) = m.u8.b6;
+        *(md++) = m.u8.b5;
+        *(md++) = m.u8.b4;
+        *(md++) = m.u8.b3;
+        *(md++) = m.u8.b2;
+        *(md++) = m.u8.b1;
+        *(md++) = m.u8.b0;
+    }
+}
+
+void SHA512_Update (SHA512_CTX *c, const void *_data, size_t len)
+{
+    SHA_LONG64 l;
+    unsigned char *p=c->u.p;
+    const unsigned char *data=(const unsigned char *)_data;
+
+    if (len==0) return;
+
+    l = (c->Nl+(((SHA_LONG64)len)<<3))&UINT64(0xffffffffffffffff);
+    if (l < c->Nl) c->Nh++;
+    if (sizeof(len)>=8) c->Nh+=(((SHA_LONG64)len)>>61);
+    c->Nl=l;
+
+    if (c->num != 0)
+    {
+        size_t n = SHA512_CBLOCK - c->num;
+
+        if (len < n)
+        {
+            memcpy (p+c->num,data,len), c->num += (unsigned int)len;
+            return;
+        }
+        else    
+        {
+            memcpy (p+c->num,data,n), c->num = 0;
+            len-=n, data+=n;
+            SHA512_Transform (c,p);
+        }
+    }
+
+    while (len >= SHA512_CBLOCK)
+    {
+        SHA512_Transform (c,data);//,len/SHA512_CBLOCK),
+        data += SHA512_CBLOCK;
+        len  -= SHA512_CBLOCK;
+    }
+
+    if (len != 0)
+        memcpy (p,data,len), c->num = (int)len;
+}
+
+static const SHA_LONG64 K512[80] = 
+{
+    UINT64(0x428a2f98d728ae22),UINT64(0x7137449123ef65cd),
+    UINT64(0xb5c0fbcfec4d3b2f),UINT64(0xe9b5dba58189dbbc),
+    UINT64(0x3956c25bf348b538),UINT64(0x59f111f1b605d019),
+    UINT64(0x923f82a4af194f9b),UINT64(0xab1c5ed5da6d8118),
+    UINT64(0xd807aa98a3030242),UINT64(0x12835b0145706fbe),
+    UINT64(0x243185be4ee4b28c),UINT64(0x550c7dc3d5ffb4e2),
+    UINT64(0x72be5d74f27b896f),UINT64(0x80deb1fe3b1696b1),
+    UINT64(0x9bdc06a725c71235),UINT64(0xc19bf174cf692694),
+    UINT64(0xe49b69c19ef14ad2),UINT64(0xefbe4786384f25e3),
+    UINT64(0x0fc19dc68b8cd5b5),UINT64(0x240ca1cc77ac9c65),
+    UINT64(0x2de92c6f592b0275),UINT64(0x4a7484aa6ea6e483),
+    UINT64(0x5cb0a9dcbd41fbd4),UINT64(0x76f988da831153b5),
+    UINT64(0x983e5152ee66dfab),UINT64(0xa831c66d2db43210),
+    UINT64(0xb00327c898fb213f),UINT64(0xbf597fc7beef0ee4),
+    UINT64(0xc6e00bf33da88fc2),UINT64(0xd5a79147930aa725),
+    UINT64(0x06ca6351e003826f),UINT64(0x142929670a0e6e70),
+    UINT64(0x27b70a8546d22ffc),UINT64(0x2e1b21385c26c926),
+    UINT64(0x4d2c6dfc5ac42aed),UINT64(0x53380d139d95b3df),
+    UINT64(0x650a73548baf63de),UINT64(0x766a0abb3c77b2a8),
+    UINT64(0x81c2c92e47edaee6),UINT64(0x92722c851482353b),
+    UINT64(0xa2bfe8a14cf10364),UINT64(0xa81a664bbc423001),
+    UINT64(0xc24b8b70d0f89791),UINT64(0xc76c51a30654be30),
+    UINT64(0xd192e819d6ef5218),UINT64(0xd69906245565a910),
+    UINT64(0xf40e35855771202a),UINT64(0x106aa07032bbd1b8),
+    UINT64(0x19a4c116b8d2d0c8),UINT64(0x1e376c085141ab53),
+    UINT64(0x2748774cdf8eeb99),UINT64(0x34b0bcb5e19b48a8),
+    UINT64(0x391c0cb3c5c95a63),UINT64(0x4ed8aa4ae3418acb),
+    UINT64(0x5b9cca4f7763e373),UINT64(0x682e6ff3d6b2b8a3),
+    UINT64(0x748f82ee5defb2fc),UINT64(0x78a5636f43172f60),
+    UINT64(0x84c87814a1f0ab72),UINT64(0x8cc702081a6439ec),
+    UINT64(0x90befffa23631e28),UINT64(0xa4506cebde82bde9),
+    UINT64(0xbef9a3f7b2c67915),UINT64(0xc67178f2e372532b),
+    UINT64(0xca273eceea26619c),UINT64(0xd186b8c721c0c207),
+    UINT64(0xeada7dd6cde0eb1e),UINT64(0xf57d4f7fee6ed178),
+    UINT64(0x06f067aa72176fba),UINT64(0x0a637dc5a2c898a6),
+    UINT64(0x113f9804bef90dae),UINT64(0x1b710b35131c471b),
+    UINT64(0x28db77f523047d84),UINT64(0x32caab7b40c72493),
+    UINT64(0x3c9ebe0a15c9bebc),UINT64(0x431d67c49c100d4c),
+    UINT64(0x4cc5d4becb3e42b6),UINT64(0x597f299cfc657e2a),
+    UINT64(0x5fcb6fab3ad6faec),UINT64(0x6c44198c4a475817) 
+};
+
+#define B(x,j)    (((SHA_LONG64)(*(((const unsigned char *)(&x))+j)))<<((7-j)*8))
+#define PULL64(x) (B(x,0)|B(x,1)|B(x,2)|B(x,3)|B(x,4)|B(x,5)|B(x,6)|B(x,7))
+#define ROTR(x,s)   (((x)>>s) | (x)<<(64-s))
+
+#define Sigma0(x)   (ROTR((x),28) ^ ROTR((x),34) ^ ROTR((x),39))
+#define Sigma1(x)   (ROTR((x),14) ^ ROTR((x),18) ^ ROTR((x),41))
+#define sigma0(x)   (ROTR((x),1)  ^ ROTR((x),8)  ^ ((x)>>7))
+#define sigma1(x)   (ROTR((x),19) ^ ROTR((x),61) ^ ((x)>>6))
+
+#define Ch(x,y,z)   (((x) & (y)) ^ ((~(x)) & (z)))
+#define Maj(x,y,z)  (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
+
+#define ROUND_00_15(i,a,b,c,d,e,f,g,h) do { \
+    T1 += h + Sigma1(e) + Ch(e,f,g) + K512[i]; \
+    h = Sigma0(a) + Maj(a,b,c); \
+    d += T1; h += T1; } while (0)
+
+#define ROUND_16_80(i,j,a,b,c,d,e,f,g,h,X) do { \
+    s0 = X[(j+1)&0x0f]; s0 = sigma0(s0); \
+    s1 = X[(j+14)&0x0f]; s1 = sigma1(s1); \
+    T1 = X[(j)&0x0f] += s0 + s1 + X[(j+9)&0x0f]; \
+    ROUND_00_15(i+j,a,b,c,d,e,f,g,h); } while (0)
+
+void SHA512_Transform (SHA512_CTX *ctx, const void *in)
+{
+    const SHA_LONG64 *W = (SHA_LONG64*)in;
+    SHA_LONG64  a,b,c,d,e,f,g,h,s0,s1,T1;
+    SHA_LONG64  X[16];
+    int i;
+
+    a = ctx->h[0];  b = ctx->h[1];  c = ctx->h[2];  d = ctx->h[3];
+    e = ctx->h[4];  f = ctx->h[5];  g = ctx->h[6];  h = ctx->h[7];
+
+#if __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
+    T1 = X[0] = W[0];   ROUND_00_15(0,a,b,c,d,e,f,g,h);
+    T1 = X[1] = W[1];   ROUND_00_15(1,h,a,b,c,d,e,f,g);
+    T1 = X[2] = W[2];   ROUND_00_15(2,g,h,a,b,c,d,e,f);
+    T1 = X[3] = W[3];   ROUND_00_15(3,f,g,h,a,b,c,d,e);
+    T1 = X[4] = W[4];   ROUND_00_15(4,e,f,g,h,a,b,c,d);
+    T1 = X[5] = W[5];   ROUND_00_15(5,d,e,f,g,h,a,b,c);
+    T1 = X[6] = W[6];   ROUND_00_15(6,c,d,e,f,g,h,a,b);
+    T1 = X[7] = W[7];   ROUND_00_15(7,b,c,d,e,f,g,h,a);
+    T1 = X[8] = W[8];   ROUND_00_15(8,a,b,c,d,e,f,g,h);
+    T1 = X[9] = W[9];   ROUND_00_15(9,h,a,b,c,d,e,f,g);
+    T1 = X[10] = W[10]; ROUND_00_15(10,g,h,a,b,c,d,e,f);
+    T1 = X[11] = W[11]; ROUND_00_15(11,f,g,h,a,b,c,d,e);
+    T1 = X[12] = W[12]; ROUND_00_15(12,e,f,g,h,a,b,c,d);
+    T1 = X[13] = W[13]; ROUND_00_15(13,d,e,f,g,h,a,b,c);
+    T1 = X[14] = W[14]; ROUND_00_15(14,c,d,e,f,g,h,a,b);
+    T1 = X[15] = W[15]; ROUND_00_15(15,b,c,d,e,f,g,h,a);
+#else
+    T1 = X[0]  = PULL64(W[0]);  ROUND_00_15(0,a,b,c,d,e,f,g,h);
+    T1 = X[1]  = PULL64(W[1]);  ROUND_00_15(1,h,a,b,c,d,e,f,g);
+    T1 = X[2]  = PULL64(W[2]);  ROUND_00_15(2,g,h,a,b,c,d,e,f);
+    T1 = X[3]  = PULL64(W[3]);  ROUND_00_15(3,f,g,h,a,b,c,d,e);
+    T1 = X[4]  = PULL64(W[4]);  ROUND_00_15(4,e,f,g,h,a,b,c,d);
+    T1 = X[5]  = PULL64(W[5]);  ROUND_00_15(5,d,e,f,g,h,a,b,c);
+    T1 = X[6]  = PULL64(W[6]);  ROUND_00_15(6,c,d,e,f,g,h,a,b);
+    T1 = X[7]  = PULL64(W[7]);  ROUND_00_15(7,b,c,d,e,f,g,h,a);
+    T1 = X[8]  = PULL64(W[8]);  ROUND_00_15(8,a,b,c,d,e,f,g,h);
+    T1 = X[9]  = PULL64(W[9]);  ROUND_00_15(9,h,a,b,c,d,e,f,g);
+    T1 = X[10] = PULL64(W[10]); ROUND_00_15(10,g,h,a,b,c,d,e,f);
+    T1 = X[11] = PULL64(W[11]); ROUND_00_15(11,f,g,h,a,b,c,d,e);
+    T1 = X[12] = PULL64(W[12]); ROUND_00_15(12,e,f,g,h,a,b,c,d);
+    T1 = X[13] = PULL64(W[13]); ROUND_00_15(13,d,e,f,g,h,a,b,c);
+    T1 = X[14] = PULL64(W[14]); ROUND_00_15(14,c,d,e,f,g,h,a,b);
+    T1 = X[15] = PULL64(W[15]); ROUND_00_15(15,b,c,d,e,f,g,h,a);
+#endif
+
+    for (i=16;i<80;i+=16)
+    {
+        ROUND_16_80(i, 0,a,b,c,d,e,f,g,h,X);
+        ROUND_16_80(i, 1,h,a,b,c,d,e,f,g,X);
+        ROUND_16_80(i, 2,g,h,a,b,c,d,e,f,X);
+        ROUND_16_80(i, 3,f,g,h,a,b,c,d,e,X);
+        ROUND_16_80(i, 4,e,f,g,h,a,b,c,d,X);
+        ROUND_16_80(i, 5,d,e,f,g,h,a,b,c,X);
+        ROUND_16_80(i, 6,c,d,e,f,g,h,a,b,X);
+        ROUND_16_80(i, 7,b,c,d,e,f,g,h,a,X);
+        ROUND_16_80(i, 8,a,b,c,d,e,f,g,h,X);
+        ROUND_16_80(i, 9,h,a,b,c,d,e,f,g,X);
+        ROUND_16_80(i,10,g,h,a,b,c,d,e,f,X);
+        ROUND_16_80(i,11,f,g,h,a,b,c,d,e,X);
+        ROUND_16_80(i,12,e,f,g,h,a,b,c,d,X);
+        ROUND_16_80(i,13,d,e,f,g,h,a,b,c,X);
+        ROUND_16_80(i,14,c,d,e,f,g,h,a,b,X);
+        ROUND_16_80(i,15,b,c,d,e,f,g,h,a,X);
+    }
+
+    ctx->h[0] += a; ctx->h[1] += b; ctx->h[2] += c; ctx->h[3] += d;
+    ctx->h[4] += e; ctx->h[5] += f; ctx->h[6] += g; ctx->h[7] += h;
+}

package/android/src/main/cpp/third_party/curve25519/source/sha512.h

@@ -0,0 +1,93 @@
+/* crypto/sha/sha512.h */
+/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
+ * All rights reserved.
+ *
+ * This package is an SSL implementation written
+ * by Eric Young (eay@cryptsoft.com).
+ * The implementation was written so as to conform with Netscapes SSL.
+ * 
+ * This library is free for commercial and non-commercial use as long as
+ * the following conditions are aheared to.  The following conditions
+ * apply to all code found in this distribution, be it the RC4, RSA,
+ * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
+ * included with this distribution is covered by the same copyright terms
+ * except that the holder is Tim Hudson (tjh@cryptsoft.com).
+ * 
+ * Copyright remains Eric Young's, and as such any Copyright notices in
+ * the code are not to be removed.
+ * If this package is used in a product, Eric Young should be given attribution
+ * as the author of the parts of the library used.
+ * This can be in the form of a textual message at program startup or
+ * in documentation (online or textual) provided with the package.
+ * 
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ *    must display the following acknowledgement:
+ *    "This product includes cryptographic software written by
+ *     Eric Young (eay@cryptsoft.com)"
+ *    The word 'cryptographic' can be left out if the rouines from the library
+ *    being used are not cryptographic related :-).
+ * 4. If you include any Windows specific code (or a derivative thereof) from 
+ *    the apps directory (application code) you must include an acknowledgement:
+ *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
+ * 
+ * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ * 
+ * The licence and distribution terms for any publically available version or
+ * derivative of this code cannot be changed.  i.e. this code cannot simply be
+ * copied and put under another distribution licence
+ * [including the GNU Public Licence.]
+ */
+
+#ifndef HEADER_SHA512_H
+#define HEADER_SHA512_H
+
+#include "BaseTypes.h"
+
+#ifdef  __cplusplus
+extern "C" {
+#endif
+
+#define SHA512_DIGEST_LENGTH    64
+#define SHA512_LBLOCK			(sizeof(SHA_LONG64))
+#define SHA512_CBLOCK           128     /* SHA-512 treats input data as a
+                                         * contiguous array of 64 bit
+                                         * wide big-endian values. */
+#define SHA_LONG64 U64
+
+typedef struct SHA512state_st
+{
+    SHA_LONG64 h[8];
+    SHA_LONG64 Nl,Nh;
+    union {
+        SHA_LONG64      d[8];
+        unsigned char   p[SHA512_CBLOCK];
+    } u;
+    unsigned int num, md_len;
+} SHA512_CTX;
+
+void SHA512_Init(SHA512_CTX *c);
+void SHA512_Update(SHA512_CTX *c, const void *data, size_t len);
+void SHA512_Final(unsigned char *md, SHA512_CTX *c);
+
+#ifdef  __cplusplus
+}
+#endif
+#endif