Page MenuHome GnuPG
Files F19741953

No OneTemporary
Actions

View Options

This file is larger than 256 KB, so syntax highlighting was skipped.
diff --git a/cipher/pkey-ecc-nist.c b/cipher/pkey-ecc-nist.c
index 68add649..b10bdf57 100644
--- a/cipher/pkey-ecc-nist.c
+++ b/cipher/pkey-ecc-nist.c
@@ -1,415 +1,414 @@
/* pkey-ecc-nist.c - PKEY API implementation for NIST Curves
* Copyright (C) 2021 g10 Code GmbH
*
* This file is part of Libgcrypt.
*
* Libgcrypt is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser general Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* Libgcrypt is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, see <https://www.gnu.org/licenses/>.
* SPDX-License-Identifier: LGPL-2.1+
*/
#include <config.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdarg.h>
#include <errno.h>
#include "g10lib.h"
#include "mpi.h"
#include "mpi-internal.h"
#include "ec-context.h"
#include "gcrypt-int.h"
#include "cipher.h"
#include "context.h"
#include "pubkey-internal.h"
#include "ecc-common.h"
#include "pkey-internal.h"
static const char *
get_curve_name (int curve)
{
switch (curve)
{
case GCRY_PKEY_CURVE_NIST_P192:
return "nistp192";
case GCRY_PKEY_CURVE_NIST_P224:
return "nistp224";
case GCRY_PKEY_CURVE_NIST_P256:
return "nistp256";
case GCRY_PKEY_CURVE_NIST_P384:
return "nistp384";
case GCRY_PKEY_CURVE_NIST_P521:
return "nistp521";
default:
return "unknown";
}
}
gcry_error_t
_gcry_pkey_nist_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[], size_t out_len[])
{
gcry_error_t err = 0;
gcry_sexp_t s_sk = NULL;
gcry_sexp_t s_msg= NULL;
gcry_sexp_t s_sig= NULL;
gcry_sexp_t s_tmp, s_tmp2;
const char *curve;
const char *md_name;
if (num_in != 2) /* For now, k should be specified by the caller. */
return gpg_error (GPG_ERR_INV_ARG);
if (num_out != 2)
return gpg_error (GPG_ERR_INV_ARG);
curve = get_curve_name (h->ecc.curve);
if (h->ecc.pk)
err = sexp_build (&s_sk, NULL,
"(private-key"
" (ecc"
" (curve %s)"
" (q %b)"
" (d %b)))", curve,
(int)h->ecc.pk_len, h->ecc.pk,
(int)h->ecc.sk_len, h->ecc.sk);
else
err = sexp_build (&s_sk, NULL,
"(private-key"
" (ecc"
" (curve %s)"
" (d %b)))", curve,
(int)h->ecc.sk_len, h->ecc.sk);
if (err)
return err;
md_name = _gcry_md_algo_name (h->ecc.md_algo);
if ((h->flags & GCRY_PKEY_FLAG_PREHASH))
err = sexp_build (&s_msg, NULL,
"(data"
" (flags raw prehash)"
" (label %b)"
" (hash-algo %s)"
" (value %b))",
(int)in_len[1], in[1],
md_name, (int)in_len[0], in[0]);
else
err = sexp_build (&s_msg, NULL,
"(data "
" (label %b)"
" (value %b))", (int)in_len[1], in[1],
(int)in_len[0], in[0]);
if (err)
{
sexp_release (s_sk);
return err;
}
err = _gcry_pk_sign (&s_sig, s_msg, s_sk);
sexp_release (s_sk);
sexp_release (s_msg);
if (err)
return err;
out[0] = out[1] = NULL;
s_tmp2 = NULL;
s_tmp = sexp_find_token (s_sig, "sig-val", 0);
if (s_tmp)
{
s_tmp2 = s_tmp;
s_tmp = sexp_find_token (s_tmp2, "ecdsa", 0);
if (s_tmp)
{
sexp_release (s_tmp2);
s_tmp2 = s_tmp;
s_tmp = sexp_find_token (s_tmp2, "r", 0);
if (s_tmp)
{
const char *p;
size_t n;
out_len[0] = h->ecc.sk_len;
out[0] = xtrymalloc (h->ecc.sk_len);
if (!out[0])
{
err = gpg_error_from_syserror ();
sexp_release (s_tmp);
sexp_release (s_tmp2);
return err;
}
p = sexp_nth_data (s_tmp, 1, &n);
if (n == h->ecc.sk_len)
memcpy (out[0], p, h->ecc.sk_len);
else
{
memset (out[0], 0, h->ecc.sk_len - n);
memcpy (out[0] + h->ecc.sk_len - n, p, n);
}
sexp_release (s_tmp);
}
s_tmp = sexp_find_token (s_tmp2, "s", 0);
if (s_tmp)
{
const char *p;
size_t n;
out_len[1] = h->ecc.sk_len;
out[1] = xtrymalloc (h->ecc.sk_len);
if (!out[1])
{
err = gpg_error_from_syserror ();
sexp_release (s_tmp);
sexp_release (s_tmp2);
return err;
}
p = sexp_nth_data (s_tmp, 1, &n);
if (n == h->ecc.sk_len)
memcpy (out[1], p, h->ecc.sk_len);
else
{
memset (out[1], 0, h->ecc.sk_len - n);
memcpy (out[1] + h->ecc.sk_len - n, p, n);
}
sexp_release (s_tmp);
}
}
}
sexp_release (s_tmp2);
if (out[0] == NULL || out[1] == NULL)
err = gpg_error (GPG_ERR_BAD_SIGNATURE);
sexp_release (s_sig);
return err;
}
gcry_error_t
_gcry_pkey_nist_verify (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[])
{
gcry_error_t err = 0;
gcry_sexp_t s_pk = NULL;
gcry_sexp_t s_msg= NULL;
gcry_sexp_t s_sig= NULL;
const char *curve;
const char *md_name;
if (num_in != 4) /* For now, k should be specified by the caller. */
return gpg_error (GPG_ERR_INV_ARG);
curve = get_curve_name (h->ecc.curve);
err = sexp_build (&s_pk, NULL,
"(public-key"
" (ecc"
" (curve %s)"
" (q %b)))", curve,
(int)h->ecc.pk_len, h->ecc.pk);
if (err)
return err;
md_name = _gcry_md_algo_name (h->ecc.md_algo);
if ((h->flags & GCRY_PKEY_FLAG_PREHASH))
err = sexp_build (&s_msg, NULL,
"(data"
" (flags raw prehash)"
" (label %b)"
" (hash-algo %s)"
" (value %b))",
(int)in_len[1], in[1],
md_name, (int)in_len[0], in[0]);
else
err = sexp_build (&s_msg, NULL,
"(data "
" (label %b)"
" (value %b))", (int)in_len[1], in[1],
(int)in_len[0], in[0]);
if (err)
{
sexp_release (s_pk);
return err;
}
err = sexp_build (&s_sig, NULL,
"(sig-val(ecdsa(r %b)(s %b)))",
(int)in_len[2], in[2],
(int)in_len[3], in[3]);
if (err)
{
sexp_release (s_msg);
sexp_release (s_pk);
return err;
}
err = _gcry_pk_verify (s_sig, s_msg, s_pk);
sexp_release (s_sig);
sexp_release (s_msg);
sexp_release (s_pk);
return err;
}
gcry_error_t
_gcry_pkey_nist_ecdh (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[], size_t out_len[])
{
gpg_err_code_t errc;
gcry_error_t err = 0;
const char *curve;
int flags = 0;
unsigned int nbits;
elliptic_curve_t E;
mpi_ec_t ec;
mpi_point_struct kG;
mpi_point_struct R;
gcry_mpi_t x, y;
size_t n;
if (num_in != 2)
return gpg_error (GPG_ERR_INV_ARG);
if (num_out != 1 && num_out != 2)
return gpg_error (GPG_ERR_INV_ARG);
curve = get_curve_name (h->ecc.curve);
memset (&E, 0, sizeof E);
errc = _gcry_ecc_fill_in_curve (0, curve, &E, &nbits);
if (errc)
return gpg_error (errc);
ec = _gcry_mpi_ec_p_internal_new (E.model, E.dialect, flags, E.p, E.a, E.b);
if (!ec)
{
_gcry_ecc_curve_free (&E);
return gpg_error (GPG_ERR_INV_CURVE);
}
ec->G = mpi_point_snatch_set (NULL, E.G.x, E.G.y, E.G.z);
E.G.x = NULL;
E.G.y = NULL;
E.G.z = NULL;
ec->n = E.n;
E.n = NULL;
ec->h = E.h;
ec->name = E.name;
ec->Q = _gcry_mpi_point_new (nbits);
_gcry_mpi_scan (&ec->d, GCRYMPI_FMT_USG, h->ecc.sk, h->ecc.sk_len, NULL);
_gcry_ecc_curve_free (&E);
if (h->ecc.pk)
{
- size_t n = h->ecc.pk_len;
-
+ n = h->ecc.pk_len;
if (n < 1 || h->ecc.pk[0] != 0x04 || ((n - 1) % 2))
{
_gcry_mpi_ec_free (ec);
return gpg_error (GPG_ERR_INV_OBJ);
}
n = (n - 1)/2;
mpi_free (ec->Q->x);
ec->Q->x = NULL;
mpi_free (ec->Q->y);
ec->Q->y = NULL;
_gcry_mpi_scan (&ec->Q->x, GCRYMPI_FMT_USG, h->ecc.pk+1, n, NULL);
_gcry_mpi_scan (&ec->Q->y, GCRYMPI_FMT_USG, h->ecc.pk+1+n, n, NULL);
mpi_set_ui (ec->Q->z, 1);
}
else
{
/* FIXME: compute ec->Q by [ec->d] ec->G. */
err = gpg_error (GPG_ERR_NOT_IMPLEMENTED);
}
if (err)
{
_gcry_mpi_ec_free (ec);
return err;
}
_gcry_mpi_scan (&kG.x, GCRYMPI_FMT_USG, in[0], in_len[0], NULL);
_gcry_mpi_scan (&kG.y, GCRYMPI_FMT_USG, in[1], in_len[1], NULL);
kG.z = mpi_new (0);
mpi_set_ui (kG.z, 1);
if (DBG_CIPHER)
log_printpnt ("ecdh kG", &kG, NULL);
if (!_gcry_mpi_ec_curve_point (&kG, ec))
{
point_free (&kG);
_gcry_mpi_ec_free (ec);
return gpg_error (GPG_ERR_INV_DATA);
}
point_init (&R);
/* R = dkG */
_gcry_mpi_ec_mul_point (&R, ec->d, &kG, ec);
point_free (&kG);
x = mpi_new (0);
y = mpi_new (0);
if (_gcry_mpi_ec_get_affine (x, y, &R, ec))
{
mpi_free (x);
mpi_free (y);
point_free (&R);
_gcry_mpi_ec_free (ec);
return gpg_error (GPG_ERR_INV_DATA);
}
point_free (&R);
_gcry_mpi_ec_free (ec);
out[0] = xmalloc (h->ecc.sk_len);
errc = _gcry_mpi_print (GCRYMPI_FMT_USG, out[0], h->ecc.sk_len, &n, x);
if (n < h->ecc.sk_len)
{
memmove (out[0] + h->ecc.sk_len - n, out[0], n);
memset (out[0], 0, h->ecc.sk_len - n);
}
out_len[0] = h->ecc.sk_len;
mpi_free (x);
if (num_out == 2)
{
out[1] = xmalloc (h->ecc.sk_len);
errc = _gcry_mpi_print (GCRYMPI_FMT_USG, out[1], h->ecc.sk_len, &n, y);
if (n < h->ecc.sk_len)
{
memmove (out[1] + h->ecc.sk_len - n, out[1], n);
memset (out[1], 0, h->ecc.sk_len - n);
}
out_len[1] = h->ecc.sk_len;
}
mpi_free (y);
return 0;
}
diff --git a/cipher/pkey-internal.h b/cipher/pkey-internal.h
index 2257cb54..48bedfdc 100644
--- a/cipher/pkey-internal.h
+++ b/cipher/pkey-internal.h
@@ -1,150 +1,156 @@
/* pkey-internal.h - Internal defs for pkey.c
* Copyright (C) 2021 g10 Code GmbH
*
* This file is part of Libgcrypt.
*
* Libgcrypt is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser general Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* Libgcrypt is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, see <https://www.gnu.org/licenses/>.
* SPDX-License-Identifier: LGPL-2.1+
*/
gcry_error_t _gcry_pkey_ed25519_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[],
size_t out_len[]);
gcry_error_t _gcry_pkey_ed25519_verify (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[]);
gcry_error_t _gcry_pkey_ed448_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[],
size_t out_len[]);
gcry_error_t _gcry_pkey_ed448_verify (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[]);
gcry_error_t _gcry_pkey_rsapss_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[],
size_t out_len[]);
gcry_error_t _gcry_pkey_rsapss_verify (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[]);
gcry_error_t _gcry_pkey_rsa15_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[],
size_t out_len[]);
gcry_error_t _gcry_pkey_rsa15_verify (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[]);
gcry_error_t _gcry_pkey_rsa931_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[],
size_t out_len[]);
gcry_error_t _gcry_pkey_rsa931_verify (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[]);
gcry_error_t _gcry_pkey_dsa_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[],
size_t out_len[]);
gcry_error_t _gcry_pkey_dsa_verify (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[]);
gcry_error_t _gcry_pkey_nist_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[],
size_t out_len[]);
gcry_error_t _gcry_pkey_nist_verify (gcry_pkey_hd_t h, int num_in,
const unsigned char *const in[],
const size_t in_len[]);
gcry_error_t _gcry_pkey_nist_ecdh (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[],
size_t out_len[]);
+gcry_error_t _gcry_pkey_rsa_dec (gcry_pkey_hd_t h,
+ int num_in, const unsigned char *const in[],
+ const size_t in_len[],
+ int num_out, unsigned char *out[],
+ size_t out_len[]);
+
struct pkey_ecc {
int curve;
int md_algo; /* Only used for NIST cuves. */
unsigned char *pk;
size_t pk_len;
unsigned char *sk;
size_t sk_len;
};
struct pkey_rsa {
int scheme;
int md_algo;
unsigned char *n;
size_t n_len;
unsigned char *e;
size_t e_len;
unsigned char *d;
size_t d_len;
};
struct pkey_dsa {
int md_algo;
unsigned char *p;
size_t p_len;
unsigned char *q;
size_t q_len;
unsigned char *g;
size_t g_len;
unsigned char *x; /* Private key. */
size_t x_len;
unsigned char *y; /* Public key. */
size_t y_len;
};
struct gcry_pkey_handle {
int algo;
unsigned int flags;
union {
struct pkey_ecc ecc;
struct pkey_rsa rsa;
struct pkey_dsa dsa;
};
};
diff --git a/cipher/pkey-rsa.c b/cipher/pkey-rsa.c
index 781a39e2..a48a66f4 100644
--- a/cipher/pkey-rsa.c
+++ b/cipher/pkey-rsa.c
@@ -1,704 +1,767 @@
/* pkey-rsa.c - PKEY API implementation for RSA PSS/15/931
* Copyright (C) 2021 g10 Code GmbH
*
* This file is part of Libgcrypt.
*
* Libgcrypt is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser general Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* Libgcrypt is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, see <https://www.gnu.org/licenses/>.
* SPDX-License-Identifier: LGPL-2.1+
*/
#include <config.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdarg.h>
#include <errno.h>
#include "g10lib.h"
#include "gcrypt-int.h"
#include "pkey-internal.h"
gcry_error_t
_gcry_pkey_rsapss_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[], size_t out_len[])
{
gcry_error_t err = 0;
gcry_sexp_t s_sk = NULL;
gcry_sexp_t s_msg= NULL;
gcry_sexp_t s_sig= NULL;
const char *md_name;
gcry_sexp_t s_tmp, s_tmp2;
if (num_in != 1 && num_in != 2)
return gpg_error (GPG_ERR_INV_ARG);
if (num_out != 1)
return gpg_error (GPG_ERR_INV_ARG);
switch (h->rsa.md_algo)
{
case GCRY_MD_SHA224:
md_name = "sha224";
break;
case GCRY_MD_SHA256:
md_name = "sha256";
break;
case GCRY_MD_SHA384:
md_name = "sha384";
break;
case GCRY_MD_SHA512:
md_name = "sha512";
break;
case GCRY_MD_SHA512_224:
md_name = "sha512-224";
break;
case GCRY_MD_SHA512_256:
md_name = "sha512-256";
break;
default:
return gpg_error (GPG_ERR_INV_ARG);
}
err = sexp_build (&s_sk, NULL,
"(private-key (rsa (n %b)(e %b)(d %b)))",
(int)h->rsa.n_len, h->rsa.n,
(int)h->rsa.e_len, h->rsa.e,
(int)h->rsa.d_len, h->rsa.d);
if (err)
return err;
if (num_in == 1)
err = sexp_build (&s_msg, NULL,
"(data"
" (flags pss)"
" (hash-algo %s)"
" (value %b)"
" (salt-length %d))",
md_name,
(int)in_len[0], in[0], 0);
else
err = sexp_build (&s_msg, NULL,
"(data"
" (flags pss)"
" (hash-algo %s)"
" (value %b)"
" (salt-length %d)"
" (random-override %b))",
md_name,
(int)in_len[0], in[0],
(int)in_len[1],
(int)in_len[1], in[1]);
if (err)
{
sexp_release (s_sk);
return err;
}
err = _gcry_pk_sign (&s_sig, s_msg, s_sk);
sexp_release (s_sk);
sexp_release (s_msg);
if (err)
return err;
out[0] = NULL;
s_tmp2 = NULL;
s_tmp = sexp_find_token (s_sig, "sig-val", 0);
if (s_tmp)
{
s_tmp2 = s_tmp;
s_tmp = sexp_find_token (s_tmp2, "rsa", 0);
if (s_tmp)
{
sexp_release (s_tmp2);
s_tmp2 = s_tmp;
s_tmp = sexp_find_token (s_tmp2, "s", 0);
if (s_tmp)
{
out[0] = sexp_nth_buffer (s_tmp, 1, &out_len[0]);
sexp_release (s_tmp);
}
}
}
sexp_release (s_tmp2);
if (out[0] == NULL)
err = gpg_error (GPG_ERR_BAD_SIGNATURE);
sexp_release (s_sig);
return err;
}
gcry_error_t
_gcry_pkey_rsapss_verify (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[])
{
gcry_error_t err = 0;
gcry_sexp_t s_pk = NULL;
const char *md_name;
gcry_sexp_t s_msg= NULL;
gcry_sexp_t s_sig= NULL;
if (num_in != 2 && num_in != 3)
return gpg_error (GPG_ERR_INV_ARG);
switch (h->rsa.md_algo)
{
case GCRY_MD_SHA224:
md_name = "sha224";
break;
case GCRY_MD_SHA256:
md_name = "sha256";
break;
case GCRY_MD_SHA384:
md_name = "sha384";
break;
case GCRY_MD_SHA512:
md_name = "sha512";
break;
case GCRY_MD_SHA512_224:
md_name = "sha512-224";
break;
case GCRY_MD_SHA512_256:
md_name = "sha512-256";
break;
default:
return gpg_error (GPG_ERR_INV_ARG);
}
err = sexp_build (&s_pk, NULL,
"(public-key (rsa (n %b)(e %b)))",
(int)h->rsa.n_len, h->rsa.n,
(int)h->rsa.e_len, h->rsa.e);
if (err)
return err;
if (num_in == 2)
err = sexp_build (&s_msg, NULL,
"(data"
" (flags pss)"
" (hash-algo %s)"
" (value %b)"
" (salt-length %d))",
md_name,
(int)in_len[0], in[0], 0);
else
err = sexp_build (&s_msg, NULL,
"(data"
" (flags pss)"
" (hash-algo %s)"
" (value %b)"
" (salt-length %d)"
" (random-override %b))",
md_name,
(int)in_len[0], in[0],
(int)in_len[1],
(int)in_len[1], in[1]);
if (err)
{
sexp_release (s_pk);
return err;
}
err = sexp_build (&s_sig, NULL,
"(sig-val(rsa(s %b)))",
(int)in_len[num_in-1], in[num_in-1]);
if (err)
{
sexp_release (s_msg);
sexp_release (s_pk);
return err;
}
err = _gcry_pk_verify (s_sig, s_msg, s_pk);
sexp_release (s_sig);
sexp_release (s_msg);
sexp_release (s_pk);
return err;
}
gcry_error_t
_gcry_pkey_rsa15_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[], size_t out_len[])
{
gcry_error_t err = 0;
gcry_sexp_t s_sk = NULL;
gcry_sexp_t s_msg= NULL;
gcry_sexp_t s_sig= NULL;
const char *md_name;
gcry_sexp_t s_tmp, s_tmp2;
if (num_in != 1)
return gpg_error (GPG_ERR_INV_ARG);
if (num_out != 1)
return gpg_error (GPG_ERR_INV_ARG);
switch (h->rsa.md_algo)
{
case GCRY_MD_SHA224:
md_name = "sha224";
break;
case GCRY_MD_SHA256:
md_name = "sha256";
break;
case GCRY_MD_SHA384:
md_name = "sha384";
break;
case GCRY_MD_SHA512:
md_name = "sha512";
break;
case GCRY_MD_SHA512_224:
md_name = "sha512-224";
break;
case GCRY_MD_SHA512_256:
md_name = "sha512-256";
break;
default:
return gpg_error (GPG_ERR_INV_ARG);
}
err = sexp_build (&s_sk, NULL,
"(private-key (rsa (n %b)(e %b)(d %b)))",
(int)h->rsa.n_len, h->rsa.n,
(int)h->rsa.e_len, h->rsa.e,
(int)h->rsa.d_len, h->rsa.d);
if (err)
return err;
err = sexp_build (&s_msg, NULL,
"(data"
" (flags pkcs1 prehash)"
" (hash-algo %s)"
" (value %b))",
md_name,
(int)in_len[0], in[0]);
if (err)
{
sexp_release (s_sk);
return err;
}
err = _gcry_pk_sign (&s_sig, s_msg, s_sk);
sexp_release (s_sk);
sexp_release (s_msg);
if (err)
return err;
out[0] = NULL;
s_tmp2 = NULL;
s_tmp = sexp_find_token (s_sig, "sig-val", 0);
if (s_tmp)
{
s_tmp2 = s_tmp;
s_tmp = sexp_find_token (s_tmp2, "rsa", 0);
if (s_tmp)
{
sexp_release (s_tmp2);
s_tmp2 = s_tmp;
s_tmp = sexp_find_token (s_tmp2, "s", 0);
if (s_tmp)
{
out[0] = sexp_nth_buffer (s_tmp, 1, &out_len[0]);
sexp_release (s_tmp);
}
}
}
sexp_release (s_tmp2);
if (out[0] == NULL)
err = gpg_error (GPG_ERR_BAD_SIGNATURE);
sexp_release (s_sig);
return err;
}
gcry_error_t
_gcry_pkey_rsa15_verify (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[])
{
gcry_error_t err = 0;
gcry_sexp_t s_pk = NULL;
const char *md_name;
gcry_sexp_t s_msg= NULL;
gcry_sexp_t s_sig= NULL;
if (num_in != 2)
return gpg_error (GPG_ERR_INV_ARG);
switch (h->rsa.md_algo)
{
case GCRY_MD_SHA224:
md_name = "sha224";
break;
case GCRY_MD_SHA256:
md_name = "sha256";
break;
case GCRY_MD_SHA384:
md_name = "sha384";
break;
case GCRY_MD_SHA512:
md_name = "sha512";
break;
case GCRY_MD_SHA512_224:
md_name = "sha512-224";
break;
case GCRY_MD_SHA512_256:
md_name = "sha512-256";
break;
default:
return gpg_error (GPG_ERR_INV_ARG);
}
err = sexp_build (&s_pk, NULL,
"(public-key (rsa (n %b)(e %b)))",
(int)h->rsa.n_len, h->rsa.n,
(int)h->rsa.e_len, h->rsa.e);
if (err)
return err;
err = sexp_build (&s_msg, NULL,
"(data"
" (flags pkcs1 prehash)"
" (hash-algo %s)"
" (value %b))",
md_name,
(int)in_len[0], in[0]);
if (err)
{
sexp_release (s_pk);
return err;
}
err = sexp_build (&s_sig, NULL,
"(sig-val(rsa(s %b)))",
(int)in_len[1], in[1]);
if (err)
{
sexp_release (s_msg);
sexp_release (s_pk);
return err;
}
err = _gcry_pk_verify (s_sig, s_msg, s_pk);
sexp_release (s_sig);
sexp_release (s_msg);
sexp_release (s_pk);
return err;
}
static void
x931_encode_sig (gcry_pkey_hd_t h, unsigned char md_number,
unsigned char *frame,
const unsigned char *input, size_t input_len)
{
size_t hashlen;
size_t len_ps;
hashlen = _gcry_md_get_algo_dlen (h->rsa.md_algo);
len_ps = h->rsa.n_len - hashlen - 4;
frame[0] = 0x6b;
memset (frame+1, 0xbb, len_ps);
frame[1+len_ps] = 0xba;
_gcry_md_hash_buffer (h->rsa.md_algo, &frame[len_ps+2], input, input_len);
frame[h->rsa.n_len - 2] = md_number;
frame[h->rsa.n_len - 1] = 0xcc;
}
static int
bn_sub (unsigned char *res,
const unsigned char *a, const unsigned char *b, size_t n)
{
int i;
unsigned char borrow = 0;
for (i = 0; i < (int)n; i++)
{
res[n-i-1] = a[n-i-1] - b[n-i-1] - borrow;
if ((int)a[n-i-1] < (int)b[n-i-1] + borrow)
borrow = 1;
else
borrow = 0;
}
return borrow;
}
static int
bn_cmp (const unsigned char *a, const unsigned char *b, size_t n)
{
int i;
unsigned char borrow = 0;
for (i = 0; i < (int)n; i++)
{
if ((int)a[n-i-1] < (int)b[n-i-1] + borrow)
borrow = 1;
else
borrow = 0;
}
return borrow;
}
gcry_error_t
_gcry_pkey_rsa931_sign (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[], size_t out_len[])
{
gcry_error_t err = 0;
gcry_sexp_t s_sk = NULL;
gcry_sexp_t s_msg= NULL;
gcry_sexp_t s_sig= NULL;
gcry_sexp_t s_tmp, s_tmp2;
unsigned char md_number;
unsigned char *frame;
if (num_in != 1)
return gpg_error (GPG_ERR_INV_ARG);
if (num_out != 1)
return gpg_error (GPG_ERR_INV_ARG);
switch (h->rsa.md_algo)
{
case GCRY_MD_SHA224:
md_number = 0x38;
break;
case GCRY_MD_SHA256:
md_number = 0x34;
break;
case GCRY_MD_SHA384:
md_number = 0x36;
break;
case GCRY_MD_SHA512:
md_number = 0x35;
break;
case GCRY_MD_SHA512_224:
md_number = 0x39;
break;
case GCRY_MD_SHA512_256:
md_number = 0x40;
break;
default:
return gpg_error (GPG_ERR_INV_ARG);
}
if (!(frame = xtrymalloc (h->rsa.n_len)))
return gpg_error_from_syserror ();
x931_encode_sig (h, md_number, frame, in[0], in_len[0]);
err = sexp_build (&s_sk, NULL,
"(private-key (rsa (n %b)(e %b)(d %b)))",
(int)h->rsa.n_len, h->rsa.n,
(int)h->rsa.e_len, h->rsa.e,
(int)h->rsa.d_len, h->rsa.d);
if (err)
{
xfree (frame);
return err;
}
err = sexp_build (&s_msg, NULL,
"(data"
" (flags raw fixedlen)"
" (value %b))",
(int)h->rsa.n_len, frame);
if (err)
{
xfree (frame);
sexp_release (s_sk);
return err;
}
err = _gcry_pk_sign (&s_sig, s_msg, s_sk);
sexp_release (s_sk);
sexp_release (s_msg);
if (err)
{
xfree (frame);
return err;
}
out[0] = NULL;
s_tmp2 = NULL;
s_tmp = sexp_find_token (s_sig, "sig-val", 0);
if (s_tmp)
{
s_tmp2 = s_tmp;
s_tmp = sexp_find_token (s_tmp2, "rsa", 0);
if (s_tmp)
{
sexp_release (s_tmp2);
s_tmp2 = s_tmp;
s_tmp = sexp_find_token (s_tmp2, "s", 0);
if (s_tmp)
{
out[0] = sexp_nth_buffer (s_tmp, 1, &out_len[0]);
sexp_release (s_tmp);
}
}
}
sexp_release (s_tmp2);
if (out[0] == NULL)
err = gpg_error (GPG_ERR_BAD_SIGNATURE);
else
{
/* X9.31 signature scheme is tricky; It selects minimum one. */
if (!bn_sub (frame, h->rsa.n, out[0], h->rsa.n_len)
&& bn_cmp (frame, out[0], h->rsa.n_len))
memcpy (out[0], frame, h->rsa.n_len);
}
sexp_release (s_sig);
xfree (frame);
return err;
}
gcry_error_t
_gcry_pkey_rsa931_verify (gcry_pkey_hd_t h,
int num_in, const unsigned char *const in[],
const size_t in_len[])
{
gcry_error_t err = 0;
gcry_sexp_t s_pk = NULL;
gcry_sexp_t s_msg= NULL;
gcry_sexp_t s_sig= NULL;
unsigned char md_number;
unsigned char *frame;
if (num_in != 2)
return gpg_error (GPG_ERR_INV_ARG);
switch (h->rsa.md_algo)
{
case GCRY_MD_SHA224:
md_number = 0x38;
break;
case GCRY_MD_SHA256:
md_number = 0x34;
break;
case GCRY_MD_SHA384:
md_number = 0x36;
break;
case GCRY_MD_SHA512:
md_number = 0x35;
break;
case GCRY_MD_SHA512_224:
md_number = 0x39;
break;
case GCRY_MD_SHA512_256:
md_number = 0x40;
break;
default:
return gpg_error (GPG_ERR_INV_ARG);
}
if (!(frame = xtrymalloc (h->rsa.n_len)))
return gpg_error_from_syserror ();
x931_encode_sig (h, md_number, frame, in[0], in_len[0]);
err = sexp_build (&s_pk, NULL,
"(public-key (rsa (n %b)(e %b)))",
(int)h->rsa.n_len, h->rsa.n,
(int)h->rsa.e_len, h->rsa.e);
if (err)
{
xfree (frame);
return err;
}
err = sexp_build (&s_msg, NULL,
"(data"
" (flags raw fixedlen)"
" (value %b))",
(int)h->rsa.n_len, frame);
xfree (frame);
if (err)
{
sexp_release (s_pk);
return err;
}
err = sexp_build (&s_sig, NULL,
"(sig-val(rsa(s %b)))",
(int)in_len[1], in[1]);
if (err)
{
sexp_release (s_msg);
sexp_release (s_pk);
return err;
}
/* We check two possible signature;
* This allows invalid signature (by another value).
* We should support X9.31 signature scheme in lower level.
*/
err = _gcry_pk_verify (s_sig, s_msg, s_pk);
if (err)
{
unsigned char *alt;
/* Try another. */
sexp_release (s_sig);
if (!(alt = xtrymalloc (h->rsa.n_len)))
{
sexp_release (s_msg);
sexp_release (s_pk);
return gpg_error_from_syserror ();
}
bn_sub (alt, h->rsa.n, in[1], h->rsa.n_len);
err = sexp_build (&s_sig, NULL,
"(sig-val(rsa(s %b)))",
(int)in_len[1], alt);
if (err)
{
sexp_release (s_msg);
sexp_release (s_pk);
return err;
}
err = _gcry_pk_verify (s_sig, s_msg, s_pk);
}
sexp_release (s_sig);
sexp_release (s_msg);
sexp_release (s_pk);
return err;
}
+
+gcry_error_t
+_gcry_pkey_rsa_dec (gcry_pkey_hd_t h,
+ int num_in, const unsigned char *const in[],
+ const size_t in_len[],
+ int num_out, unsigned char *out[], size_t out_len[])
+{
+ gpg_err_code_t errc;
+ gcry_error_t err = 0;
+ gcry_mpi_t n, d;
+ gcry_mpi_t c, k;
+ size_t n0;
+
+ if (num_in != 1)
+ return gpg_error (GPG_ERR_INV_ARG);
+
+ if (num_out != 1)
+ return gpg_error (GPG_ERR_INV_ARG);
+
+ _gcry_mpi_scan (&n, GCRYMPI_FMT_USG, h->rsa.n, h->rsa.n_len, NULL);
+ _gcry_mpi_scan (&c, GCRYMPI_FMT_USG, in[0], in_len[0], NULL);
+
+ if (mpi_cmp (c, n) >= 0)
+ {
+ _gcry_mpi_release (c);
+ _gcry_mpi_release (n);
+ return gpg_error (GPG_ERR_INV_VALUE);
+ }
+
+ k = mpi_snew (h->rsa.n_len * 8);
+ _gcry_mpi_scan (&d, GCRYMPI_FMT_USG, h->rsa.d, h->rsa.d_len, NULL);
+
+
+ /* FIXME: For now, no blinding. */
+ mpi_powm (k, c, d, n);
+
+ out[0] = xmalloc (h->rsa.n_len);
+ errc = _gcry_mpi_print (GCRYMPI_FMT_USG, out[0], h->rsa.n_len, &n0, k);
+ if (errc)
+ {
+ xfree (out[0]);
+ out[0] = NULL;
+ _gcry_mpi_release (d);
+ _gcry_mpi_release (k);
+ _gcry_mpi_release (c);
+ _gcry_mpi_release (n);
+ return gpg_error (errc);
+ }
+
+ if (n0 < h->rsa.n_len)
+ {
+ memmove (out[0] + h->rsa.n_len - n0, out[0], n0);
+ memset (out[0], 0, h->rsa.n_len - n0);
+ }
+ out_len[0] = h->rsa.n_len;
+
+ _gcry_mpi_release (d);
+ _gcry_mpi_release (k);
+ _gcry_mpi_release (c);
+ _gcry_mpi_release (n);
+
+ return err;
+}
diff --git a/cipher/pkey.c b/cipher/pkey.c
index f9431040..55030562 100644
--- a/cipher/pkey.c
+++ b/cipher/pkey.c
@@ -1,513 +1,522 @@
/* pkey.c - Pubric key cryptography API
* Copyright (C) 2021 g10 Code GmbH
*
* This file is part of Libgcrypt.
*
* Libgcrypt is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser general Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* Libgcrypt is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, see <https://www.gnu.org/licenses/>.
* SPDX-License-Identifier: LGPL-2.1+
*/
#include <config.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdarg.h>
#include <errno.h>
#include "g10lib.h"
#include "gcrypt-int.h"
#include "pkey-internal.h"
gcry_error_t
_gcry_pkey_vopen (gcry_pkey_hd_t *h_p, int algo, unsigned int flags,
va_list arg_ptr)
{
gcry_error_t err = 0;
gcry_pkey_hd_t h;
if (algo == GCRY_PKEY_ECC || algo == GCRY_PKEY_RSA || algo == GCRY_PKEY_DSA)
;
else if (algo == GCRY_PKEY_ELG)
err = gpg_error (GPG_ERR_NOT_IMPLEMENTED);
else
err = gpg_error (GPG_ERR_WRONG_PUBKEY_ALGO);
if (err)
return err;
if (!(h = xtrycalloc (1, sizeof (struct gcry_pkey_handle))))
return gpg_error_from_syserror ();
h->algo = algo;
h->flags = flags;
if (algo == GCRY_PKEY_ECC)
{
int curve;
unsigned char *pk;
unsigned char *sk;
curve = va_arg (arg_ptr, int);
if (curve == GCRY_PKEY_CURVE_ED25519 || curve == GCRY_PKEY_CURVE_ED448)
h->ecc.md_algo = 0;
else if (curve == GCRY_PKEY_CURVE_NIST_P192
|| curve == GCRY_PKEY_CURVE_NIST_P224
|| curve == GCRY_PKEY_CURVE_NIST_P256
|| curve == GCRY_PKEY_CURVE_NIST_P384
|| curve == GCRY_PKEY_CURVE_NIST_P521)
h->ecc.md_algo = va_arg (arg_ptr, int);
else
err = gpg_error (GPG_ERR_NOT_IMPLEMENTED);
if (err)
{
xfree (h);
return err;
}
h->ecc.curve = curve;
if (h->ecc.md_algo)
{ /* NIST curves */
unsigned char *x, *y;
size_t x_len, y_len;
x = va_arg (arg_ptr, unsigned char *);
x_len = va_arg (arg_ptr, size_t);
y = va_arg (arg_ptr, unsigned char *);
y_len = va_arg (arg_ptr, size_t);
if (x && y)
{
h->ecc.pk_len = 1 + x_len + y_len;
h->ecc.pk = xtrymalloc (h->ecc.pk_len);
if (!h->ecc.pk)
{
err = gpg_error_from_syserror ();
xfree (h);
return err;
}
h->ecc.pk[0] = 0x04;
memcpy (h->ecc.pk+1, x, x_len);
memcpy (h->ecc.pk+1+x_len, y, y_len);
}
else
h->ecc.pk = NULL;
}
else
{ /* Modern curves */
pk = va_arg (arg_ptr, unsigned char *);
h->ecc.pk_len = va_arg (arg_ptr, size_t);
if (pk)
{
h->ecc.pk = xtrymalloc (h->ecc.pk_len);
if (!h->ecc.pk)
{
err = gpg_error_from_syserror ();
xfree (h);
return err;
}
memcpy (h->ecc.pk, pk, h->ecc.pk_len);
}
else
h->ecc.pk = NULL;
}
if (!(flags & GCRY_PKEY_FLAG_SECRET))
{
h->ecc.sk = sk = NULL;
h->ecc.sk_len = 0;
}
else
{
sk = va_arg (arg_ptr, unsigned char *);
h->ecc.sk_len = va_arg (arg_ptr, size_t);
}
if (sk)
{
h->ecc.sk = xtrymalloc_secure (h->ecc.sk_len);
if (!h->ecc.sk)
{
err = gpg_error_from_syserror ();
xfree (h->ecc.pk);
xfree (h);
return err;
}
memcpy (h->ecc.sk, sk, h->ecc.sk_len);
}
}
else if (algo == GCRY_PKEY_RSA)
{
int scheme;
int md_algo;
unsigned char *n;
unsigned char *e;
unsigned char *d;
scheme = va_arg (arg_ptr, int);
if (scheme == GCRY_PKEY_RSA_PSS)
;
else if (scheme == GCRY_PKEY_RSA_15)
;
else if (scheme == GCRY_PKEY_RSA_931)
;
else
err = gpg_error (GPG_ERR_INV_ARG);
if (err)
{
xfree (h);
return err;
}
h->rsa.scheme = scheme;
md_algo = va_arg (arg_ptr, int);
h->rsa.md_algo = md_algo;
n = va_arg (arg_ptr, unsigned char *);
h->rsa.n_len = va_arg (arg_ptr, size_t);
e = va_arg (arg_ptr, unsigned char *);
h->rsa.e_len = va_arg (arg_ptr, size_t);
if (!(flags & GCRY_PKEY_FLAG_SECRET))
{
h->rsa.d = d = NULL;
h->rsa.d_len = 0;
}
else
{
d = va_arg (arg_ptr, unsigned char *);
h->rsa.d_len = va_arg (arg_ptr, size_t);
}
if (err)
{
xfree (h);
return err;
}
if (n)
{
h->rsa.n = xtrymalloc (h->rsa.n_len);
if (!h->rsa.n)
{
err = gpg_error_from_syserror ();
xfree (h);
return err;
}
memcpy (h->rsa.n, n, h->rsa.n_len);
}
else
h->rsa.n = NULL;
if (e)
{
h->rsa.e = xtrymalloc (h->rsa.e_len);
if (!h->rsa.e)
{
err = gpg_error_from_syserror ();
xfree (h);
return err;
}
memcpy (h->rsa.e, e, h->rsa.e_len);
}
else
h->rsa.e = NULL;
if (d)
{
h->rsa.d = xtrymalloc (h->rsa.d_len);
if (!h->rsa.d)
{
err = gpg_error_from_syserror ();
xfree (h);
return err;
}
memcpy (h->rsa.d, d, h->rsa.d_len);
}
}
else if (algo == GCRY_PKEY_DSA)
{
int md_algo;
unsigned char *p;
unsigned char *q;
unsigned char *g;
unsigned char *x;
unsigned char *y;
md_algo = va_arg (arg_ptr, int);
h->dsa.md_algo = md_algo;
p = va_arg (arg_ptr, unsigned char *);
h->dsa.p_len = va_arg (arg_ptr, size_t);
q = va_arg (arg_ptr, unsigned char *);
h->dsa.q_len = va_arg (arg_ptr, size_t);
g = va_arg (arg_ptr, unsigned char *);
h->dsa.g_len = va_arg (arg_ptr, size_t);
y = va_arg (arg_ptr, unsigned char *);
h->dsa.y_len = va_arg (arg_ptr, size_t);
if (!(flags & GCRY_PKEY_FLAG_SECRET))
{
h->dsa.x = x = NULL;
h->dsa.x_len = 0;
}
else
{
x = va_arg (arg_ptr, unsigned char *);
h->dsa.x_len = va_arg (arg_ptr, size_t);
}
if (err)
{
xfree (h);
return err;
}
if (p)
{
h->dsa.p = xtrymalloc (h->dsa.p_len);
if (!h->dsa.p)
{
err = gpg_error_from_syserror ();
xfree (h);
return err;
}
memcpy (h->dsa.p, p, h->dsa.p_len);
}
else
h->dsa.p = NULL;
if (q)
{
h->dsa.q = xtrymalloc (h->dsa.q_len);
if (!h->dsa.q)
{
err = gpg_error_from_syserror ();
xfree (h);
return err;
}
memcpy (h->dsa.q, q, h->dsa.q_len);
}
else
h->dsa.q = NULL;
if (g)
{
h->dsa.g = xtrymalloc (h->dsa.g_len);
if (!h->dsa.g)
{
err = gpg_error_from_syserror ();
xfree (h);
return err;
}
memcpy (h->dsa.g, g, h->dsa.g_len);
}
else
h->dsa.g = NULL;
if (y)
{
h->dsa.y = xtrymalloc (h->dsa.y_len);
if (!h->dsa.y)
{
err = gpg_error_from_syserror ();
xfree (h);
return err;
}
memcpy (h->dsa.y, y, h->dsa.y_len);
}
else
h->dsa.y = NULL;
if (x)
{
h->dsa.x = xtrymalloc (h->dsa.x_len);
if (!h->dsa.x)
{
err = gpg_error_from_syserror ();
xfree (h);
return err;
}
memcpy (h->dsa.x, x, h->dsa.x_len);
}
}
*h_p = h;
return err;
}
gcry_error_t
_gcry_pkey_ctl (gcry_pkey_hd_t h, int cmd, void *buffer, size_t buflen)
{
gcry_error_t err = 0;
(void)h; (void)cmd; (void)buffer; (void)buflen;
/* FIXME: Not yet implemented anything. */
return err;
}
/* For now, it uses SEXP implementation, because the purpose is
to test the API (but not the implementation).
Will be rewritten soon.
Currently, it's like:
[ gcry_pkey_op API (with binary data) ]
|
[ gcry_pk_ API (with SEXP) ]
|
[ lower level public key implementations (with SEXP) ]
It will be like:
[ gcry_pk_ API with SEXP ] [ gcry_pkey_op API with binary data ]
| |
[ lower level public key implementations ]
That is, lower level public key implementations won't have any
(direct) handling of SEXP.
*/
gcry_error_t
_gcry_pkey_op (gcry_pkey_hd_t h, int cmd,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[], size_t out_len[])
{
gcry_error_t err = 0;
if (h->algo == GCRY_PKEY_ECC)
{
if (h->ecc.curve == GCRY_PKEY_CURVE_ED25519)
{
if (cmd == GCRY_PKEY_OP_SIGN)
err = _gcry_pkey_ed25519_sign (h, num_in, in, in_len,
num_out, out, out_len);
else if (cmd == GCRY_PKEY_OP_VERIFY)
err = _gcry_pkey_ed25519_verify (h, num_in, in, in_len);
else
err = gpg_error (GPG_ERR_INV_OP);
}
else if (h->ecc.curve == GCRY_PKEY_CURVE_ED448)
{
if (cmd == GCRY_PKEY_OP_SIGN)
err = _gcry_pkey_ed448_sign (h, num_in, in, in_len,
num_out, out, out_len);
else if (cmd == GCRY_PKEY_OP_VERIFY)
err = _gcry_pkey_ed448_verify (h, num_in, in, in_len);
else
err = gpg_error (GPG_ERR_INV_OP);
}
else if (h->ecc.curve == GCRY_PKEY_CURVE_NIST_P192
|| h->ecc.curve == GCRY_PKEY_CURVE_NIST_P224
|| h->ecc.curve == GCRY_PKEY_CURVE_NIST_P256
|| h->ecc.curve == GCRY_PKEY_CURVE_NIST_P384
|| h->ecc.curve == GCRY_PKEY_CURVE_NIST_P521)
{
if (cmd == GCRY_PKEY_OP_SIGN)
err = _gcry_pkey_nist_sign (h, num_in, in, in_len,
num_out, out, out_len);
else if (cmd == GCRY_PKEY_OP_VERIFY)
err = _gcry_pkey_nist_verify (h, num_in, in, in_len);
else if (cmd == GCRY_PKEY_OP_ECDH)
err = _gcry_pkey_nist_ecdh (h, num_in, in, in_len,
num_out, out, out_len);
else
err = gpg_error (GPG_ERR_INV_OP);
}
else
err = gpg_error (GPG_ERR_INV_OP);
}
else if (h->algo == GCRY_PKEY_RSA)
{
- if (h->rsa.scheme == GCRY_PKEY_RSA_PSS)
- {
- if (cmd == GCRY_PKEY_OP_SIGN)
- err = _gcry_pkey_rsapss_sign (h, num_in, in, in_len,
- num_out, out, out_len);
- else if (cmd == GCRY_PKEY_OP_VERIFY)
- err = _gcry_pkey_rsapss_verify (h, num_in, in, in_len);
- else
- err = gpg_error (GPG_ERR_INV_OP);
- }
- else if (h->rsa.scheme == GCRY_PKEY_RSA_15)
- {
- if (cmd == GCRY_PKEY_OP_SIGN)
- err = _gcry_pkey_rsa15_sign (h, num_in, in, in_len,
- num_out, out, out_len);
- else if (cmd == GCRY_PKEY_OP_VERIFY)
- err = _gcry_pkey_rsa15_verify (h, num_in, in, in_len);
- else
- err = gpg_error (GPG_ERR_INV_OP);
- }
- else if (h->rsa.scheme == GCRY_PKEY_RSA_931)
- {
- if (cmd == GCRY_PKEY_OP_SIGN)
- err = _gcry_pkey_rsa931_sign (h, num_in, in, in_len,
- num_out, out, out_len);
- else if (cmd == GCRY_PKEY_OP_VERIFY)
- err = _gcry_pkey_rsa931_verify (h, num_in, in, in_len);
- else
- err = gpg_error (GPG_ERR_INV_OP);
- }
+ if (cmd == GCRY_PKEY_OP_DECRYPT)
+ {
+ /* FIXME: For now, only support raw encoding. */
+ err = _gcry_pkey_rsa_dec (h, num_in, in, in_len,
+ num_out, out, out_len);
+ }
else
- err = gpg_error (GPG_ERR_INV_OP);
+ {
+ if (h->rsa.scheme == GCRY_PKEY_RSA_PSS)
+ {
+ if (cmd == GCRY_PKEY_OP_SIGN)
+ err = _gcry_pkey_rsapss_sign (h, num_in, in, in_len,
+ num_out, out, out_len);
+ else if (cmd == GCRY_PKEY_OP_VERIFY)
+ err = _gcry_pkey_rsapss_verify (h, num_in, in, in_len);
+ else
+ err = gpg_error (GPG_ERR_INV_OP);
+ }
+ else if (h->rsa.scheme == GCRY_PKEY_RSA_15)
+ {
+ if (cmd == GCRY_PKEY_OP_SIGN)
+ err = _gcry_pkey_rsa15_sign (h, num_in, in, in_len,
+ num_out, out, out_len);
+ else if (cmd == GCRY_PKEY_OP_VERIFY)
+ err = _gcry_pkey_rsa15_verify (h, num_in, in, in_len);
+ else
+ err = gpg_error (GPG_ERR_INV_OP);
+ }
+ else if (h->rsa.scheme == GCRY_PKEY_RSA_931)
+ {
+ if (cmd == GCRY_PKEY_OP_SIGN)
+ err = _gcry_pkey_rsa931_sign (h, num_in, in, in_len,
+ num_out, out, out_len);
+ else if (cmd == GCRY_PKEY_OP_VERIFY)
+ err = _gcry_pkey_rsa931_verify (h, num_in, in, in_len);
+ else
+ err = gpg_error (GPG_ERR_INV_OP);
+ }
+ else
+ err = gpg_error (GPG_ERR_INV_OP);
+ }
}
else if (h->algo == GCRY_PKEY_DSA)
{
if (cmd == GCRY_PKEY_OP_SIGN)
err = _gcry_pkey_dsa_sign (h, num_in, in, in_len,
num_out, out, out_len);
else if (cmd == GCRY_PKEY_OP_VERIFY)
err = _gcry_pkey_dsa_verify (h, num_in, in, in_len);
else
err = gpg_error (GPG_ERR_INV_OP);
}
else
err = gpg_error (GPG_ERR_WRONG_PUBKEY_ALGO);
return err;
}
void
_gcry_pkey_close (gcry_pkey_hd_t h)
{
if (h)
{
if (h->algo == GCRY_PKEY_ECC)
{
xfree (h->ecc.pk);
xfree (h->ecc.sk);
}
else if (h->algo == GCRY_PKEY_RSA)
{
xfree (h->rsa.n);
xfree (h->rsa.e);
xfree (h->rsa.d);
}
else if (h->algo == GCRY_PKEY_DSA)
{
xfree (h->dsa.p);
xfree (h->dsa.q);
xfree (h->dsa.g);
xfree (h->dsa.x);
xfree (h->dsa.y);
}
xfree (h);
}
}
diff --git a/src/gcrypt.h.in b/src/gcrypt.h.in
index db16bd1c..cf129202 100644
--- a/src/gcrypt.h.in
+++ b/src/gcrypt.h.in
@@ -1,1929 +1,1930 @@
/* gcrypt.h - GNU Cryptographic Library Interface -*- c -*-
* Copyright (C) 1998-2018 Free Software Foundation, Inc.
* Copyright (C) 2012-2018 g10 Code GmbH
*
* This file is part of Libgcrypt.
*
* Libgcrypt is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* Libgcrypt is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this program; if not, see <http://www.gnu.org/licenses/>.
*
* File: @configure_input@
*/
#ifndef _GCRYPT_H
#define _GCRYPT_H
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <gpg-error.h>
#include <sys/types.h>
#if defined _WIN32 || defined __WIN32__
# include <winsock2.h>
# include <ws2tcpip.h>
# include <time.h>
# ifndef __GNUC__
typedef long ssize_t;
typedef int pid_t;
# endif /*!__GNUC__*/
#else
# include <sys/socket.h>
# include <sys/time.h>
#@INSERT_SYS_SELECT_H@
#endif /*!_WIN32*/
@FALLBACK_SOCKLEN_T@
/* This is required for error code compatibility. */
#define _GCRY_ERR_SOURCE_DEFAULT GPG_ERR_SOURCE_GCRYPT
#ifdef __cplusplus
extern "C" {
#if 0 /* (Keep Emacsens' auto-indent happy.) */
}
#endif
#endif
/* The version of this header should match the one of the library. It
should not be used by a program because gcry_check_version() should
return the same version. The purpose of this macro is to let
autoconf (using the AM_PATH_GCRYPT macro) check that this header
matches the installed library. */
#define GCRYPT_VERSION "@VERSION@"
/* The version number of this header. It may be used to handle minor
API incompatibilities. */
#define GCRYPT_VERSION_NUMBER @VERSION_NUMBER@
/* Internal: We can't use the convenience macros for the multi
precision integer functions when building this library. */
#ifdef _GCRYPT_IN_LIBGCRYPT
#ifndef GCRYPT_NO_MPI_MACROS
#define GCRYPT_NO_MPI_MACROS 1
#endif
#endif
/* We want to use gcc attributes when possible. Warning: Don't use
these macros in your programs: As indicated by the leading
underscore they are subject to change without notice. */
#ifdef __GNUC__
#define _GCRY_GCC_VERSION (__GNUC__ * 10000 \
+ __GNUC_MINOR__ * 100 \
+ __GNUC_PATCHLEVEL__)
#if _GCRY_GCC_VERSION >= 30100
#define _GCRY_GCC_ATTR_DEPRECATED __attribute__ ((__deprecated__))
#endif
#if _GCRY_GCC_VERSION >= 29600
#define _GCRY_GCC_ATTR_PURE __attribute__ ((__pure__))
#endif
#if _GCRY_GCC_VERSION >= 30200
#define _GCRY_GCC_ATTR_MALLOC __attribute__ ((__malloc__))
#endif
#define _GCRY_GCC_ATTR_PRINTF(f,a) __attribute__ ((format (printf,f,a)))
#if _GCRY_GCC_VERSION >= 40000
#define _GCRY_GCC_ATTR_SENTINEL(a) __attribute__ ((sentinel(a)))
#endif
#endif /*__GNUC__*/
#ifndef _GCRY_GCC_ATTR_DEPRECATED
#define _GCRY_GCC_ATTR_DEPRECATED
#endif
#ifndef _GCRY_GCC_ATTR_PURE
#define _GCRY_GCC_ATTR_PURE
#endif
#ifndef _GCRY_GCC_ATTR_MALLOC
#define _GCRY_GCC_ATTR_MALLOC
#endif
#ifndef _GCRY_GCC_ATTR_PRINTF
#define _GCRY_GCC_ATTR_PRINTF(f,a)
#endif
#ifndef _GCRY_GCC_ATTR_SENTINEL
#define _GCRY_GCC_ATTR_SENTINEL(a)
#endif
/* Make up an attribute to mark functions and types as deprecated but
allow internal use by Libgcrypt. */
#ifdef _GCRYPT_IN_LIBGCRYPT
#define _GCRY_ATTR_INTERNAL
#else
#define _GCRY_ATTR_INTERNAL _GCRY_GCC_ATTR_DEPRECATED
#endif
/* Wrappers for the libgpg-error library. */
typedef gpg_error_t gcry_error_t;
typedef gpg_err_code_t gcry_err_code_t;
typedef gpg_err_source_t gcry_err_source_t;
static GPG_ERR_INLINE gcry_error_t
gcry_err_make (gcry_err_source_t source, gcry_err_code_t code)
{
return gpg_err_make (source, code);
}
/* The user can define GPG_ERR_SOURCE_DEFAULT before including this
file to specify a default source for gpg_error. */
#ifndef GCRY_ERR_SOURCE_DEFAULT
#define GCRY_ERR_SOURCE_DEFAULT GPG_ERR_SOURCE_USER_1
#endif
static GPG_ERR_INLINE gcry_error_t
gcry_error (gcry_err_code_t code)
{
return gcry_err_make (GCRY_ERR_SOURCE_DEFAULT, code);
}
static GPG_ERR_INLINE gcry_err_code_t
gcry_err_code (gcry_error_t err)
{
return gpg_err_code (err);
}
static GPG_ERR_INLINE gcry_err_source_t
gcry_err_source (gcry_error_t err)
{
return gpg_err_source (err);
}
/* Return a pointer to a string containing a description of the error
code in the error value ERR. */
const char *gcry_strerror (gcry_error_t err);
/* Return a pointer to a string containing a description of the error
source in the error value ERR. */
const char *gcry_strsource (gcry_error_t err);
/* Retrieve the error code for the system error ERR. This returns
GPG_ERR_UNKNOWN_ERRNO if the system error is not mapped (report
this). */
gcry_err_code_t gcry_err_code_from_errno (int err);
/* Retrieve the system error for the error code CODE. This returns 0
if CODE is not a system error code. */
int gcry_err_code_to_errno (gcry_err_code_t code);
/* Return an error value with the error source SOURCE and the system
error ERR. */
gcry_error_t gcry_err_make_from_errno (gcry_err_source_t source, int err);
/* Return an error value with the system error ERR. */
gcry_error_t gcry_error_from_errno (int err);
/* NOTE: Since Libgcrypt 1.6 the thread callbacks are not anymore
used. However we keep it to allow for some source code
compatibility if used in the standard way. */
/* Constants defining the thread model to use. Used with the OPTION
field of the struct gcry_thread_cbs. */
#define GCRY_THREAD_OPTION_DEFAULT 0
#define GCRY_THREAD_OPTION_USER 1
#define GCRY_THREAD_OPTION_PTH 2
#define GCRY_THREAD_OPTION_PTHREAD 3
/* The version number encoded in the OPTION field of the struct
gcry_thread_cbs. */
#define GCRY_THREAD_OPTION_VERSION 1
/* Wrapper for struct ath_ops. */
struct gcry_thread_cbs
{
/* The OPTION field encodes the thread model and the version number
of this structure.
Bits 7 - 0 are used for the thread model
Bits 15 - 8 are used for the version number. */
unsigned int option;
} _GCRY_ATTR_INTERNAL;
#define GCRY_THREAD_OPTION_PTH_IMPL \
static struct gcry_thread_cbs gcry_threads_pth = { \
(GCRY_THREAD_OPTION_PTH | (GCRY_THREAD_OPTION_VERSION << 8))}
#define GCRY_THREAD_OPTION_PTHREAD_IMPL \
static struct gcry_thread_cbs gcry_threads_pthread = { \
(GCRY_THREAD_OPTION_PTHREAD | (GCRY_THREAD_OPTION_VERSION << 8))}
/* A generic context object as used by some functions. */
struct gcry_context;
typedef struct gcry_context *gcry_ctx_t;
/* The data objects used to hold multi precision integers. */
struct gcry_mpi;
typedef struct gcry_mpi *gcry_mpi_t;
struct gcry_mpi_point;
typedef struct gcry_mpi_point *gcry_mpi_point_t;
#ifndef GCRYPT_NO_DEPRECATED
typedef struct gcry_mpi *GCRY_MPI _GCRY_GCC_ATTR_DEPRECATED;
typedef struct gcry_mpi *GcryMPI _GCRY_GCC_ATTR_DEPRECATED;
#endif
/* A structure used for scatter gather hashing. */
typedef struct
{
size_t size; /* The allocated size of the buffer or 0. */
size_t off; /* Offset into the buffer. */
size_t len; /* The used length of the buffer. */
void *data; /* The buffer. */
} gcry_buffer_t;
/* Check that the library fulfills the version requirement. */
const char *gcry_check_version (const char *req_version);
/* Codes for function dispatchers. */
/* Codes used with the gcry_control function. */
enum gcry_ctl_cmds
{
/* Note: 1 .. 2 are not anymore used. */
GCRYCTL_CFB_SYNC = 3,
GCRYCTL_RESET = 4, /* e.g. for MDs */
GCRYCTL_FINALIZE = 5,
GCRYCTL_GET_KEYLEN = 6,
GCRYCTL_GET_BLKLEN = 7,
GCRYCTL_TEST_ALGO = 8,
GCRYCTL_IS_SECURE = 9,
GCRYCTL_GET_ASNOID = 10,
GCRYCTL_ENABLE_ALGO = 11,
GCRYCTL_DISABLE_ALGO = 12,
GCRYCTL_DUMP_RANDOM_STATS = 13,
GCRYCTL_DUMP_SECMEM_STATS = 14,
GCRYCTL_GET_ALGO_NPKEY = 15,
GCRYCTL_GET_ALGO_NSKEY = 16,
GCRYCTL_GET_ALGO_NSIGN = 17,
GCRYCTL_GET_ALGO_NENCR = 18,
GCRYCTL_SET_VERBOSITY = 19,
GCRYCTL_SET_DEBUG_FLAGS = 20,
GCRYCTL_CLEAR_DEBUG_FLAGS = 21,
GCRYCTL_USE_SECURE_RNDPOOL= 22,
GCRYCTL_DUMP_MEMORY_STATS = 23,
GCRYCTL_INIT_SECMEM = 24,
GCRYCTL_TERM_SECMEM = 25,
GCRYCTL_DISABLE_SECMEM_WARN = 27,
GCRYCTL_SUSPEND_SECMEM_WARN = 28,
GCRYCTL_RESUME_SECMEM_WARN = 29,
GCRYCTL_DROP_PRIVS = 30,
GCRYCTL_ENABLE_M_GUARD = 31,
GCRYCTL_START_DUMP = 32,
GCRYCTL_STOP_DUMP = 33,
GCRYCTL_GET_ALGO_USAGE = 34,
GCRYCTL_IS_ALGO_ENABLED = 35,
GCRYCTL_DISABLE_INTERNAL_LOCKING = 36,
GCRYCTL_DISABLE_SECMEM = 37,
GCRYCTL_INITIALIZATION_FINISHED = 38,
GCRYCTL_INITIALIZATION_FINISHED_P = 39,
GCRYCTL_ANY_INITIALIZATION_P = 40,
GCRYCTL_SET_CBC_CTS = 41,
GCRYCTL_SET_CBC_MAC = 42,
/* Note: 43 is not anymore used. */
GCRYCTL_ENABLE_QUICK_RANDOM = 44,
GCRYCTL_SET_RANDOM_SEED_FILE = 45,
GCRYCTL_UPDATE_RANDOM_SEED_FILE = 46,
GCRYCTL_SET_THREAD_CBS = 47,
GCRYCTL_FAST_POLL = 48,
GCRYCTL_SET_RANDOM_DAEMON_SOCKET = 49,
GCRYCTL_USE_RANDOM_DAEMON = 50,
GCRYCTL_FAKED_RANDOM_P = 51,
GCRYCTL_SET_RNDEGD_SOCKET = 52,
GCRYCTL_PRINT_CONFIG = 53,
GCRYCTL_OPERATIONAL_P = 54,
GCRYCTL_FIPS_MODE_P = 55,
GCRYCTL_FORCE_FIPS_MODE = 56,
GCRYCTL_SELFTEST = 57,
/* Note: 58 .. 62 are used internally. */
GCRYCTL_DISABLE_HWF = 63,
GCRYCTL_SET_ENFORCED_FIPS_FLAG = 64,
GCRYCTL_SET_PREFERRED_RNG_TYPE = 65,
GCRYCTL_GET_CURRENT_RNG_TYPE = 66,
GCRYCTL_DISABLE_LOCKED_SECMEM = 67,
GCRYCTL_DISABLE_PRIV_DROP = 68,
GCRYCTL_SET_CCM_LENGTHS = 69,
GCRYCTL_CLOSE_RANDOM_DEVICE = 70,
GCRYCTL_INACTIVATE_FIPS_FLAG = 71,
GCRYCTL_REACTIVATE_FIPS_FLAG = 72,
GCRYCTL_SET_SBOX = 73,
GCRYCTL_DRBG_REINIT = 74,
GCRYCTL_SET_TAGLEN = 75,
GCRYCTL_GET_TAGLEN = 76,
GCRYCTL_REINIT_SYSCALL_CLAMP = 77,
GCRYCTL_AUTO_EXPAND_SECMEM = 78,
GCRYCTL_SET_ALLOW_WEAK_KEY = 79,
GCRYCTL_SET_DECRYPTION_TAG = 80
};
/* Perform various operations defined by CMD. */
gcry_error_t gcry_control (enum gcry_ctl_cmds CMD, ...);
/* S-expression management. */
/* The object to represent an S-expression as used with the public key
functions. */
struct gcry_sexp;
typedef struct gcry_sexp *gcry_sexp_t;
#ifndef GCRYPT_NO_DEPRECATED
typedef struct gcry_sexp *GCRY_SEXP _GCRY_GCC_ATTR_DEPRECATED;
typedef struct gcry_sexp *GcrySexp _GCRY_GCC_ATTR_DEPRECATED;
#endif
/* The possible values for the S-expression format. */
enum gcry_sexp_format
{
GCRYSEXP_FMT_DEFAULT = 0,
GCRYSEXP_FMT_CANON = 1,
GCRYSEXP_FMT_BASE64 = 2,
GCRYSEXP_FMT_ADVANCED = 3
};
/* Create an new S-expression object from BUFFER of size LENGTH and
return it in RETSEXP. With AUTODETECT set to 0 the data in BUFFER
is expected to be in canonized format. */
gcry_error_t gcry_sexp_new (gcry_sexp_t *retsexp,
const void *buffer, size_t length,
int autodetect);
/* Same as gcry_sexp_new but allows to pass a FREEFNC which has the
effect to transfer ownership of BUFFER to the created object. */
gcry_error_t gcry_sexp_create (gcry_sexp_t *retsexp,
void *buffer, size_t length,
int autodetect, void (*freefnc) (void *));
/* Scan BUFFER and return a new S-expression object in RETSEXP. This
function expects a printf like string in BUFFER. */
gcry_error_t gcry_sexp_sscan (gcry_sexp_t *retsexp, size_t *erroff,
const char *buffer, size_t length);
/* Same as gcry_sexp_sscan but expects a string in FORMAT and can thus
only be used for certain encodings. */
gcry_error_t gcry_sexp_build (gcry_sexp_t *retsexp, size_t *erroff,
const char *format, ...);
/* Like gcry_sexp_build, but uses an array instead of variable
function arguments. */
gcry_error_t gcry_sexp_build_array (gcry_sexp_t *retsexp, size_t *erroff,
const char *format, void **arg_list);
/* Release the S-expression object SEXP */
void gcry_sexp_release (gcry_sexp_t sexp);
/* Calculate the length of an canonized S-expression in BUFFER and
check for a valid encoding. */
size_t gcry_sexp_canon_len (const unsigned char *buffer, size_t length,
size_t *erroff, gcry_error_t *errcode);
/* Copies the S-expression object SEXP into BUFFER using the format
specified in MODE. */
size_t gcry_sexp_sprint (gcry_sexp_t sexp, int mode, void *buffer,
size_t maxlength);
/* Dumps the S-expression object A in a format suitable for debugging
to Libgcrypt's logging stream. */
void gcry_sexp_dump (const gcry_sexp_t a);
gcry_sexp_t gcry_sexp_cons (const gcry_sexp_t a, const gcry_sexp_t b);
gcry_sexp_t gcry_sexp_alist (const gcry_sexp_t *array);
gcry_sexp_t gcry_sexp_vlist (const gcry_sexp_t a, ...);
gcry_sexp_t gcry_sexp_append (const gcry_sexp_t a, const gcry_sexp_t n);
gcry_sexp_t gcry_sexp_prepend (const gcry_sexp_t a, const gcry_sexp_t n);
/* Scan the S-expression for a sublist with a type (the car of the
list) matching the string TOKEN. If TOKLEN is not 0, the token is
assumed to be raw memory of this length. The function returns a
newly allocated S-expression consisting of the found sublist or
`NULL' when not found. */
gcry_sexp_t gcry_sexp_find_token (gcry_sexp_t list,
const char *tok, size_t toklen);
/* Return the length of the LIST. For a valid S-expression this
should be at least 1. */
int gcry_sexp_length (const gcry_sexp_t list);
/* Create and return a new S-expression from the element with index
NUMBER in LIST. Note that the first element has the index 0. If
there is no such element, `NULL' is returned. */
gcry_sexp_t gcry_sexp_nth (const gcry_sexp_t list, int number);
/* Create and return a new S-expression from the first element in
LIST; this called the "type" and should always exist and be a
string. `NULL' is returned in case of a problem. */
gcry_sexp_t gcry_sexp_car (const gcry_sexp_t list);
/* Create and return a new list form all elements except for the first
one. Note, that this function may return an invalid S-expression
because it is not guaranteed, that the type exists and is a string.
However, for parsing a complex S-expression it might be useful for
intermediate lists. Returns `NULL' on error. */
gcry_sexp_t gcry_sexp_cdr (const gcry_sexp_t list);
gcry_sexp_t gcry_sexp_cadr (const gcry_sexp_t list);
/* This function is used to get data from a LIST. A pointer to the
actual data with index NUMBER is returned and the length of this
data will be stored to DATALEN. If there is no data at the given
index or the index represents another list, `NULL' is returned.
*Note:* The returned pointer is valid as long as LIST is not
modified or released. */
const char *gcry_sexp_nth_data (const gcry_sexp_t list, int number,
size_t *datalen);
/* This function is used to get data from a LIST. A malloced buffer to the
data with index NUMBER is returned and the length of this
data will be stored to RLENGTH. If there is no data at the given
index or the index represents another list, `NULL' is returned. */
void *gcry_sexp_nth_buffer (const gcry_sexp_t list, int number,
size_t *rlength);
/* This function is used to get and convert data from a LIST. The
data is assumed to be a Nul terminated string. The caller must
release the returned value using `gcry_free'. If there is no data
at the given index, the index represents a list or the value can't
be converted to a string, `NULL' is returned. */
char *gcry_sexp_nth_string (gcry_sexp_t list, int number);
/* This function is used to get and convert data from a LIST. This
data is assumed to be an MPI stored in the format described by
MPIFMT and returned as a standard Libgcrypt MPI. The caller must
release this returned value using `gcry_mpi_release'. If there is
no data at the given index, the index represents a list or the
value can't be converted to an MPI, `NULL' is returned. */
gcry_mpi_t gcry_sexp_nth_mpi (gcry_sexp_t list, int number, int mpifmt);
/* Extract MPIs from an s-expression using a list of parameters. The
* names of these parameters are given by the string LIST. Some
* special characters may be given to control the conversion:
*
* + :: Switch to unsigned integer format (default).
* - :: Switch to standard signed format.
* / :: Switch to opaque format.
* & :: Switch to buffer descriptor mode - see below.
* ? :: The previous parameter is optional.
*
* In general parameter names are single letters. To use a string for
* a parameter name, enclose the name in single quotes.
*
* Unless in gcry_buffer_t mode for each parameter name a pointer to
* an MPI variable is expected that must be set to NULL prior to
* invoking this function, and finally a NULL is expected. Example:
*
* _gcry_sexp_extract_param (key, NULL, "n/x+ed",
* &mpi_n, &mpi_x, &mpi_e, NULL)
*
* This stores the parameter "N" from KEY as an unsigned MPI into
* MPI_N, the parameter "X" as an opaque MPI into MPI_X, and the
* parameter "E" again as an unsigned MPI into MPI_E.
*
* If in buffer descriptor mode a pointer to gcry_buffer_t descriptor
* is expected instead of a pointer to an MPI. The caller may use two
* different operation modes: If the DATA field of the provided buffer
* descriptor is NULL, the function allocates a new buffer and stores
* it at DATA; the other fields are set accordingly with OFF being 0.
* If DATA is not NULL, the function assumes that DATA, SIZE, and OFF
* describe a buffer where to but the data; on return the LEN field
* receives the number of bytes copied to that buffer; if the buffer
* is too small, the function immediately returns with an error code
* (and LEN set to 0).
*
* PATH is an optional string used to locate a token. The exclamation
* mark separated tokens are used to via gcry_sexp_find_token to find
* a start point inside SEXP.
*
* The function returns 0 on success. On error an error code is
* returned, all passed MPIs that might have been allocated up to this
* point are deallocated and set to NULL, and all passed buffers are
* either truncated if the caller supplied the buffer, or deallocated
* if the function allocated the buffer.
*/
gpg_error_t gcry_sexp_extract_param (gcry_sexp_t sexp,
const char *path,
const char *list,
...) _GCRY_GCC_ATTR_SENTINEL(0);
/*******************************************
* *
* Multi Precision Integer Functions *
* *
*******************************************/
/* Different formats of external big integer representation. */
enum gcry_mpi_format
{
GCRYMPI_FMT_NONE= 0,
GCRYMPI_FMT_STD = 1, /* Twos complement stored without length. */
GCRYMPI_FMT_PGP = 2, /* As used by OpenPGP (unsigned only). */
GCRYMPI_FMT_SSH = 3, /* As used by SSH (like STD but with length). */
GCRYMPI_FMT_HEX = 4, /* Hex format. */
GCRYMPI_FMT_USG = 5, /* Like STD but unsigned. */
GCRYMPI_FMT_OPAQUE = 8 /* Opaque format (some functions only). */
};
/* Flags used for creating big integers. */
enum gcry_mpi_flag
{
GCRYMPI_FLAG_SECURE = 1, /* Allocate the number in "secure" memory. */
GCRYMPI_FLAG_OPAQUE = 2, /* The number is not a real one but just
a way to store some bytes. This is
useful for encrypted big integers. */
GCRYMPI_FLAG_IMMUTABLE = 4, /* Mark the MPI as immutable. */
GCRYMPI_FLAG_CONST = 8, /* Mark the MPI as a constant. */
GCRYMPI_FLAG_USER1 = 0x0100,/* User flag 1. */
GCRYMPI_FLAG_USER2 = 0x0200,/* User flag 2. */
GCRYMPI_FLAG_USER3 = 0x0400,/* User flag 3. */
GCRYMPI_FLAG_USER4 = 0x0800 /* User flag 4. */
};
/* Macros to return pre-defined MPI constants. */
#define GCRYMPI_CONST_ONE (_gcry_mpi_get_const (1))
#define GCRYMPI_CONST_TWO (_gcry_mpi_get_const (2))
#define GCRYMPI_CONST_THREE (_gcry_mpi_get_const (3))
#define GCRYMPI_CONST_FOUR (_gcry_mpi_get_const (4))
#define GCRYMPI_CONST_EIGHT (_gcry_mpi_get_const (8))
/* Allocate a new big integer object, initialize it with 0 and
initially allocate memory for a number of at least NBITS. */
gcry_mpi_t gcry_mpi_new (unsigned int nbits);
/* Same as gcry_mpi_new() but allocate in "secure" memory. */
gcry_mpi_t gcry_mpi_snew (unsigned int nbits);
/* Release the number A and free all associated resources. */
void gcry_mpi_release (gcry_mpi_t a);
/* Create a new number with the same value as A. */
gcry_mpi_t gcry_mpi_copy (const gcry_mpi_t a);
/* Store the big integer value U in W and release U. */
void gcry_mpi_snatch (gcry_mpi_t w, gcry_mpi_t u);
/* Store the big integer value U in W. */
gcry_mpi_t gcry_mpi_set (gcry_mpi_t w, const gcry_mpi_t u);
/* Store the unsigned integer value U in W. */
gcry_mpi_t gcry_mpi_set_ui (gcry_mpi_t w, unsigned long u);
/* Store U as an unsigned int at W or return GPG_ERR_ERANGE. */
gpg_error_t gcry_mpi_get_ui (unsigned int *w, gcry_mpi_t u);
/* Swap the values of A and B. */
void gcry_mpi_swap (gcry_mpi_t a, gcry_mpi_t b);
/* Return 1 if A is negative; 0 if zero or positive. */
int gcry_mpi_is_neg (gcry_mpi_t a);
/* W = - U */
void gcry_mpi_neg (gcry_mpi_t w, gcry_mpi_t u);
/* W = [W] */
void gcry_mpi_abs (gcry_mpi_t w);
/* Compare the big integer number U and V returning 0 for equality, a
positive value for U > V and a negative for U < V. */
int gcry_mpi_cmp (const gcry_mpi_t u, const gcry_mpi_t v);
/* Compare the big integer number U with the unsigned integer V
returning 0 for equality, a positive value for U > V and a negative
for U < V. */
int gcry_mpi_cmp_ui (const gcry_mpi_t u, unsigned long v);
/* Convert the external representation of an integer stored in BUFFER
with a length of BUFLEN into a newly create MPI returned in
RET_MPI. If NSCANNED is not NULL, it will receive the number of
bytes actually scanned after a successful operation. */
gcry_error_t gcry_mpi_scan (gcry_mpi_t *ret_mpi, enum gcry_mpi_format format,
const void *buffer, size_t buflen,
size_t *nscanned);
/* Convert the big integer A into the external representation
described by FORMAT and store it in the provided BUFFER which has
been allocated by the user with a size of BUFLEN bytes. NWRITTEN
receives the actual length of the external representation unless it
has been passed as NULL. */
gcry_error_t gcry_mpi_print (enum gcry_mpi_format format,
unsigned char *buffer, size_t buflen,
size_t *nwritten,
const gcry_mpi_t a);
/* Convert the big integer A into the external representation described
by FORMAT and store it in a newly allocated buffer which address
will be put into BUFFER. NWRITTEN receives the actual lengths of the
external representation. */
gcry_error_t gcry_mpi_aprint (enum gcry_mpi_format format,
unsigned char **buffer, size_t *nwritten,
const gcry_mpi_t a);
/* Dump the value of A in a format suitable for debugging to
Libgcrypt's logging stream. Note that one leading space but no
trailing space or linefeed will be printed. It is okay to pass
NULL for A. */
void gcry_mpi_dump (const gcry_mpi_t a);
/* W = U + V. */
void gcry_mpi_add (gcry_mpi_t w, gcry_mpi_t u, gcry_mpi_t v);
/* W = U + V. V is an unsigned integer. */
void gcry_mpi_add_ui (gcry_mpi_t w, gcry_mpi_t u, unsigned long v);
/* W = U + V mod M. */
void gcry_mpi_addm (gcry_mpi_t w, gcry_mpi_t u, gcry_mpi_t v, gcry_mpi_t m);
/* W = U - V. */
void gcry_mpi_sub (gcry_mpi_t w, gcry_mpi_t u, gcry_mpi_t v);
/* W = U - V. V is an unsigned integer. */
void gcry_mpi_sub_ui (gcry_mpi_t w, gcry_mpi_t u, unsigned long v );
/* W = U - V mod M */
void gcry_mpi_subm (gcry_mpi_t w, gcry_mpi_t u, gcry_mpi_t v, gcry_mpi_t m);
/* W = U * V. */
void gcry_mpi_mul (gcry_mpi_t w, gcry_mpi_t u, gcry_mpi_t v);
/* W = U * V. V is an unsigned integer. */
void gcry_mpi_mul_ui (gcry_mpi_t w, gcry_mpi_t u, unsigned long v );
/* W = U * V mod M. */
void gcry_mpi_mulm (gcry_mpi_t w, gcry_mpi_t u, gcry_mpi_t v, gcry_mpi_t m);
/* W = U * (2 ^ CNT). */
void gcry_mpi_mul_2exp (gcry_mpi_t w, gcry_mpi_t u, unsigned long cnt);
/* Q = DIVIDEND / DIVISOR, R = DIVIDEND % DIVISOR,
Q or R may be passed as NULL. ROUND should be negative or 0. */
void gcry_mpi_div (gcry_mpi_t q, gcry_mpi_t r,
gcry_mpi_t dividend, gcry_mpi_t divisor, int round);
/* R = DIVIDEND % DIVISOR */
void gcry_mpi_mod (gcry_mpi_t r, gcry_mpi_t dividend, gcry_mpi_t divisor);
/* W = B ^ E mod M. */
void gcry_mpi_powm (gcry_mpi_t w,
const gcry_mpi_t b, const gcry_mpi_t e,
const gcry_mpi_t m);
/* Set G to the greatest common divisor of A and B.
Return true if the G is 1. */
int gcry_mpi_gcd (gcry_mpi_t g, gcry_mpi_t a, gcry_mpi_t b);
/* Set X to the multiplicative inverse of A mod M.
Return true if the value exists. */
int gcry_mpi_invm (gcry_mpi_t x, gcry_mpi_t a, gcry_mpi_t m);
/* Create a new point object. NBITS is usually 0. */
gcry_mpi_point_t gcry_mpi_point_new (unsigned int nbits);
/* Release the object POINT. POINT may be NULL. */
void gcry_mpi_point_release (gcry_mpi_point_t point);
/* Return a copy of POINT. */
gcry_mpi_point_t gcry_mpi_point_copy (gcry_mpi_point_t point);
/* Store the projective coordinates from POINT into X, Y, and Z. */
void gcry_mpi_point_get (gcry_mpi_t x, gcry_mpi_t y, gcry_mpi_t z,
gcry_mpi_point_t point);
/* Store the projective coordinates from POINT into X, Y, and Z and
release POINT. */
void gcry_mpi_point_snatch_get (gcry_mpi_t x, gcry_mpi_t y, gcry_mpi_t z,
gcry_mpi_point_t point);
/* Store the projective coordinates X, Y, and Z into POINT. */
gcry_mpi_point_t gcry_mpi_point_set (gcry_mpi_point_t point,
gcry_mpi_t x, gcry_mpi_t y, gcry_mpi_t z);
/* Store the projective coordinates X, Y, and Z into POINT and release
X, Y, and Z. */
gcry_mpi_point_t gcry_mpi_point_snatch_set (gcry_mpi_point_t point,
gcry_mpi_t x, gcry_mpi_t y,
gcry_mpi_t z);
/* Allocate a new context for elliptic curve operations based on the
parameters given by KEYPARAM or using CURVENAME. */
gpg_error_t gcry_mpi_ec_new (gcry_ctx_t *r_ctx,
gcry_sexp_t keyparam, const char *curvename);
/* Get a named MPI from an elliptic curve context. */
gcry_mpi_t gcry_mpi_ec_get_mpi (const char *name, gcry_ctx_t ctx, int copy);
/* Get a named point from an elliptic curve context. */
gcry_mpi_point_t gcry_mpi_ec_get_point (const char *name,
gcry_ctx_t ctx, int copy);
/* Store a named MPI into an elliptic curve context. */
gpg_error_t gcry_mpi_ec_set_mpi (const char *name, gcry_mpi_t newvalue,
gcry_ctx_t ctx);
/* Store a named point into an elliptic curve context. */
gpg_error_t gcry_mpi_ec_set_point (const char *name, gcry_mpi_point_t newvalue,
gcry_ctx_t ctx);
/* Decode and store VALUE into RESULT. */
gpg_error_t gcry_mpi_ec_decode_point (gcry_mpi_point_t result,
gcry_mpi_t value, gcry_ctx_t ctx);
/* Store the affine coordinates of POINT into X and Y. */
int gcry_mpi_ec_get_affine (gcry_mpi_t x, gcry_mpi_t y, gcry_mpi_point_t point,
gcry_ctx_t ctx);
/* W = 2 * U. */
void gcry_mpi_ec_dup (gcry_mpi_point_t w, gcry_mpi_point_t u, gcry_ctx_t ctx);
/* W = U + V. */
void gcry_mpi_ec_add (gcry_mpi_point_t w,
gcry_mpi_point_t u, gcry_mpi_point_t v, gcry_ctx_t ctx);
/* W = U - V. */
void gcry_mpi_ec_sub (gcry_mpi_point_t w,
gcry_mpi_point_t u, gcry_mpi_point_t v, gcry_ctx_t ctx);
/* W = N * U. */
void gcry_mpi_ec_mul (gcry_mpi_point_t w, gcry_mpi_t n, gcry_mpi_point_t u,
gcry_ctx_t ctx);
/* Return true if POINT is on the curve described by CTX. */
int gcry_mpi_ec_curve_point (gcry_mpi_point_t w, gcry_ctx_t ctx);
/* Return the number of bits required to represent A. */
unsigned int gcry_mpi_get_nbits (gcry_mpi_t a);
/* Return true when bit number N (counting from 0) is set in A. */
int gcry_mpi_test_bit (gcry_mpi_t a, unsigned int n);
/* Set bit number N in A. */
void gcry_mpi_set_bit (gcry_mpi_t a, unsigned int n);
/* Clear bit number N in A. */
void gcry_mpi_clear_bit (gcry_mpi_t a, unsigned int n);
/* Set bit number N in A and clear all bits greater than N. */
void gcry_mpi_set_highbit (gcry_mpi_t a, unsigned int n);
/* Clear bit number N in A and all bits greater than N. */
void gcry_mpi_clear_highbit (gcry_mpi_t a, unsigned int n);
/* Shift the value of A by N bits to the right and store the result in X. */
void gcry_mpi_rshift (gcry_mpi_t x, gcry_mpi_t a, unsigned int n);
/* Shift the value of A by N bits to the left and store the result in X. */
void gcry_mpi_lshift (gcry_mpi_t x, gcry_mpi_t a, unsigned int n);
/* Store NBITS of the value P points to in A and mark A as an opaque
value. On success A received the the ownership of the value P.
WARNING: Never use an opaque MPI for anything thing else than
gcry_mpi_release, gcry_mpi_get_opaque. */
gcry_mpi_t gcry_mpi_set_opaque (gcry_mpi_t a, void *p, unsigned int nbits);
/* Store NBITS of the value P points to in A and mark A as an opaque
value. The function takes a copy of the provided value P.
WARNING: Never use an opaque MPI for anything thing else than
gcry_mpi_release, gcry_mpi_get_opaque. */
gcry_mpi_t gcry_mpi_set_opaque_copy (gcry_mpi_t a,
const void *p, unsigned int nbits);
/* Return a pointer to an opaque value stored in A and return its size
in NBITS. Note that the returned pointer is still owned by A and
that the function should never be used for an non-opaque MPI. */
void *gcry_mpi_get_opaque (gcry_mpi_t a, unsigned int *nbits);
/* Set the FLAG for the big integer A. Currently only the flag
GCRYMPI_FLAG_SECURE is allowed to convert A into an big intger
stored in "secure" memory. */
void gcry_mpi_set_flag (gcry_mpi_t a, enum gcry_mpi_flag flag);
/* Clear FLAG for the big integer A. Note that this function is
currently useless as no flags are allowed. */
void gcry_mpi_clear_flag (gcry_mpi_t a, enum gcry_mpi_flag flag);
/* Return true if the FLAG is set for A. */
int gcry_mpi_get_flag (gcry_mpi_t a, enum gcry_mpi_flag flag);
/* Private function - do not use. */
gcry_mpi_t _gcry_mpi_get_const (int no);
/* Unless the GCRYPT_NO_MPI_MACROS is used, provide a couple of
convenience macros for the big integer functions. */
#ifndef GCRYPT_NO_MPI_MACROS
#define mpi_new(n) gcry_mpi_new( (n) )
#define mpi_secure_new( n ) gcry_mpi_snew( (n) )
#define mpi_release(a) \
do \
{ \
gcry_mpi_release ((a)); \
(a) = NULL; \
} \
while (0)
#define mpi_copy( a ) gcry_mpi_copy( (a) )
#define mpi_snatch( w, u) gcry_mpi_snatch( (w), (u) )
#define mpi_set( w, u) gcry_mpi_set( (w), (u) )
#define mpi_set_ui( w, u) gcry_mpi_set_ui( (w), (u) )
#define mpi_get_ui( w, u) gcry_mpi_get_ui( (w), (u) )
#define mpi_abs( w ) gcry_mpi_abs( (w) )
#define mpi_neg( w, u) gcry_mpi_neg( (w), (u) )
#define mpi_cmp( u, v ) gcry_mpi_cmp( (u), (v) )
#define mpi_cmp_ui( u, v ) gcry_mpi_cmp_ui( (u), (v) )
#define mpi_is_neg( a ) gcry_mpi_is_neg ((a))
#define mpi_add_ui(w,u,v) gcry_mpi_add_ui((w),(u),(v))
#define mpi_add(w,u,v) gcry_mpi_add ((w),(u),(v))
#define mpi_addm(w,u,v,m) gcry_mpi_addm ((w),(u),(v),(m))
#define mpi_sub_ui(w,u,v) gcry_mpi_sub_ui ((w),(u),(v))
#define mpi_sub(w,u,v) gcry_mpi_sub ((w),(u),(v))
#define mpi_subm(w,u,v,m) gcry_mpi_subm ((w),(u),(v),(m))
#define mpi_mul_ui(w,u,v) gcry_mpi_mul_ui ((w),(u),(v))
#define mpi_mul_2exp(w,u,v) gcry_mpi_mul_2exp ((w),(u),(v))
#define mpi_mul(w,u,v) gcry_mpi_mul ((w),(u),(v))
#define mpi_mulm(w,u,v,m) gcry_mpi_mulm ((w),(u),(v),(m))
#define mpi_powm(w,b,e,m) gcry_mpi_powm ( (w), (b), (e), (m) )
#define mpi_tdiv(q,r,a,m) gcry_mpi_div ( (q), (r), (a), (m), 0)
#define mpi_fdiv(q,r,a,m) gcry_mpi_div ( (q), (r), (a), (m), -1)
#define mpi_mod(r,a,m) gcry_mpi_mod ((r), (a), (m))
#define mpi_gcd(g,a,b) gcry_mpi_gcd ( (g), (a), (b) )
#define mpi_invm(g,a,b) gcry_mpi_invm ( (g), (a), (b) )
#define mpi_point_new(n) gcry_mpi_point_new((n))
#define mpi_point_release(p) \
do \
{ \
gcry_mpi_point_release ((p)); \
(p) = NULL; \
} \
while (0)
#define mpi_point_copy(p) gcry_mpi_point_copy((p))
#define mpi_point_get(x,y,z,p) gcry_mpi_point_get((x),(y),(z),(p))
#define mpi_point_snatch_get(x,y,z,p) gcry_mpi_point_snatch_get((x),(y),(z),(p))
#define mpi_point_set(p,x,y,z) gcry_mpi_point_set((p),(x),(y),(z))
#define mpi_point_snatch_set(p,x,y,z) gcry_mpi_point_snatch_set((p),(x),(y),(z))
#define mpi_get_nbits(a) gcry_mpi_get_nbits ((a))
#define mpi_test_bit(a,b) gcry_mpi_test_bit ((a),(b))
#define mpi_set_bit(a,b) gcry_mpi_set_bit ((a),(b))
#define mpi_set_highbit(a,b) gcry_mpi_set_highbit ((a),(b))
#define mpi_clear_bit(a,b) gcry_mpi_clear_bit ((a),(b))
#define mpi_clear_highbit(a,b) gcry_mpi_clear_highbit ((a),(b))
#define mpi_rshift(a,b,c) gcry_mpi_rshift ((a),(b),(c))
#define mpi_lshift(a,b,c) gcry_mpi_lshift ((a),(b),(c))
#define mpi_set_opaque(a,b,c) gcry_mpi_set_opaque( (a), (b), (c) )
#define mpi_get_opaque(a,b) gcry_mpi_get_opaque( (a), (b) )
#endif /* GCRYPT_NO_MPI_MACROS */
/************************************
* *
* Symmetric Cipher Functions *
* *
************************************/
/* The data object used to hold a handle to an encryption object. */
struct gcry_cipher_handle;
typedef struct gcry_cipher_handle *gcry_cipher_hd_t;
#ifndef GCRYPT_NO_DEPRECATED
typedef struct gcry_cipher_handle *GCRY_CIPHER_HD _GCRY_GCC_ATTR_DEPRECATED;
typedef struct gcry_cipher_handle *GcryCipherHd _GCRY_GCC_ATTR_DEPRECATED;
#endif
/* All symmetric encryption algorithms are identified by their IDs.
More IDs may be registered at runtime. */
enum gcry_cipher_algos
{
GCRY_CIPHER_NONE = 0,
GCRY_CIPHER_IDEA = 1,
GCRY_CIPHER_3DES = 2,
GCRY_CIPHER_CAST5 = 3,
GCRY_CIPHER_BLOWFISH = 4,
GCRY_CIPHER_SAFER_SK128 = 5,
GCRY_CIPHER_DES_SK = 6,
GCRY_CIPHER_AES = 7,
GCRY_CIPHER_AES192 = 8,
GCRY_CIPHER_AES256 = 9,
GCRY_CIPHER_TWOFISH = 10,
/* Other cipher numbers are above 300 for OpenPGP reasons. */
GCRY_CIPHER_ARCFOUR = 301, /* Fully compatible with RSA's RC4 (tm). */
GCRY_CIPHER_DES = 302, /* Yes, this is single key 56 bit DES. */
GCRY_CIPHER_TWOFISH128 = 303,
GCRY_CIPHER_SERPENT128 = 304,
GCRY_CIPHER_SERPENT192 = 305,
GCRY_CIPHER_SERPENT256 = 306,
GCRY_CIPHER_RFC2268_40 = 307, /* Ron's Cipher 2 (40 bit). */
GCRY_CIPHER_RFC2268_128 = 308, /* Ron's Cipher 2 (128 bit). */
GCRY_CIPHER_SEED = 309, /* 128 bit cipher described in RFC4269. */
GCRY_CIPHER_CAMELLIA128 = 310,
GCRY_CIPHER_CAMELLIA192 = 311,
GCRY_CIPHER_CAMELLIA256 = 312,
GCRY_CIPHER_SALSA20 = 313,
GCRY_CIPHER_SALSA20R12 = 314,
GCRY_CIPHER_GOST28147 = 315,
GCRY_CIPHER_CHACHA20 = 316,
GCRY_CIPHER_GOST28147_MESH = 317, /* With CryptoPro key meshing. */
GCRY_CIPHER_SM4 = 318
};
/* The Rijndael algorithm is basically AES, so provide some macros. */
#define GCRY_CIPHER_AES128 GCRY_CIPHER_AES
#define GCRY_CIPHER_RIJNDAEL GCRY_CIPHER_AES
#define GCRY_CIPHER_RIJNDAEL128 GCRY_CIPHER_AES128
#define GCRY_CIPHER_RIJNDAEL192 GCRY_CIPHER_AES192
#define GCRY_CIPHER_RIJNDAEL256 GCRY_CIPHER_AES256
/* The supported encryption modes. Note that not all of them are
supported for each algorithm. */
enum gcry_cipher_modes
{
GCRY_CIPHER_MODE_NONE = 0, /* Not yet specified. */
GCRY_CIPHER_MODE_ECB = 1, /* Electronic codebook. */
GCRY_CIPHER_MODE_CFB = 2, /* Cipher feedback. */
GCRY_CIPHER_MODE_CBC = 3, /* Cipher block chaining. */
GCRY_CIPHER_MODE_STREAM = 4, /* Used with stream ciphers. */
GCRY_CIPHER_MODE_OFB = 5, /* Outer feedback. */
GCRY_CIPHER_MODE_CTR = 6, /* Counter. */
GCRY_CIPHER_MODE_AESWRAP = 7, /* AES-WRAP algorithm. */
GCRY_CIPHER_MODE_CCM = 8, /* Counter with CBC-MAC. */
GCRY_CIPHER_MODE_GCM = 9, /* Galois Counter Mode. */
GCRY_CIPHER_MODE_POLY1305 = 10, /* Poly1305 based AEAD mode. */
GCRY_CIPHER_MODE_OCB = 11, /* OCB3 mode. */
GCRY_CIPHER_MODE_CFB8 = 12, /* Cipher feedback (8 bit mode). */
GCRY_CIPHER_MODE_XTS = 13, /* XTS mode. */
GCRY_CIPHER_MODE_EAX = 14, /* EAX mode. */
GCRY_CIPHER_MODE_SIV = 15, /* SIV mode. */
GCRY_CIPHER_MODE_GCM_SIV = 16 /* GCM-SIV mode. */
};
/* Flags used with the open function. */
enum gcry_cipher_flags
{
GCRY_CIPHER_SECURE = 1, /* Allocate in secure memory. */
GCRY_CIPHER_ENABLE_SYNC = 2, /* Enable CFB sync mode. */
GCRY_CIPHER_CBC_CTS = 4, /* Enable CBC cipher text stealing (CTS). */
GCRY_CIPHER_CBC_MAC = 8 /* Enable CBC message auth. code (MAC). */
};
/* GCM works only with blocks of 128 bits */
#define GCRY_GCM_BLOCK_LEN (128 / 8)
/* CCM works only with blocks of 128 bits. */
#define GCRY_CCM_BLOCK_LEN (128 / 8)
/* OCB works only with blocks of 128 bits. */
#define GCRY_OCB_BLOCK_LEN (128 / 8)
/* XTS works only with blocks of 128 bits. */
#define GCRY_XTS_BLOCK_LEN (128 / 8)
/* SIV and GCM-SIV works only with blocks of 128 bits */
#define GCRY_SIV_BLOCK_LEN (128 / 8)
/* Create a handle for algorithm ALGO to be used in MODE. FLAGS may
be given as an bitwise OR of the gcry_cipher_flags values. */
gcry_error_t gcry_cipher_open (gcry_cipher_hd_t *handle,
int algo, int mode, unsigned int flags);
/* Close the cipher handle H and release all resource. */
void gcry_cipher_close (gcry_cipher_hd_t h);
/* Perform various operations on the cipher object H. */
gcry_error_t gcry_cipher_ctl (gcry_cipher_hd_t h, int cmd, void *buffer,
size_t buflen);
/* Retrieve various information about the cipher object H. */
gcry_error_t gcry_cipher_info (gcry_cipher_hd_t h, int what, void *buffer,
size_t *nbytes);
/* Retrieve various information about the cipher algorithm ALGO. */
gcry_error_t gcry_cipher_algo_info (int algo, int what, void *buffer,
size_t *nbytes);
/* Map the cipher algorithm whose ID is contained in ALGORITHM to a
string representation of the algorithm name. For unknown algorithm
IDs this function returns "?". */
const char *gcry_cipher_algo_name (int algorithm) _GCRY_GCC_ATTR_PURE;
/* Map the algorithm name NAME to an cipher algorithm ID. Return 0 if
the algorithm name is not known. */
int gcry_cipher_map_name (const char *name) _GCRY_GCC_ATTR_PURE;
/* Given an ASN.1 object identifier in standard IETF dotted decimal
format in STRING, return the encryption mode associated with that
OID or 0 if not known or applicable. */
int gcry_cipher_mode_from_oid (const char *string) _GCRY_GCC_ATTR_PURE;
/* Encrypt the plaintext of size INLEN in IN using the cipher handle H
into the buffer OUT which has an allocated length of OUTSIZE. For
most algorithms it is possible to pass NULL for in and 0 for INLEN
and do a in-place decryption of the data provided in OUT. */
gcry_error_t gcry_cipher_encrypt (gcry_cipher_hd_t h,
void *out, size_t outsize,
const void *in, size_t inlen);
/* The counterpart to gcry_cipher_encrypt. */
gcry_error_t gcry_cipher_decrypt (gcry_cipher_hd_t h,
void *out, size_t outsize,
const void *in, size_t inlen);
/* Set KEY of length KEYLEN bytes for the cipher handle HD. */
gcry_error_t gcry_cipher_setkey (gcry_cipher_hd_t hd,
const void *key, size_t keylen);
/* Set initialization vector IV of length IVLEN for the cipher handle HD. */
gcry_error_t gcry_cipher_setiv (gcry_cipher_hd_t hd,
const void *iv, size_t ivlen);
/* Provide additional authentication data for AEAD modes/ciphers. */
gcry_error_t gcry_cipher_authenticate (gcry_cipher_hd_t hd, const void *abuf,
size_t abuflen);
/* Get authentication tag for AEAD modes/ciphers. */
gcry_error_t gcry_cipher_gettag (gcry_cipher_hd_t hd, void *outtag,
size_t taglen);
/* Check authentication tag for AEAD modes/ciphers. */
gcry_error_t gcry_cipher_checktag (gcry_cipher_hd_t hd, const void *intag,
size_t taglen);
/* Reset the handle to the state after open. */
#define gcry_cipher_reset(h) gcry_cipher_ctl ((h), GCRYCTL_RESET, NULL, 0)
/* Perform the OpenPGP sync operation if this is enabled for the
cipher handle H. */
#define gcry_cipher_sync(h) gcry_cipher_ctl( (h), GCRYCTL_CFB_SYNC, NULL, 0)
/* Enable or disable CTS in future calls to gcry_encrypt(). CBC mode only. */
#define gcry_cipher_cts(h,on) gcry_cipher_ctl( (h), GCRYCTL_SET_CBC_CTS, \
NULL, on )
#define gcry_cipher_set_sbox(h,oid) gcry_cipher_ctl( (h), GCRYCTL_SET_SBOX, \
(void *) oid, 0);
/* Indicate to the encrypt and decrypt functions that the next call
provides the final data. Only used with some modes. */
#define gcry_cipher_final(a) \
gcry_cipher_ctl ((a), GCRYCTL_FINALIZE, NULL, 0)
/* Set counter for CTR mode. (CTR,CTRLEN) must denote a buffer of
block size length, or (NULL,0) to set the CTR to the all-zero block. */
gpg_error_t gcry_cipher_setctr (gcry_cipher_hd_t hd,
const void *ctr, size_t ctrlen);
/* Retrieve the key length in bytes used with algorithm A. */
size_t gcry_cipher_get_algo_keylen (int algo);
/* Retrieve the block length in bytes used with algorithm A. */
size_t gcry_cipher_get_algo_blklen (int algo);
/* Return 0 if the algorithm A is available for use. */
#define gcry_cipher_test_algo(a) \
gcry_cipher_algo_info( (a), GCRYCTL_TEST_ALGO, NULL, NULL )
/* Setup tag for decryption (for SIV and GCM-SIV mode). */
#define gcry_cipher_set_decryption_tag(a, tag, taglen) \
gcry_cipher_ctl ((a), GCRYCTL_SET_DECRYPTION_TAG, \
(void *)(tag), (taglen))
/************************************
* *
* Asymmetric Cipher Functions *
* *
************************************/
/* The algorithms and their IDs we support. */
enum gcry_pk_algos
{
GCRY_PK_RSA = 1, /* RSA */
GCRY_PK_RSA_E = 2, /* (deprecated: use 1). */
GCRY_PK_RSA_S = 3, /* (deprecated: use 1). */
GCRY_PK_ELG_E = 16, /* (deprecated: use 20). */
GCRY_PK_DSA = 17, /* Digital Signature Algorithm. */
GCRY_PK_ECC = 18, /* Generic ECC. */
GCRY_PK_ELG = 20, /* Elgamal */
GCRY_PK_ECDSA = 301, /* (only for external use). */
GCRY_PK_ECDH = 302, /* (only for external use). */
GCRY_PK_EDDSA = 303 /* (only for external use). */
};
/* Flags describing usage capabilities of a PK algorithm. */
#define GCRY_PK_USAGE_SIGN 1 /* Good for signatures. */
#define GCRY_PK_USAGE_ENCR 2 /* Good for encryption. */
#define GCRY_PK_USAGE_CERT 4 /* Good to certify other keys. */
#define GCRY_PK_USAGE_AUTH 8 /* Good for authentication. */
#define GCRY_PK_USAGE_UNKN 128 /* Unknown usage flag. */
/* Modes used with gcry_pubkey_get_sexp. */
#define GCRY_PK_GET_PUBKEY 1
#define GCRY_PK_GET_SECKEY 2
/* Encrypt the DATA using the public key PKEY and store the result as
a newly created S-expression at RESULT. */
gcry_error_t gcry_pk_encrypt (gcry_sexp_t *result,
gcry_sexp_t data, gcry_sexp_t pkey);
/* Decrypt the DATA using the private key SKEY and store the result as
a newly created S-expression at RESULT. */
gcry_error_t gcry_pk_decrypt (gcry_sexp_t *result,
gcry_sexp_t data, gcry_sexp_t skey);
/* Sign the DATA using the private key SKEY and store the result as
a newly created S-expression at RESULT. */
gcry_error_t gcry_pk_sign (gcry_sexp_t *result,
gcry_sexp_t data, gcry_sexp_t skey);
/* Check the signature SIGVAL on DATA using the public key PKEY. */
gcry_error_t gcry_pk_verify (gcry_sexp_t sigval,
gcry_sexp_t data, gcry_sexp_t pkey);
/* Check that private KEY is sane. */
gcry_error_t gcry_pk_testkey (gcry_sexp_t key);
/* Generate a new key pair according to the parameters given in
S_PARMS. The new key pair is returned in as an S-expression in
R_KEY. */
gcry_error_t gcry_pk_genkey (gcry_sexp_t *r_key, gcry_sexp_t s_parms);
/* Catch all function for miscellaneous operations. */
gcry_error_t gcry_pk_ctl (int cmd, void *buffer, size_t buflen);
/* Retrieve information about the public key algorithm ALGO. */
gcry_error_t gcry_pk_algo_info (int algo, int what,
void *buffer, size_t *nbytes);
/* Map the public key algorithm whose ID is contained in ALGORITHM to
a string representation of the algorithm name. For unknown
algorithm IDs this functions returns "?". */
const char *gcry_pk_algo_name (int algorithm) _GCRY_GCC_ATTR_PURE;
/* Map the algorithm NAME to a public key algorithm Id. Return 0 if
the algorithm name is not known. */
int gcry_pk_map_name (const char* name) _GCRY_GCC_ATTR_PURE;
/* Return what is commonly referred as the key length for the given
public or private KEY. */
unsigned int gcry_pk_get_nbits (gcry_sexp_t key) _GCRY_GCC_ATTR_PURE;
/* Return the so called KEYGRIP which is the SHA-1 hash of the public
key parameters expressed in a way depending on the algorithm. */
unsigned char *gcry_pk_get_keygrip (gcry_sexp_t key, unsigned char *array);
/* Return the name of the curve matching KEY. */
const char *gcry_pk_get_curve (gcry_sexp_t key, int iterator,
unsigned int *r_nbits);
/* Return an S-expression with the parameters of the named ECC curve
NAME. ALGO must be set to an ECC algorithm. */
gcry_sexp_t gcry_pk_get_param (int algo, const char *name);
/* Return 0 if the public key algorithm A is available for use. */
#define gcry_pk_test_algo(a) \
gcry_pk_algo_info( (a), GCRYCTL_TEST_ALGO, NULL, NULL )
/* Return an S-expression representing the context CTX. */
gcry_error_t gcry_pubkey_get_sexp (gcry_sexp_t *r_sexp,
int mode, gcry_ctx_t ctx);
/* The data object used to hold a handle to a public key object. */
struct gcry_pkey_handle;
typedef struct gcry_pkey_handle *gcry_pkey_hd_t;
/* Algorithm IDs for the public key functions we know about. */
enum gcry_pkey_algos
{
GCRY_PKEY_NONE = 0,
GCRY_PKEY_RSA = 1,
GCRY_PKEY_DSA = 17,
GCRY_PKEY_ECC = 18,
GCRY_PKEY_ELG = 20
};
#define GCRY_PKEY_FLAG_SECRET (1 << 0) /* It has secret part. */
#define GCRY_PKEY_FLAG_PREHASH (1 << 1)
#define GCRY_PKEY_FLAG_CONTEXT (1 << 2)
enum gcry_pkey_curves
{
GCRY_PKEY_CURVE_ED25519,
GCRY_PKEY_CURVE_ED448,
GCRY_PKEY_CURVE_NIST_P192,
GCRY_PKEY_CURVE_NIST_P224,
GCRY_PKEY_CURVE_NIST_P256,
GCRY_PKEY_CURVE_NIST_P384,
GCRY_PKEY_CURVE_NIST_P521
};
enum gcry_pkey_rsa_schemes
{
GCRY_PKEY_RSA_PSS,
GCRY_PKEY_RSA_931,
GCRY_PKEY_RSA_15
};
enum gcry_pkey_ops
{
GCRY_PKEY_OP_VERIFY,
GCRY_PKEY_OP_SIGN,
+ GCRY_PKEY_OP_DECRYPT,
GCRY_PKEY_OP_ECDH
};
gcry_error_t gcry_pkey_open (gcry_pkey_hd_t *h_p, int algo, unsigned int flags, ...);
gcry_error_t gcry_pkey_ctl (gcry_pkey_hd_t h, int cmd,
void *buffer, size_t buflen);
gcry_error_t gcry_pkey_op (gcry_pkey_hd_t h, int cmd,
int num_in, const unsigned char *const in[],
const size_t in_len[],
int num_out, unsigned char *out[], size_t out_len[]);
void gcry_pkey_close (gcry_pkey_hd_t h);
/************************************
* *
* Modern ECC Functions *
* *
************************************/
/* The curves we support. */
enum gcry_ecc_curves
{
GCRY_ECC_CURVE25519 = 1,
GCRY_ECC_CURVE448 = 2
};
/* Get the length of point to prepare buffer for the result. */
unsigned int gcry_ecc_get_algo_keylen (int curveid);
/* Convenience function to compute scalar multiplication of the
* Montgomery form of curve. */
gpg_error_t gcry_ecc_mul_point (int curveid, unsigned char *result,
const unsigned char *scalar,
const unsigned char *point);
/************************************
* *
* Cryptograhic Hash Functions *
* *
************************************/
/* Algorithm IDs for the hash functions we know about. Not all of them
are implemented. */
enum gcry_md_algos
{
GCRY_MD_NONE = 0,
GCRY_MD_MD5 = 1,
GCRY_MD_SHA1 = 2,
GCRY_MD_RMD160 = 3,
GCRY_MD_MD2 = 5,
GCRY_MD_TIGER = 6, /* TIGER/192 as used by gpg <= 1.3.2. */
GCRY_MD_HAVAL = 7, /* HAVAL, 5 pass, 160 bit. */
GCRY_MD_SHA256 = 8,
GCRY_MD_SHA384 = 9,
GCRY_MD_SHA512 = 10,
GCRY_MD_SHA224 = 11,
GCRY_MD_MD4 = 301,
GCRY_MD_CRC32 = 302,
GCRY_MD_CRC32_RFC1510 = 303,
GCRY_MD_CRC24_RFC2440 = 304,
GCRY_MD_WHIRLPOOL = 305,
GCRY_MD_TIGER1 = 306, /* TIGER fixed. */
GCRY_MD_TIGER2 = 307, /* TIGER2 variant. */
GCRY_MD_GOSTR3411_94 = 308, /* GOST R 34.11-94. */
GCRY_MD_STRIBOG256 = 309, /* GOST R 34.11-2012, 256 bit. */
GCRY_MD_STRIBOG512 = 310, /* GOST R 34.11-2012, 512 bit. */
GCRY_MD_GOSTR3411_CP = 311, /* GOST R 34.11-94 with CryptoPro-A S-Box. */
GCRY_MD_SHA3_224 = 312,
GCRY_MD_SHA3_256 = 313,
GCRY_MD_SHA3_384 = 314,
GCRY_MD_SHA3_512 = 315,
GCRY_MD_SHAKE128 = 316,
GCRY_MD_SHAKE256 = 317,
GCRY_MD_BLAKE2B_512 = 318,
GCRY_MD_BLAKE2B_384 = 319,
GCRY_MD_BLAKE2B_256 = 320,
GCRY_MD_BLAKE2B_160 = 321,
GCRY_MD_BLAKE2S_256 = 322,
GCRY_MD_BLAKE2S_224 = 323,
GCRY_MD_BLAKE2S_160 = 324,
GCRY_MD_BLAKE2S_128 = 325,
GCRY_MD_SM3 = 326,
GCRY_MD_SHA512_256 = 327,
GCRY_MD_SHA512_224 = 328
};
/* Flags used with the open function. */
enum gcry_md_flags
{
GCRY_MD_FLAG_SECURE = 1, /* Allocate all buffers in "secure" memory. */
GCRY_MD_FLAG_HMAC = 2, /* Make an HMAC out of this algorithm. */
GCRY_MD_FLAG_BUGEMU1 = 0x0100
};
/* (Forward declaration.) */
struct gcry_md_context;
/* This object is used to hold a handle to a message digest object.
This structure is private - only to be used by the public gcry_md_*
macros. */
typedef struct gcry_md_handle
{
/* Actual context. */
struct gcry_md_context *ctx;
/* Buffer management. */
int bufpos;
int bufsize;
unsigned char buf[1];
} *gcry_md_hd_t;
/* Compatibility types, do not use them. */
#ifndef GCRYPT_NO_DEPRECATED
typedef struct gcry_md_handle *GCRY_MD_HD _GCRY_GCC_ATTR_DEPRECATED;
typedef struct gcry_md_handle *GcryMDHd _GCRY_GCC_ATTR_DEPRECATED;
#endif
/* Create a message digest object for algorithm ALGO. FLAGS may be
given as an bitwise OR of the gcry_md_flags values. ALGO may be
given as 0 if the algorithms to be used are later set using
gcry_md_enable. */
gcry_error_t gcry_md_open (gcry_md_hd_t *h, int algo, unsigned int flags);
/* Release the message digest object HD. */
void gcry_md_close (gcry_md_hd_t hd);
/* Add the message digest algorithm ALGO to the digest object HD. */
gcry_error_t gcry_md_enable (gcry_md_hd_t hd, int algo);
/* Create a new digest object as an exact copy of the object HD. */
gcry_error_t gcry_md_copy (gcry_md_hd_t *bhd, gcry_md_hd_t ahd);
/* Reset the digest object HD to its initial state. */
void gcry_md_reset (gcry_md_hd_t hd);
/* Perform various operations on the digest object HD. */
gcry_error_t gcry_md_ctl (gcry_md_hd_t hd, int cmd,
void *buffer, size_t buflen);
/* Pass LENGTH bytes of data in BUFFER to the digest object HD so that
it can update the digest values. This is the actual hash
function. */
void gcry_md_write (gcry_md_hd_t hd, const void *buffer, size_t length);
/* Read out the final digest from HD return the digest value for
algorithm ALGO. */
unsigned char *gcry_md_read (gcry_md_hd_t hd, int algo);
/* Read more output from algorithm ALGO to BUFFER of size LENGTH from
* digest object HD. Algorithm needs to be 'expendable-output function'. */
gpg_error_t gcry_md_extract (gcry_md_hd_t hd, int algo, void *buffer,
size_t length);
/* Convenience function to calculate the hash from the data in BUFFER
of size LENGTH using the algorithm ALGO avoiding the creation of a
hash object. The hash is returned in the caller provided buffer
DIGEST which must be large enough to hold the digest of the given
algorithm. */
void gcry_md_hash_buffer (int algo, void *digest,
const void *buffer, size_t length);
/* Convenience function to hash multiple buffers. */
gpg_error_t gcry_md_hash_buffers (int algo, unsigned int flags, void *digest,
const gcry_buffer_t *iov, int iovcnt);
/* Retrieve the algorithm used with HD. This does not work reliable
if more than one algorithm is enabled in HD. */
int gcry_md_get_algo (gcry_md_hd_t hd);
/* Retrieve the length in bytes of the digest yielded by algorithm
ALGO. */
unsigned int gcry_md_get_algo_dlen (int algo);
/* Return true if the the algorithm ALGO is enabled in the digest
object A. */
int gcry_md_is_enabled (gcry_md_hd_t a, int algo);
/* Return true if the digest object A is allocated in "secure" memory. */
int gcry_md_is_secure (gcry_md_hd_t a);
/* Deprecated: Use gcry_md_is_enabled or gcry_md_is_secure. */
gcry_error_t gcry_md_info (gcry_md_hd_t h, int what, void *buffer,
size_t *nbytes) _GCRY_ATTR_INTERNAL;
/* Retrieve various information about the algorithm ALGO. */
gcry_error_t gcry_md_algo_info (int algo, int what, void *buffer,
size_t *nbytes);
/* Map the digest algorithm id ALGO to a string representation of the
algorithm name. For unknown algorithms this function returns
"?". */
const char *gcry_md_algo_name (int algo) _GCRY_GCC_ATTR_PURE;
/* Map the algorithm NAME to a digest algorithm Id. Return 0 if
the algorithm name is not known. */
int gcry_md_map_name (const char* name) _GCRY_GCC_ATTR_PURE;
/* For use with the HMAC feature, the set MAC key to the KEY of
KEYLEN bytes. */
gcry_error_t gcry_md_setkey (gcry_md_hd_t hd, const void *key, size_t keylen);
/* Start or stop debugging for digest handle HD; i.e. create a file
named dbgmd-<n>.<suffix> while hashing. If SUFFIX is NULL,
debugging stops and the file will be closed. */
void gcry_md_debug (gcry_md_hd_t hd, const char *suffix);
/* Update the hash(s) of H with the character C. This is a buffered
version of the gcry_md_write function. */
#define gcry_md_putc(h,c) \
do { \
gcry_md_hd_t h__ = (h); \
if( (h__)->bufpos == (h__)->bufsize ) \
gcry_md_write( (h__), NULL, 0 ); \
(h__)->buf[(h__)->bufpos++] = (c) & 0xff; \
} while(0)
/* Finalize the digest calculation. This is not really needed because
gcry_md_read() does this implicitly. */
#define gcry_md_final(a) \
gcry_md_ctl ((a), GCRYCTL_FINALIZE, NULL, 0)
/* Return 0 if the algorithm A is available for use. */
#define gcry_md_test_algo(a) \
gcry_md_algo_info( (a), GCRYCTL_TEST_ALGO, NULL, NULL )
/* Return an DER encoded ASN.1 OID for the algorithm A in buffer B. N
must point to size_t variable with the available size of buffer B.
After return it will receive the actual size of the returned
OID. */
#define gcry_md_get_asnoid(a,b,n) \
gcry_md_algo_info((a), GCRYCTL_GET_ASNOID, (b), (n))
/**********************************************
* *
* Message Authentication Code Functions *
* *
**********************************************/
/* The data object used to hold a handle to an encryption object. */
struct gcry_mac_handle;
typedef struct gcry_mac_handle *gcry_mac_hd_t;
/* Algorithm IDs for the hash functions we know about. Not all of them
are implemented. */
enum gcry_mac_algos
{
GCRY_MAC_NONE = 0,
GCRY_MAC_GOST28147_IMIT = 1,
GCRY_MAC_HMAC_SHA256 = 101,
GCRY_MAC_HMAC_SHA224 = 102,
GCRY_MAC_HMAC_SHA512 = 103,
GCRY_MAC_HMAC_SHA384 = 104,
GCRY_MAC_HMAC_SHA1 = 105,
GCRY_MAC_HMAC_MD5 = 106,
GCRY_MAC_HMAC_MD4 = 107,
GCRY_MAC_HMAC_RMD160 = 108,
GCRY_MAC_HMAC_TIGER1 = 109, /* The fixed TIGER variant */
GCRY_MAC_HMAC_WHIRLPOOL = 110,
GCRY_MAC_HMAC_GOSTR3411_94 = 111,
GCRY_MAC_HMAC_STRIBOG256 = 112,
GCRY_MAC_HMAC_STRIBOG512 = 113,
GCRY_MAC_HMAC_MD2 = 114,
GCRY_MAC_HMAC_SHA3_224 = 115,
GCRY_MAC_HMAC_SHA3_256 = 116,
GCRY_MAC_HMAC_SHA3_384 = 117,
GCRY_MAC_HMAC_SHA3_512 = 118,
GCRY_MAC_HMAC_GOSTR3411_CP = 119,
GCRY_MAC_HMAC_BLAKE2B_512 = 120,
GCRY_MAC_HMAC_BLAKE2B_384 = 121,
GCRY_MAC_HMAC_BLAKE2B_256 = 122,
GCRY_MAC_HMAC_BLAKE2B_160 = 123,
GCRY_MAC_HMAC_BLAKE2S_256 = 124,
GCRY_MAC_HMAC_BLAKE2S_224 = 125,
GCRY_MAC_HMAC_BLAKE2S_160 = 126,
GCRY_MAC_HMAC_BLAKE2S_128 = 127,
GCRY_MAC_HMAC_SM3 = 128,
GCRY_MAC_HMAC_SHA512_256 = 129,
GCRY_MAC_HMAC_SHA512_224 = 130,
GCRY_MAC_CMAC_AES = 201,
GCRY_MAC_CMAC_3DES = 202,
GCRY_MAC_CMAC_CAMELLIA = 203,
GCRY_MAC_CMAC_CAST5 = 204,
GCRY_MAC_CMAC_BLOWFISH = 205,
GCRY_MAC_CMAC_TWOFISH = 206,
GCRY_MAC_CMAC_SERPENT = 207,
GCRY_MAC_CMAC_SEED = 208,
GCRY_MAC_CMAC_RFC2268 = 209,
GCRY_MAC_CMAC_IDEA = 210,
GCRY_MAC_CMAC_GOST28147 = 211,
GCRY_MAC_CMAC_SM4 = 212,
GCRY_MAC_GMAC_AES = 401,
GCRY_MAC_GMAC_CAMELLIA = 402,
GCRY_MAC_GMAC_TWOFISH = 403,
GCRY_MAC_GMAC_SERPENT = 404,
GCRY_MAC_GMAC_SEED = 405,
GCRY_MAC_POLY1305 = 501,
GCRY_MAC_POLY1305_AES = 502,
GCRY_MAC_POLY1305_CAMELLIA = 503,
GCRY_MAC_POLY1305_TWOFISH = 504,
GCRY_MAC_POLY1305_SERPENT = 505,
GCRY_MAC_POLY1305_SEED = 506
};
/* Flags used with the open function. */
enum gcry_mac_flags
{
GCRY_MAC_FLAG_SECURE = 1 /* Allocate all buffers in "secure" memory. */
};
/* Create a MAC handle for algorithm ALGO. FLAGS may be given as an bitwise OR
of the gcry_mac_flags values. CTX maybe NULL or gcry_ctx_t object to be
associated with HANDLE. */
gcry_error_t gcry_mac_open (gcry_mac_hd_t *handle, int algo,
unsigned int flags, gcry_ctx_t ctx);
/* Close the MAC handle H and release all resource. */
void gcry_mac_close (gcry_mac_hd_t h);
/* Perform various operations on the MAC object H. */
gcry_error_t gcry_mac_ctl (gcry_mac_hd_t h, int cmd, void *buffer,
size_t buflen);
/* Retrieve various information about the MAC algorithm ALGO. */
gcry_error_t gcry_mac_algo_info (int algo, int what, void *buffer,
size_t *nbytes);
/* Set KEY of length KEYLEN bytes for the MAC handle HD. */
gcry_error_t gcry_mac_setkey (gcry_mac_hd_t hd, const void *key,
size_t keylen);
/* Set initialization vector IV of length IVLEN for the MAC handle HD. */
gcry_error_t gcry_mac_setiv (gcry_mac_hd_t hd, const void *iv,
size_t ivlen);
/* Pass LENGTH bytes of data in BUFFER to the MAC object HD so that
it can update the MAC values. */
gcry_error_t gcry_mac_write (gcry_mac_hd_t hd, const void *buffer,
size_t length);
/* Read out the final authentication code from the MAC object HD to BUFFER. */
gcry_error_t gcry_mac_read (gcry_mac_hd_t hd, void *buffer, size_t *buflen);
/* Verify the final authentication code from the MAC object HD with BUFFER. */
gcry_error_t gcry_mac_verify (gcry_mac_hd_t hd, const void *buffer,
size_t buflen);
/* Retrieve the algorithm used with MAC. */
int gcry_mac_get_algo (gcry_mac_hd_t hd);
/* Retrieve the length in bytes of the MAC yielded by algorithm ALGO. */
unsigned int gcry_mac_get_algo_maclen (int algo);
/* Retrieve the default key length in bytes used with algorithm A. */
unsigned int gcry_mac_get_algo_keylen (int algo);
/* Map the MAC algorithm whose ID is contained in ALGORITHM to a
string representation of the algorithm name. For unknown algorithm
IDs this function returns "?". */
const char *gcry_mac_algo_name (int algorithm) _GCRY_GCC_ATTR_PURE;
/* Map the algorithm name NAME to an MAC algorithm ID. Return 0 if
the algorithm name is not known. */
int gcry_mac_map_name (const char *name) _GCRY_GCC_ATTR_PURE;
/* Reset the handle to the state after open/setkey. */
#define gcry_mac_reset(h) gcry_mac_ctl ((h), GCRYCTL_RESET, NULL, 0)
/* Return 0 if the algorithm A is available for use. */
#define gcry_mac_test_algo(a) \
gcry_mac_algo_info( (a), GCRYCTL_TEST_ALGO, NULL, NULL )
/******************************
* *
* Key Derivation Functions *
* *
******************************/
/* Algorithm IDs for the KDFs. */
enum gcry_kdf_algos
{
GCRY_KDF_NONE = 0,
GCRY_KDF_SIMPLE_S2K = 16,
GCRY_KDF_SALTED_S2K = 17,
GCRY_KDF_ITERSALTED_S2K = 19,
GCRY_KDF_PBKDF1 = 33,
GCRY_KDF_PBKDF2 = 34,
GCRY_KDF_SCRYPT = 48
};
/* Derive a key from a passphrase. */
gpg_error_t gcry_kdf_derive (const void *passphrase, size_t passphraselen,
int algo, int subalgo,
const void *salt, size_t saltlen,
unsigned long iterations,
size_t keysize, void *keybuffer);
/************************************
* *
* Random Generating Functions *
* *
************************************/
/* The type of the random number generator. */
enum gcry_rng_types
{
GCRY_RNG_TYPE_STANDARD = 1, /* The default CSPRNG generator. */
GCRY_RNG_TYPE_FIPS = 2, /* The FIPS X9.31 AES generator. */
GCRY_RNG_TYPE_SYSTEM = 3 /* The system's native generator. */
};
/* The possible values for the random quality. The rule of thumb is
to use STRONG for session keys and VERY_STRONG for key material.
WEAK is usually an alias for STRONG and should not be used anymore
(except with gcry_mpi_randomize); use gcry_create_nonce instead. */
typedef enum gcry_random_level
{
GCRY_WEAK_RANDOM = 0,
GCRY_STRONG_RANDOM = 1,
GCRY_VERY_STRONG_RANDOM = 2
}
gcry_random_level_t;
/* Fill BUFFER with LENGTH bytes of random, using random numbers of
quality LEVEL. */
void gcry_randomize (void *buffer, size_t length,
enum gcry_random_level level);
/* Add the external random from BUFFER with LENGTH bytes into the
pool. QUALITY should either be -1 for unknown or in the range of 0
to 100 */
gcry_error_t gcry_random_add_bytes (const void *buffer, size_t length,
int quality);
/* If random numbers are used in an application, this macro should be
called from time to time so that new stuff gets added to the
internal pool of the RNG. */
#define gcry_fast_random_poll() gcry_control (GCRYCTL_FAST_POLL, NULL)
/* Return NBYTES of allocated random using a random numbers of quality
LEVEL. */
void *gcry_random_bytes (size_t nbytes, enum gcry_random_level level)
_GCRY_GCC_ATTR_MALLOC;
/* Return NBYTES of allocated random using a random numbers of quality
LEVEL. The random is returned in "secure" memory. */
void *gcry_random_bytes_secure (size_t nbytes, enum gcry_random_level level)
_GCRY_GCC_ATTR_MALLOC;
/* Set the big integer W to a random value of NBITS using a random
generator with quality LEVEL. Note that by using a level of
GCRY_WEAK_RANDOM gcry_create_nonce is used internally. */
void gcry_mpi_randomize (gcry_mpi_t w,
unsigned int nbits, enum gcry_random_level level);
/* Create an unpredicable nonce of LENGTH bytes in BUFFER. */
void gcry_create_nonce (void *buffer, size_t length);
/*******************************/
/* */
/* Prime Number Functions */
/* */
/*******************************/
/* Mode values passed to a gcry_prime_check_func_t. */
#define GCRY_PRIME_CHECK_AT_FINISH 0
#define GCRY_PRIME_CHECK_AT_GOT_PRIME 1
#define GCRY_PRIME_CHECK_AT_MAYBE_PRIME 2
/* The function should return 1 if the operation shall continue, 0 to
reject the prime candidate. */
typedef int (*gcry_prime_check_func_t) (void *arg, int mode,
gcry_mpi_t candidate);
/* Flags for gcry_prime_generate(): */
/* Allocate prime numbers and factors in secure memory. */
#define GCRY_PRIME_FLAG_SECRET (1 << 0)
/* Make sure that at least one prime factor is of size
`FACTOR_BITS'. */
#define GCRY_PRIME_FLAG_SPECIAL_FACTOR (1 << 1)
/* Generate a new prime number of PRIME_BITS bits and store it in
PRIME. If FACTOR_BITS is non-zero, one of the prime factors of
(prime - 1) / 2 must be FACTOR_BITS bits long. If FACTORS is
non-zero, allocate a new, NULL-terminated array holding the prime
factors and store it in FACTORS. FLAGS might be used to influence
the prime number generation process. */
gcry_error_t gcry_prime_generate (gcry_mpi_t *prime,
unsigned int prime_bits,
unsigned int factor_bits,
gcry_mpi_t **factors,
gcry_prime_check_func_t cb_func,
void *cb_arg,
gcry_random_level_t random_level,
unsigned int flags);
/* Find a generator for PRIME where the factorization of (prime-1) is
in the NULL terminated array FACTORS. Return the generator as a
newly allocated MPI in R_G. If START_G is not NULL, use this as
the start for the search. */
gcry_error_t gcry_prime_group_generator (gcry_mpi_t *r_g,
gcry_mpi_t prime,
gcry_mpi_t *factors,
gcry_mpi_t start_g);
/* Convenience function to release the FACTORS array. */
void gcry_prime_release_factors (gcry_mpi_t *factors);
/* Check whether the number X is prime. */
gcry_error_t gcry_prime_check (gcry_mpi_t x, unsigned int flags);
/************************************
* *
* Miscellaneous Stuff *
* *
************************************/
/* Release the context object CTX. */
void gcry_ctx_release (gcry_ctx_t ctx);
/* Log data using Libgcrypt's own log interface. */
void gcry_log_debug (const char *fmt, ...) _GCRY_GCC_ATTR_PRINTF(1,2);
void gcry_log_debughex (const char *text, const void *buffer, size_t length);
void gcry_log_debugmpi (const char *text, gcry_mpi_t mpi);
void gcry_log_debugpnt (const char *text,
gcry_mpi_point_t point, gcry_ctx_t ctx);
void gcry_log_debugsxp (const char *text, gcry_sexp_t sexp);
char *gcry_get_config (int mode, const char *what);
/* Log levels used by the internal logging facility. */
enum gcry_log_levels
{
GCRY_LOG_CONT = 0, /* (Continue the last log line.) */
GCRY_LOG_INFO = 10,
GCRY_LOG_WARN = 20,
GCRY_LOG_ERROR = 30,
GCRY_LOG_FATAL = 40,
GCRY_LOG_BUG = 50,
GCRY_LOG_DEBUG = 100
};
/* Type for progress handlers. */
typedef void (*gcry_handler_progress_t) (void *, const char *, int, int, int);
/* Type for memory allocation handlers. */
typedef void *(*gcry_handler_alloc_t) (size_t n);
/* Type for secure memory check handlers. */
typedef int (*gcry_handler_secure_check_t) (const void *);
/* Type for memory reallocation handlers. */
typedef void *(*gcry_handler_realloc_t) (void *p, size_t n);
/* Type for memory free handlers. */
typedef void (*gcry_handler_free_t) (void *);
/* Type for out-of-memory handlers. */
typedef int (*gcry_handler_no_mem_t) (void *, size_t, unsigned int);
/* Type for fatal error handlers. */
typedef void (*gcry_handler_error_t) (void *, int, const char *);
/* Type for logging handlers. */
typedef void (*gcry_handler_log_t) (void *, int, const char *, va_list);
/* Certain operations can provide progress information. This function
is used to register a handler for retrieving these information. */
void gcry_set_progress_handler (gcry_handler_progress_t cb, void *cb_data);
/* Register a custom memory allocation functions. */
void gcry_set_allocation_handler (
gcry_handler_alloc_t func_alloc,
gcry_handler_alloc_t func_alloc_secure,
gcry_handler_secure_check_t func_secure_check,
gcry_handler_realloc_t func_realloc,
gcry_handler_free_t func_free);
/* Register a function used instead of the internal out of memory
handler. */
void gcry_set_outofcore_handler (gcry_handler_no_mem_t h, void *opaque);
/* Register a function used instead of the internal fatal error
handler. */
void gcry_set_fatalerror_handler (gcry_handler_error_t fnc, void *opaque);
/* Register a function used instead of the internal logging
facility. */
void gcry_set_log_handler (gcry_handler_log_t f, void *opaque);
/* Reserved for future use. */
void gcry_set_gettext_handler (const char *(*f)(const char*));
/* Libgcrypt uses its own memory allocation. It is important to use
gcry_free () to release memory allocated by libgcrypt. */
void *gcry_malloc (size_t n) _GCRY_GCC_ATTR_MALLOC;
void *gcry_calloc (size_t n, size_t m) _GCRY_GCC_ATTR_MALLOC;
void *gcry_malloc_secure (size_t n) _GCRY_GCC_ATTR_MALLOC;
void *gcry_calloc_secure (size_t n, size_t m) _GCRY_GCC_ATTR_MALLOC;
void *gcry_realloc (void *a, size_t n);
char *gcry_strdup (const char *string) _GCRY_GCC_ATTR_MALLOC;
void *gcry_xmalloc (size_t n) _GCRY_GCC_ATTR_MALLOC;
void *gcry_xcalloc (size_t n, size_t m) _GCRY_GCC_ATTR_MALLOC;
void *gcry_xmalloc_secure (size_t n) _GCRY_GCC_ATTR_MALLOC;
void *gcry_xcalloc_secure (size_t n, size_t m) _GCRY_GCC_ATTR_MALLOC;
void *gcry_xrealloc (void *a, size_t n);
char *gcry_xstrdup (const char * a) _GCRY_GCC_ATTR_MALLOC;
void gcry_free (void *a);
/* Return true if A is allocated in "secure" memory. */
int gcry_is_secure (const void *a) _GCRY_GCC_ATTR_PURE;
/* Return true if Libgcrypt is in FIPS mode. */
#define gcry_fips_mode_active() !!gcry_control (GCRYCTL_FIPS_MODE_P, 0)
/* Variant of gcry_pk_sign which takes as additional parameter a HD
* handle for hash and an optional context. The hash algorithm used by the
* handle needs to be enabled and input needs to be supplied beforehand.
* DATA-TMPL specifies a template to compose an S-expression to be signed.
* The hash handle must not yet been finalized; the function
* takes a copy of the state and does a finalize on the copy. This
* function shall be used if a policy requires that hashing and signing
* is done by the same function. CTX is currently not used and should
* be passed as NULL. */
gcry_error_t gcry_pk_hash_sign (gcry_sexp_t *result,
const char *data_tmpl, gcry_sexp_t skey,
gcry_md_hd_t hd, gcry_ctx_t ctx);
/* Variant of gcry_pk_verify which takes as additional parameter a HD
* handle for hash and an optional context. Similar to gcry_pk_hash_sign. */
gcry_error_t gcry_pk_hash_verify (gcry_sexp_t sigval,
const char *data_tmpl, gcry_sexp_t pkey,
gcry_md_hd_t hd, gcry_ctx_t ctx);
gcry_error_t gcry_pk_random_override_new (gcry_ctx_t *r_ctx,
const unsigned char *p, size_t len);
#if 0 /* (Keep Emacsens' auto-indent happy.) */
{
#endif
#ifdef __cplusplus
}
#endif
#endif /* _GCRYPT_H */
/*
@emacs_local_vars_begin@
@emacs_local_vars_read_only@
@emacs_local_vars_end@
*/
diff --git a/tests/Makefile.am b/tests/Makefile.am
index a0bd0942..7def3eb3 100644
--- a/tests/Makefile.am
+++ b/tests/Makefile.am
@@ -1,118 +1,118 @@
# Copyright (C) 2001, 2002, 2003, 2005 Free Software Foundation, Inc.
#
# This file is part of Libgcrypt.
#
# Libgcrypt is free software; you can redistribute it and/or modify
# it under the terms of the GNU Lesser General Public License as
# published by the Free Software Foundation; either version 2.1 of
# the License, or (at your option) any later version.
#
# Libgcrypt is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
## Process this file with automake to produce Makefile.in
# Note: Please keep these tests in sync with those in testdrv.c.
# We will eventually switch over to the the new driver but as of now
# the driver is only used for cross-compiling.
tests_bin = \
version t-secmem mpitests t-sexp t-convert \
t-mpi-bit t-mpi-point curves t-lock \
prime basic keygen pubkey hmac hashtest t-kdf keygrip \
fips186-dsa aeswrap pkcs1v2 random dsa-rfc6979 \
t-ed25519 t-cv25519 t-x448 t-ed448 \
- t-rsa-pss t-rsa-15 t-rsa-931 \
+ t-rsa-pss t-rsa-15 t-rsa-931 t-rsa-dec \
t-dsa t-ecdsa t-ecc-cdh
tests_bin_last = benchmark bench-slope
tests_sh = basic-disable-all-hwf
tests_sh_last = hashtest-256g
TESTS = $(tests_bin) $(tests_sh) $(tests_bin_last) $(tests_sh_last)
# Force sequential run of some tests.
bench-slope.log: benchmark.log
hashtest-256g.log: bench-slope.log
TESTS_ENVIRONMENT = GCRYPT_IN_REGRESSION_TEST=1
# Need to include ../src in addition to top_srcdir because gcrypt.h is
# a built header.
AM_CPPFLAGS = -I../src -I$(top_srcdir)/src
AM_CFLAGS = $(GPG_ERROR_CFLAGS)
AM_LDFLAGS = -no-install
standard_ldadd = \
../src/libgcrypt.la \
../compat/libcompat.la
EXTRA_PROGRAMS = testapi pkbench
noinst_PROGRAMS = testdrv $(tests_bin) $(tests_bin_last) \
fipsdrv rsacvt genhashdata gchash
noinst_HEADERS = t-common.h
CLEANFILES = testdrv-build
EXTRA_DIST = README rsa-16k.key cavs_tests.sh cavs_driver.pl \
pkcs1v2-oaep.h pkcs1v2-pss.h pkcs1v2-v15c.h pkcs1v2-v15s.h \
t-rsa-pss.inp t-rsa-15.inp t-rsa-931.inp \
t-dsa.inp t-ecdsa.inp t-ecc-cdh.inp \
t-ed25519.inp t-ed25519-rfc8032.inp \
t-ed448.inp stopwatch.h hashtest-256g.in \
sha3-224.h sha3-256.h sha3-384.h sha3-512.h \
blake2b.h blake2s.h \
basic-disable-all-hwf.in basic_all_hwfeature_combinations.sh
LDADD = $(standard_ldadd) $(GPG_ERROR_LIBS) @LDADD_FOR_TESTS_KLUDGE@
pkbench_LDADD = $(standard_ldadd) @LDADD_FOR_TESTS_KLUDGE@
prime_LDADD = $(standard_ldadd) @LDADD_FOR_TESTS_KLUDGE@
t_mpi_bit_LDADD = $(standard_ldadd) @LDADD_FOR_TESTS_KLUDGE@
t_secmem_LDADD = $(standard_ldadd) @LDADD_FOR_TESTS_KLUDGE@
testapi_LDADD = $(standard_ldadd) @LDADD_FOR_TESTS_KLUDGE@
t_lock_LDADD = $(standard_ldadd) $(GPG_ERROR_MT_LIBS) @LDADD_FOR_TESTS_KLUDGE@
t_lock_CFLAGS = $(GPG_ERROR_MT_CFLAGS)
testdrv_LDADD = $(LDADD_FOR_TESTS_KLUDGE)
# Build a version of the test driver for the build platform.
testdrv-build: testdrv.c
$(CC_FOR_BUILD) $(CFLAGS_FOR_BUILD) $(LDFLAGS_FOR_BUILD) \
$(CPPFLAGS_FOR_BUILD) -DTESTDRV_EXEEXT=\"$(EXEEXT)\" \
-o $@ $(srcdir)/testdrv.c
if HAVE_W32_SYSTEM
xtestsuite_libs = ../src/.libs/libgcrypt-20.dll \
$(prefix)/bin/libgpg-error*-0.dll
xtestsuite_driver = .libs/testdrv.exe
else
xtestsuite_libs = ../src/.libs/libgcrypt.so*
xtestsuite_driver = testdrv
endif
# xcheck uses our new testdrv instead of the automake test runner.
.PHONY: xcheck xtestsuite
xcheck: testdrv$(EXEEXT)
srcdir=$(srcdir) ./testdrv$(EXEEXT) --verbose
# Make a tarballs with all the tests.
xtestsuite: testdrv$(EXEEXT) testdrv-build $(TESTS)
+(set -e; \
name="$(PACKAGE_TARNAME)-tests-$(PACKAGE_VERSION)";\
xname="$$name/$(host)" ;\
rm -rf $$name; mkdir $$name ; mkdir $$xname ;\
cp -L $(xtestsuite_driver) \
$$(srcdir=$(srcdir) ./testdrv-build --files|sort|uniq) $$xname/ ;\
cp -P $(xtestsuite_libs) $$xname/ ;\
touch $$xname/libgcrypt-standalone-tests ;\
$(AMTAR) czf "$(PACKAGE_TARNAME)-tests-$(PACKAGE_VERSION)".tar.gz \
$$name ;\
)
diff --git a/tests/t-rsa-dec.inp b/tests/t-rsa-dec.inp
index 2c2e25dc..9d9c767e 100644
--- a/tests/t-rsa-dec.inp
+++ b/tests/t-rsa-dec.inp
@@ -1,671 +1,670 @@
# CAVS 15.1
# "RSADP Component (from SP800-56B)" information for "test4"
# Combination tested: Mod Size 1024 2048
# REQUIREMENT: At least 10 of each of the 30 sets of values for each mod
# size must exercise Step 1 of the RSADP: "If the ciphertext
# representative c is not between 0 and n-1, output "ciphertext
# representative out of range" and stop"
# If this requirement is not met, the test will fail and IUT should
# be asked to rerun with correct number of tests.
# Generated on Wed Sept 18 16:02:07 2013
[mod = 1024]
COUNT = 0
n = d0b750c8554b64c7a9d34d068e020fb52fea1b39c47971a359f0eec5da0437ea3fc94597d8dbff5444f6ce5a3293ac89b1eebb3f712b3ad6a06386e6401985e19898715b1ea32ac03456fe1796d31ed4af389f4f675c23c421a125491e740fdac4322ec2d46ec945ddc349227b492191c9049145fb2f8c2998c486a840eac4d3
e = 859e499b8a186c8ee6196954170eb8068593f0d764150a6d2e5d3fea7d9d0d33ac553eecd5c3f27a310115d283e49377820195c8e67781b6f112a625b14b747fa4cc13d06eba0917246c775f5c732865701ae9349ea8729cde0bbade38204e63359a46e672a8d0a2fd530069
d = 27b7119a09edb827c13418c820b522a1ee08de0e4bb28106db6bb91498a3b361ab293af83fefcdd8a6bd2134ca4afacf64a0e33c014f48f47530f8847cc9185cbedec0d9238c8f1d5498f71c7c0cff48dc213421742e34350ca94007753cc0e5a783264cf49ff644ffea94253cfe86859acd2a2276ca4e7215f8ebaa2f188f51
c = 6cf87c6a65925df6719eef5f1262edc6f8a0a0a0d21c535c64580745d9a268a95b50ff3be24ba8b649ca47c3a760b71ddc3903f36aa1d98e87c53b3370be784bffcb5bc180dea2acc15bb12e681c889b89b8f3de78050019dcdbb68c051b04b880f0f8c4e855321ffed89767fc9d4a8a27a5d82ba450b2478c21e11843c2f539
Result = Pass
k = 5c7bce723cf4da053e503147242c60678c67e8c22467f0336b6d5c31f14088cb3d6cefb648db132cb32e95092f3d9bcd1cab51e68bd3a892ab359cdff556785ae06708633d39a0618f9d6d70f6bdeb6b777e7dd9acc41f19560c71a68479c8a07b14fb9a4c765fd292ae56dd2f2143b62649cc70fb604fdc5cc1ade6e29de235
c^d = 5c7bce723cf4da053e503147242c60678c67e8c22467f0336b6d5c31f14088cb3d6cefb648db132cb32e95092f3d9bcd1cab51e68bd3a892ab359cdff556785ae06708633d39a0618f9d6d70f6bdeb6b777e7dd9acc41f19560c71a68479c8a07b14fb9a4c765fd292ae56dd2f2143b62649cc70fb604fdc5cc1ade6e29de235
k^e = 6cf87c6a65925df6719eef5f1262edc6f8a0a0a0d21c535c64580745d9a268a95b50ff3be24ba8b649ca47c3a760b71ddc3903f36aa1d98e87c53b3370be784bffcb5bc180dea2acc15bb12e681c889b89b8f3de78050019dcdbb68c051b04b880f0f8c4e855321ffed89767fc9d4a8a27a5d82ba450b2478c21e11843c2f539
COUNT = 1
n = c8883f0573e9a5f512fb65ed0adf2649b03237edf4faa6b259f89d7ed59d30d6fe052ef8dd68c9d672c9ac4ddb1edcf0102b8214dbd8478c7c87dfca0ad26cf5a9f73701e8525e059d1be2c568b42e39d0549bb772ed43135a39c79071b76e6604a05523be68ffa9b1c28f37f30bdb0bf78ddd85daff7054c9ab471bb483a065
e = a9e9df5a55fe9eeccd16fd651c2d7f13a9942e7418052b4ae1b98f8ca3f3e828532a453289bd47b363738f866debf04222abeecac1e11f980b6f115f097f4540aa7735b993f17f55083caeb6a80f80d092c59d2f895f783fab56a353b58a8c4316eacf3012c77e6fbfdb4be7
d = 032ed7f38db0a3f026aa85f35c8835d8add52e62f631d5a99a6b6fe407c3711dc429cb5846b40fe560fd82b18a83bad21209382584e635ec21b38299d1651797246d69cbc0e23e674ce70a905109583a5b2ec87b0de762594c813f89c06d3ee2a19bfa0ffd78c26bb29d426f7647020434341b4735a2972b6aa653c662d710e7
c = 49099483331a355f9e1e9446231f1f36d9a7cba76b83c06c6ec752dbf112342d5513e8285f4c7afb8b166e69a3e6f72991ce6a8d7247f163eb2d8419c00b1524a2990ba14983f23dc36c71530c337c55de75ca6dca538a64887552c28c4e5837d9a2e4391a4605efef28844e858f168269a3d58f9e2ff138eda6a3207c64632f
Result = Pass
k = c847d03e2e5fa8ae543e35e47143bc6d0c172889418e2161398171222cd9aeac4c70f4e1e96425fe555fd492b8a5b45ae9a0af6ba22df257b6b354705819c9018c724032d54da56821f945d8fab1eada5107494a4e72d5ce98fccf03a8af05331f2a7121a0a9201494d1ce896a104323fd475d3e33d570d6cc426ea7f2b0646f
c^d = c847d03e2e5fa8ae543e35e47143bc6d0c172889418e2161398171222cd9aeac4c70f4e1e96425fe555fd492b8a5b45ae9a0af6ba22df257b6b354705819c9018c724032d54da56821f945d8fab1eada5107494a4e72d5ce98fccf03a8af05331f2a7121a0a9201494d1ce896a104323fd475d3e33d570d6cc426ea7f2b0646f
k^e = 49099483331a355f9e1e9446231f1f36d9a7cba76b83c06c6ec752dbf112342d5513e8285f4c7afb8b166e69a3e6f72991ce6a8d7247f163eb2d8419c00b1524a2990ba14983f23dc36c71530c337c55de75ca6dca538a64887552c28c4e5837d9a2e4391a4605efef28844e858f168269a3d58f9e2ff138eda6a3207c64632f
COUNT = 2
n = a0a69a287b74fc5a179beab2d70485735763c78198e185906c3a57a25caf9983f61d4a80f7b57879ea38dd96cca717b93a148fefb6958ea7fc9ebf5b3eef90e21adbe5feea0dd76cd4b18538d59206ddc4e022feb75f3857f84c0714b76937c76e382bad3f28e11ffbefa235d0f41d642abfcbf9c10aff9ca1197b13783290eb
e = d2f24b31e027c0b9bc2929f2a2a38c9d003ae5b45d153957d2d0fe1cd05a87f375d050f6341d1e83f0583276902503259190aa7b0353e99a8b404da6feabe3a3b4a54263523a3619aedffe301db8be0aa07b04b8d8c1210cbb3034856d6f46dec94cf866558439083e26bd03
d = 1c60340de5c8bf5b22f0f7f0532af217b303b70a4b64c03be2a89bb0e78571db4e49b74d12423e3712648e8751c43c4498176438fbb844960240e4878e382c8b8b11e548ce24b8c52ab8eba5ef6d4d6945e952fe0bae77208f88db1db5fc7df848c2b3daac8e15319cc0c6b3682a2aebd3fde60fda4a3142c317e521f6cf5ccb
c = b4b437586695ee63f908514864b9ac2e051cf157e6a612f63e3caf413becf1c8fedbb605e87eee34140d4465243502cf410e2e675d4cf9b1bbb95bd6b2e3f7f8ae1144c2777cee43b6bc7afcb5812a376683209ba7bcc5fec4d46c7a3ddd33c3ca402ab79df7b837e7fd3a369d03ec0f7c650d1c4b5c3e8460752c5465426ed2
Result = Fail
COUNT = 3
n = bd74c62141cc4cf8228224d7e2de0d52b51e67e2d43676249470304d30d662ea3d6e5225101317369ae1de6bab944cde823d182cc0177f1905ca843611a2f67b9c32f975feccc8e9422b05d8831f0a013d8f9c68b1b8c25e5925d516414d34d57d84f38311bbebc7f1faf6548de9968e871f8e7e16b1fae5545d3f3cf04121b7
e = c08b122dd36a9965916287d08d8e2ece0500d4f1e37b45e29cb056efcd1449220d602e7cf13ec97b6c4f17a7e57af9c8ec65cb9864b7a4c83290855c8ffc55bc1da64e43b9ec4e9f266dce489d14aa8cda67cd50b638d8454a6854741126c4a07cc716330a37576e5021ca2f
d = 0217f64f638419c8741b4b98a0678e40cb0e0c703a8c823224d88be40ea4d2bb8183233c9be2760ccff280a51ba714646344885212569ee9aaa80e610f2de30f42ef26a55bbb2bdbf31b9238036cb387be57067116e97386e9aac9cf2695e266873ef2944a4b010804408b039bd543a7f622983efdf56ec4ebb151ad80d5f4cf
c = 97c4c0f9b86bf131e695932e891fddd63c46e87373bd6d6261fdd10f19dd5e21f362d4f131d82041e2216b2b074e5657f56c8471faa05ada4377029efd77b6a7bbfa3b30183cab7c9db278c7e59dae7dfee078aa130ee6b148c8ed42e646b086b833fd9cb5be1b49deeec3eb6a356caf2149cc04062f9b5038989ae11a71d426
Result = Pass
k = 3ed4d56d770a47b5a90c22d75fdc71b31a1fd54435de4375a06002cf13db50a012c5f5e5d94b7cfc85b5b3d9f5701d5d3aa75b5900ee0b09091c67d8ca33871228e041ae16138b1343bc3003af4aa21ff701d623dc40fcc0bad9848ec41be3a68ef8f9fdfbdbbd6df98f571a9d3fb8fad7c1e00ae3e72501a1182463b9971298
c^d = 3ed4d56d770a47b5a90c22d75fdc71b31a1fd54435de4375a06002cf13db50a012c5f5e5d94b7cfc85b5b3d9f5701d5d3aa75b5900ee0b09091c67d8ca33871228e041ae16138b1343bc3003af4aa21ff701d623dc40fcc0bad9848ec41be3a68ef8f9fdfbdbbd6df98f571a9d3fb8fad7c1e00ae3e72501a1182463b9971298
k^e = 97c4c0f9b86bf131e695932e891fddd63c46e87373bd6d6261fdd10f19dd5e21f362d4f131d82041e2216b2b074e5657f56c8471faa05ada4377029efd77b6a7bbfa3b30183cab7c9db278c7e59dae7dfee078aa130ee6b148c8ed42e646b086b833fd9cb5be1b49deeec3eb6a356caf2149cc04062f9b5038989ae11a71d426
COUNT = 4
n = 8ae197e5bb30172ff378eb37f08709aa87b73802a027617fe959439399b3a0ae58ee46ec6e9fc3f29fa03ec08db9d16371dec03e9a6422d539cb4deb2dee52fd4dc1978f72cce77726886ce81c62b880f29623758aa615c65e500101d0980b2fba68e466a2545aeae7a3bfa6a549ce9a62ad7f171385feccbdfa902494d78443
e = f7dfd3273f5ec1a26fcc9d7df3c448f4c9ff6408bc35a26f6897875b2213ac6a6ccfc061ce46d6df12ec86f376377b51c9b4feccafbb8f3df628fd05af868a7d066aed834cdb9d9e3a3a5b60ded9799b40fa0edbbcc80b1808182f5eaeb77735213231178f3637cea7b9b0b7
d = 2cd9eb9d91370fa049e778dc7b2eed16032a396d96d391f58df1c269ca2b354451bd13ffb929df047e356617f6d7394ca30622651d84823e7400805ea20d4eac617146eb8b11d0e53048c74ec02037e8b58946d95f10505dcb9dc468e5ade82fdec0edfafe09dd0bd2d13a07dbe96b741554b4806f4beeaa50562a1040e024af
c = 3b888227ed25d10630057877e11ee54576a1d645402dbf2cec426ba350f8e59e65f199e98f8cb703255bd8302dd8e4ca675333d88e2ff2e2da4ec903c9caba3f1fe64d172b44ea5b4d588640b51c82b26d05cfeb9a365745fff5984cc25b9218734fe4da4ab532b4b0e2c9ce015386a6919ff4a7edabb4fe631d22a9c41335d0
Result = Pass
k = 19e5d33241cbc43c21d1c3eb21b9a48b2db1930c78b38321487212f82859cc5b989b77ee23c49de771ab9603ccf0631abeecabb90b4c7178b86db5aee994ed427fdabddf89def7643d0903379f1bb69f575d09472648d7050a77e8c06909dcd51b2edc194d7a9d632b210e883d2710a155f15b3cbb156cbdd7135024f671901c
c^d = 19e5d33241cbc43c21d1c3eb21b9a48b2db1930c78b38321487212f82859cc5b989b77ee23c49de771ab9603ccf0631abeecabb90b4c7178b86db5aee994ed427fdabddf89def7643d0903379f1bb69f575d09472648d7050a77e8c06909dcd51b2edc194d7a9d632b210e883d2710a155f15b3cbb156cbdd7135024f671901c
k^e = 3b888227ed25d10630057877e11ee54576a1d645402dbf2cec426ba350f8e59e65f199e98f8cb703255bd8302dd8e4ca675333d88e2ff2e2da4ec903c9caba3f1fe64d172b44ea5b4d588640b51c82b26d05cfeb9a365745fff5984cc25b9218734fe4da4ab532b4b0e2c9ce015386a6919ff4a7edabb4fe631d22a9c41335d0
COUNT = 5
n = b101bd9c2458804386e23d1b7a521430569b4f49029e87db288892159834d827bb2083272bb85bd5934e7ef6d458e40a8549ff338a7e6d84789207b15f824e39ebaefd2076f55c69121e9a90aab7c662734b50b4473c3342f7c57fdb6b891c2697eefe0917d20db468defef1d7acbec6f88390ccc6344b48b273a7d51081c4a5
e = b6c13349b9671c7bbce53881ac1112b0b83be497f42b1776c84acd0e9983b2ede9391126d81ddf249fc542fecf52269df27e64bf995a026b71ff631d3dfa8c84a14ebef82079ff92946188eba0c2a04b54c1f324c073081f38380719ab64359dddcb826624975b1d37a43bd7
d = 22107d6ec7bdf09c9f688448bfae94cdf7268bd72afc96e4ad9d7501b04afe69df7b4274fe90b8f35e1cbf03b71a097489c619d2b87ef0024a6f2c2f1bf7f827c891bf7e42bf1f9a3b973ff0305f5de643092da60d9f039b51902e1b07990d5f3e1f360de4084e92f9bbfe95a51105dd58c266384c5ec815d380eea8dfb248af
c = 400e4f3d5498a2b5d695618f4599a80639e875b049d1af692d3d678c20875d6a888ec6f4d9094cbbb71b571b5b288bb237e69217ddb71bc91d3622666d0f721e8f1569666d8efcf148d1fadc11149529177f1e6ee38510ce607350294049b3909acac1fcd8cfb93fd0e0d53a3105ce5121daa31c24e2975f401d783d5fdd27a8
Result = Pass
k = 53fe9fdbc8de44c4a0c073f4ed9ba8b2769174fa1c29814528221c223e4dcd42435f3ca8db857a8cc056dd8155369c45d5d6339ace54b77ae4ccdd8180ec0a251c5599cdc5187c5a055ba1cd97e2ac6f43d6a85bce3646dcd2e0342a6d3a165febfae367b79c719ede2940345c55ae9d6106d4f94be9b03cb561f3759304792b
c^d = 53fe9fdbc8de44c4a0c073f4ed9ba8b2769174fa1c29814528221c223e4dcd42435f3ca8db857a8cc056dd8155369c45d5d6339ace54b77ae4ccdd8180ec0a251c5599cdc5187c5a055ba1cd97e2ac6f43d6a85bce3646dcd2e0342a6d3a165febfae367b79c719ede2940345c55ae9d6106d4f94be9b03cb561f3759304792b
k^e = 400e4f3d5498a2b5d695618f4599a80639e875b049d1af692d3d678c20875d6a888ec6f4d9094cbbb71b571b5b288bb237e69217ddb71bc91d3622666d0f721e8f1569666d8efcf148d1fadc11149529177f1e6ee38510ce607350294049b3909acac1fcd8cfb93fd0e0d53a3105ce5121daa31c24e2975f401d783d5fdd27a8
COUNT = 6
n = ab04b223f82347bab2547e2cc0abb18ffda653a5284916d90a1fb4c24315a18c778709b18a71abe1a385b305d25813308467d2c29263ca468d5c12e519f8749f267d17df5398b473fbfac9f5b4e98cf5c90e5a65d1a4561c69d82616f1a379bf2c1d0f8477e5339d925082a0bab01f8823d4e46ace967cc526985e03c0e52a4f
e = e23bc7155efb1817eae0633b99b178ec507dfce68c2ce2631a625123ebe9cf0b8c142464ed1766b69d7eb5c50bc8c63238b615ebfce42d087ed87c6cb3cd7d83d561dd350f9aee914cb73edcbfcb307e1cf03ea2be449e902d3c15d582c446d9e92eecb5e5fbca71054a857f
d = 060a93b479b6b56f7655fccf0770321733cedc646711244f08d12b56456e360b879c4007df0d93f35b57b7c51cd1b4f624631d5c3d656d6c67866001f5668a318bdc5259381db72eb50995c95cfdc45fbc3902bc65a1ce9dc92d1622e087db9f6abbee353371d700d5c2efcce47dd044bf5061853e729cdc28bd407837d93bb7
c = 1649ac3e49126af973c4065224bc36b46be21855f63775687aae4695563d77a67333ec836eccc260f903d7357ea78c6e06b1c9e45ad5420d6757f96fe720045b3e1191d7a29727dc7f802fc21a0db2f8744864f87197e27a399238e8df12a613418aa4242f9b23d5cfe216e13f1531b87d4ef07884a6dc19b8060ae7843ae436
Result = Pass
k = 89219746564489c208be153f337de445c517ef25060a5557f49bfb639085c2130cd8130df14cae49d9541e0418afe3d889356977270c9f39bca1944ada92fc115fd83078317e18c0d927d1d5a7825524e5f5b7d1b5d40a28187e05197f66888310fc2d23dba232c352758cf2f16b20911c96363475edb33caee52e16750fbe61
c^d = 89219746564489c208be153f337de445c517ef25060a5557f49bfb639085c2130cd8130df14cae49d9541e0418afe3d889356977270c9f39bca1944ada92fc115fd83078317e18c0d927d1d5a7825524e5f5b7d1b5d40a28187e05197f66888310fc2d23dba232c352758cf2f16b20911c96363475edb33caee52e16750fbe61
k^e = 1649ac3e49126af973c4065224bc36b46be21855f63775687aae4695563d77a67333ec836eccc260f903d7357ea78c6e06b1c9e45ad5420d6757f96fe720045b3e1191d7a29727dc7f802fc21a0db2f8744864f87197e27a399238e8df12a613418aa4242f9b23d5cfe216e13f1531b87d4ef07884a6dc19b8060ae7843ae436
COUNT = 7
n = 9d6c06ee50f4528b0d44ab99a87d27f180a73e8fd98512b11cd795fd417173cf44a55f050f5c1df9a80a4917230b4c9a2d4c76e36e4c845abe717e8384e0fe312429ead5a02d0ed98b37c85d034dc88f42d756546215df2bd5c739c1d43b3a37841caa7ade44be1e089eb0bd7cd7205e66cf7539d8ea1126d21b9a6411430c2b
e = 6367395890cd978cfd461fe82f3bb22f074c6c33ec4ccf395799ab830fbcc73196c8d52f036b4737cc82a3bc596fb56ccb664c98abd4fc3f21682bf7d1f58dc7ec16c3c10da1827e071d840349c281b57f7d11c7f67432f04da27baff2beee40a9f9dd3f39ec1201fcfaa04b
d = 16de900b71da7850b6c774035beecac0861b29ca03903020b2cf8d573f160a36ed73ac4e28c57a17f460d2ca400a48a239cc2aca97903c9eaae57a1c6d39148a9465795ed87116cd82445eb4998ed913cd3b01c19e08cf91a212a03479fdc1e4db717d0ddf04bd35c17da598f0b7d0dee5a5379ead70e939fdb12f99572bd4fb
c = 8f9157d36a2f306d6524e7cef4a036d25380db51ca7ef9f430a5bb47ae093a0fc5b4a1dd92e38fe35173bc072196e03606cad0fb340cea508b48b4b45e15c07d789fd37061e4458fdd24ab32b692b459bb505141099a19358942eba7ba5cd57fb13a34b35e9b1d18101ffc783bfe7be47afaa64bd0924c4c3379a8494b4640bd
Result = Pass
k = 2db5ade74b4c168f894c1588f61754b6d5db8e4b62cd95ed9d13c9795d8cd8187d125c02d688086110c4de61bb7d9346c656cc89effc6cc945812e696b201fa8e4571ee74aabab931cf034a77a1f77c2649fe75ecebb0f772a765fd833589e4f337262d1a15a966d3072b760aec506f268f1e359ef611de5a7e4fd1241f40583
c^d = 2db5ade74b4c168f894c1588f61754b6d5db8e4b62cd95ed9d13c9795d8cd8187d125c02d688086110c4de61bb7d9346c656cc89effc6cc945812e696b201fa8e4571ee74aabab931cf034a77a1f77c2649fe75ecebb0f772a765fd833589e4f337262d1a15a966d3072b760aec506f268f1e359ef611de5a7e4fd1241f40583
k^e = 8f9157d36a2f306d6524e7cef4a036d25380db51ca7ef9f430a5bb47ae093a0fc5b4a1dd92e38fe35173bc072196e03606cad0fb340cea508b48b4b45e15c07d789fd37061e4458fdd24ab32b692b459bb505141099a19358942eba7ba5cd57fb13a34b35e9b1d18101ffc783bfe7be47afaa64bd0924c4c3379a8494b4640bd
COUNT = 8
n = 977884e88c0c8127709843af6d37c02b2394851ea2313ef7f8f95ee02c57e71ebccfd3933f6cd146bb427b0631f5eaafb9e1d9ffeb4a79be75360e0af1299844c9bf896bd3fffb27af43749bbe80868c37ecb8e105063aef02942b57cf8de5f4b573b8835e75e010f76d218e7d69fa573e640983d5b6ebb7ff992c28a9f6048b
e = 110b390d11c13574297784180be412ff866338e1e8a3a1c0f885e07b4cb38b2836dc1307ce2fc60abd9a47ca24ddfe030f470060a07f742f2a61d1861dbbab3ea6d7654fc1271b0a53a3319215334aafc6d22b8e29913f15be747ec36b7623fbf1c9c32f12a5493fe585e2d
d = 2958f931484c2f635a86822e4bfdd7ae7c45b854b573d1278a9f699e47354236edeb18497e2d6faadea7c652af9384abf9033dfd20deb4a6811e7a6dcda4a6716d20897a0facd19f61a115101ae4b3c3f77f0fae83ac2cfe3f5855f2e854f5693df67cf76fb4c4d54da15b711dfffafae9aafbea76726efefa44613a74ed9025
c = be28192aff56f98a1c822e03a44de0ee1d78e0abf50539e5bc99081690258d4dd8c5812f35e9aa3bb5b2ae534a9f25787b68f1d65a2ad200b6c5357c91824d82d4fa6501423375e3ab0bf39262daebbbf15352520aab98d6c1fe7cd6f9ee24b41c8d6da9107d80096655a6c8d4475d3ee500ab27efd0b2ee460b852bafaf3a6a
Result = Fail
COUNT = 9
n = a5be019172ef33f82061aae0e88aa81fae292b3e1c0b33220c5822dbc9acdbec2eb7b0fbfae1e9160c47277a85e047c629686cb40be50f2a676bfa702c773cd24ce80a6c07f3c2d9d65029abe0c876cdf3b9f6ca1b4ce8edb74aeb3c63dcd1448de20ee97063a26450bf4db8b83a4f16b9e3ea146aba454b72ba1cca615752bd
e = c06312d850e541be4b24c664811e80cb0a8d4ed6b21f1533d55477d1b8ac8e4b25441b52f75a90c23e7c81b42da33e9f7d6a02b8c172a8341aec8222fa2f9540a64c79a0e8837c0b02c82f75aa0a529bb715f2aa7bbe5d63f9e346a354be5b4aaf95a52abdc71ec6ed171581
d = 22595b2c5ad55e4a96dce4733064e1338ceabf00a2fe2df5ae8afc7990ace25a036732c06f3170844868bc854d8408ac49856bca8314b54b2fefefe0393920da3c4db3e62d8969da7a42f89d93c79954170082db7a44c25780ed7ed21c6475d125877ea1954310bf91031ba2ae6422a15e9b67868224bf6050839cc0ea331f3d
c = 067aa5f930e6e5f25b5fcb93c57d9cda00d8a6aeeb25d420e1a281f030b58a53cdcfa7f34697fb38f745e9c6814b2a47783b1c6a5ce55d2bcbbf9956f48ba0464f33bcf38cf8412cc9cb652007fb5223df117aaf71f92ba99e6263e67766e5eef46e8c00ea50e05637bbe7a93fd53ef89d22678612a86522c15186aa9f9081d2
Result = Pass
k = 384e297946360d798abdaf2a71ae3b5d5222c7c874260879c4db0d663ae185ae2ccea35170e23707a380dd4230de9b52e0b2aea273545663bf816886f1b528f251ebfffc778c19dff5ed151a469490aa9ec7238d2e681ac33b8418eac5056045bcd90f1490ba6c52493c3af831b1a3851166bff56e85994ae1531c16b14bec95
c^d = 384e297946360d798abdaf2a71ae3b5d5222c7c874260879c4db0d663ae185ae2ccea35170e23707a380dd4230de9b52e0b2aea273545663bf816886f1b528f251ebfffc778c19dff5ed151a469490aa9ec7238d2e681ac33b8418eac5056045bcd90f1490ba6c52493c3af831b1a3851166bff56e85994ae1531c16b14bec95
k^e = 067aa5f930e6e5f25b5fcb93c57d9cda00d8a6aeeb25d420e1a281f030b58a53cdcfa7f34697fb38f745e9c6814b2a47783b1c6a5ce55d2bcbbf9956f48ba0464f33bcf38cf8412cc9cb652007fb5223df117aaf71f92ba99e6263e67766e5eef46e8c00ea50e05637bbe7a93fd53ef89d22678612a86522c15186aa9f9081d2
COUNT = 10
n = aae790ce66165e1431df2b6234497b11994653c3f70e1724123b5adfb993daafbee368707554d7392314340abe052b6f7f28a6e4528919ed77ee2d0ec7e58ba3503c61d41274af784ea38f9a5ede616cccf011da8c4d7d46103dc29d166f1424a1a19d79e6a3acae603de797f1caac0fd3ecf246c40376fceca0931b164044d5
e = c690888a046c216cf843d63b0a71eb930063bbdb884d4c9efd372339bf2bef0fd77793eda3d89508c83719acd72725df7a456c5acfaa54ad27fafcf461e92981322977a38543f3af1c1cd8027e4a4f35b16e1657cfc7ed6ab932fffb0dfd75374195e5fc3f30a36b0eb2ab17
d = 194c170c8407fe3c9aa81d193f92d933bf49a05af50332b1f6deaa442d85a04580716af33136655881d4b2e50aaed19c5d22c28f755c834bf8c045eaadc0376ee4f0e22779196bf0029fbf0501589338d993c626167b5e576d20b533a150470ab6c0e4bb30a091321a8f63fd2c8a2cfe1e9a9e09ae43a14ba6066823139b56a7
c = 888c45bc9f8faa8893f2013c8917badc88bd25c588c62b92cc3d3c3d7297888649397299e23b41ebea6c1965b6962bc420032840923ffb6b6020b75d5b04ce0ea35a8503bc64a42de43a720ea413e01da6c0056cc679ca886bdce7a018330eea3ef6654355913a162a66f37e7b1643afc1fca4924dfb01af967ab250d2acaee3
Result = Pass
k = 0b6730cdf0f4e8106edfef36437d3a03a2a62f56a26dae5440c487db56684016e617a4301cded9f91da454f4cb498ade5061f42d6af2be01a27474e332e308029d66ab392963e2f92550132bafc1ccb624d6e5e36cb334e50d0473afb3a6a600757f8caa92f83599c8f6a7fc4df348ec0418e6baa529a9b2ebcebe754839c505
c^d = 0b6730cdf0f4e8106edfef36437d3a03a2a62f56a26dae5440c487db56684016e617a4301cded9f91da454f4cb498ade5061f42d6af2be01a27474e332e308029d66ab392963e2f92550132bafc1ccb624d6e5e36cb334e50d0473afb3a6a600757f8caa92f83599c8f6a7fc4df348ec0418e6baa529a9b2ebcebe754839c505
k^e = 888c45bc9f8faa8893f2013c8917badc88bd25c588c62b92cc3d3c3d7297888649397299e23b41ebea6c1965b6962bc420032840923ffb6b6020b75d5b04ce0ea35a8503bc64a42de43a720ea413e01da6c0056cc679ca886bdce7a018330eea3ef6654355913a162a66f37e7b1643afc1fca4924dfb01af967ab250d2acaee3
COUNT = 11
n = cc5984a7f60abe9f99ada8fd1de66b1b63a6f58938d1ea58f3981d883f91030fa97a93d54d79d614ad47a283dad02eee1640351b77b83930cb9b5554587ccc0742a29558d36fb5a8fdd19f257de4e5100852bc9e48ddf901651578c4473c1d6f76acf6ad75033a8e08277a91cd4f0589fed41181946f243cd8370969832b467d
e = 9e06619b72712729e743275562fcc12a8305eb92b4243ea28343d4c2e1238afe94021cab7a0d78bbe1e875fad56837189c46d04e7efb4f72aa81b931a73b40c4c6b9d18c70882d52769649e271e724f08604a0e63d4f5df1fd0608dcdf41292cd1de964de30857a70c90e7a7
d = 01eb4e4d4074de353dbe9fdaaa98e157e91d09cd36b9274892ad521239021c739abdc5273453f04173a3041e44b53aef72d2c6b375661cee61d158eaa87b3b537145e9aafe21da40e666139c40622366b46bf817bbc0b44b677270467f0ac9edb4b55e023cff5fa6eea870dabba8da7d783a03e1c47c9b04d664c0eb1b4a8e7b
c = 76193e175efef1136d123601a69754dea902ff61e15c287efee8192ea606c07267574b95f122f6b282f62177a191a6280f0169e7fb09313275c6b6ad2592fb223d29ddc6ac0becbe95217be1ffa2f3c0ce386de3f25f7f56de0e55653b9a04a3ded71c31f8807c3c8dd96bc82892e4acccef30de2d26bbf1200920dc51e486fd
Result = Pass
k = 2e7fe1ec2c3eb972af1a84dae5a401d13b51ee6de63a792a928a60c790202d44384ee8299174be64ceebb013008921c4ed08a891d2cdc99b7ecfa80a412f41355e0ca6515ff74678e80b979edc6cbbe7dfdbe5593e6bb2abe8f2d1fffe15042a1ed4b3c1c7cb8b34fcd48beb4329b99c461513bc018cf270ceef4dfd7a351914
c^d = 2e7fe1ec2c3eb972af1a84dae5a401d13b51ee6de63a792a928a60c790202d44384ee8299174be64ceebb013008921c4ed08a891d2cdc99b7ecfa80a412f41355e0ca6515ff74678e80b979edc6cbbe7dfdbe5593e6bb2abe8f2d1fffe15042a1ed4b3c1c7cb8b34fcd48beb4329b99c461513bc018cf270ceef4dfd7a351914
k^e = 76193e175efef1136d123601a69754dea902ff61e15c287efee8192ea606c07267574b95f122f6b282f62177a191a6280f0169e7fb09313275c6b6ad2592fb223d29ddc6ac0becbe95217be1ffa2f3c0ce386de3f25f7f56de0e55653b9a04a3ded71c31f8807c3c8dd96bc82892e4acccef30de2d26bbf1200920dc51e486fd
COUNT = 12
n = b8f5ce2a47aa93837704cd6c4ac2f23246075df9d7d496d8fe3698f1183036c0e5c4b664eb249e5a04db8c6a1edce062747bfbe49c93af10ee8eea7558bce926b559ae2d8ccaea1a3cd78c429602913593fc6a090a3fdaa206ef405389b20aac47a4de62bdd846efd060c56d68089a1a27194022b08155770844f0709904cc35
e = 28eb47109f6336a627460f131bf6c1291dc0d38d251990e306b4ceac3f5e07271799737c602ebc34237cc8b826b2620092b1a3fc1b667363949a8b6d039284cb7888384e1b6f6d16f1d766155c8dd2faf1f06aa68776b58ba7268d9e3b2e61b9341ae3d39fe24993223e4a6f
d = 2e51b38fd9c7d58e637ba4d32ab138f4c4486b13c9e425765f5aecbc0b82a52e2b1cc3f8a76fbd7e7251d3cdf378c9307a3020b2ded5b029f5803a2c52c892711e70b82421ebecfb51f793475b90033bec13c928ecd9ac7a2881b635e83848a9d34f8d63431eedbdc1a19af228f874d55954f1b7a02817f30677b47318f946a3
c = c33bea44f3dcb03b7b46b4a8fe9a63dddec2cf315f04f43d0ad73f4b50f6510b70b400889b8f9e5b55077e1e1eb1b52452871e674e82a1c2d46bb461b1ee21759cf00a2c62222be040d6608f9012678ba9e3e67200f4b061935f446587c397320f97131891bedf32045b61e19de60178aa803039be83a9810e5ef73f1ba038aa
Result = Fail
COUNT = 13
n = bc73128135abff03786ca76b4ca58692c53511eda689bbbc3e90bd23591c416ecdb7e22833cedfa1de94ef047b6d17a8c5f0eb084ba9677ce38039b1b10c72c87f4de26186bda671c855c8798e4b16b6619c012e4679f1d04d90a15da8db1973b1d4bf7b6d94cabe1130f19b34e2a616d8d59684406b23dffebec41a0262247d
e = 65a07403091e668a7511be81a6e583ed9677699b25069a079cc133ab7860c946f4c4ae7d46497d33070a9a9684a27fdaad4e4380ededa4695e681519359b24ca418181e0c075641c050086f878be7a1b3b3b7138db33b94f0f232d38dc78a8c73db2538038b98aaf25e886f9
d = 5595768e334e32a7eff447d468d79df392ac43dc4f62a41192d6b411b967be4ae2063700210bb61da026e375394c8baec73442db7e9854594c0768a3342bc4506ff41c239a5b794b32de5059d7572946e52dbee6be391110c029e1b96a8675af94c6025345f0498a993703298557c21130eb59bd84e5110303e72a2681aebc8b
c = 7731404da6919efa8d4f47953621a82b8d1232b4b883533ba66fa63febf36758cb0d291e94a4cb4632c8a80efd3c0edcd531f2217155e184f40c3a3dc1fd9bbe91d19999c337b49ef32c8943cd794a4a237d6c9d3e2c9f7d725803dbf5309906f206f887d8554149f80254fe4fe244bda07d09f0c711756d49da6ae32f914978
Result = Pass
k = 60231d6657fa2bc2482bd081b6a33e666bbccba3f19063b9659609cffedff6b01ab63f519ee527bbd264838a6e349289cdcab2551997de43c7445517c277795707aaf68ca4c5b4446ee60215383959ead444734710b7ce7690734c5222afa0b48612114dbbbd39a84be14d448beb59a73c0fb404e10d8517ab369ff31181fac1
c^d = 60231d6657fa2bc2482bd081b6a33e666bbccba3f19063b9659609cffedff6b01ab63f519ee527bbd264838a6e349289cdcab2551997de43c7445517c277795707aaf68ca4c5b4446ee60215383959ead444734710b7ce7690734c5222afa0b48612114dbbbd39a84be14d448beb59a73c0fb404e10d8517ab369ff31181fac1
k^e = 7731404da6919efa8d4f47953621a82b8d1232b4b883533ba66fa63febf36758cb0d291e94a4cb4632c8a80efd3c0edcd531f2217155e184f40c3a3dc1fd9bbe91d19999c337b49ef32c8943cd794a4a237d6c9d3e2c9f7d725803dbf5309906f206f887d8554149f80254fe4fe244bda07d09f0c711756d49da6ae32f914978
COUNT = 14
n = eab017d025220d1c3bf6e89ee591aaca4d5a96a3b7f8ccc1932bb98344ef442fb41a1c82029de53dec19d1f448fa4b9b4615992259e3a85cab1a9495ec13458cf2059caa2263255521f80859fb4062aaa6dec660b6bc3685e8fcc296aa9f2a56ea46e65dca824e83f0a6f4000e5a743d6d366bd8134c886a8e466743e19a94b1
e = 760e3c5173bef4fb2b3e4b103ad8082249c14baa80e85fe0bcf8a253dd36dfd2744533a593165b021872f5ce857da213ecab759e432beeb23cae1ad0836581105496558519fa901451856d68bf52a57db2d87a34341c4c871bf58078144f57425c3fc3dfa090fbb680e17e4b
d = 1ad0e0fadb7de0801c4d7123599442d00bc9cb31cf15ab37637e2c99df0969534eb9966cb0376c6644abb2f6071970db6fd63be5ac412da37477cabe18dbca529d7afcea827ab810a288f8f7b93cf5555df671e05f1e450977154f41b5a4c6bcd55d119f24ed838b40a0d51ef4ca8427b36978a00af2d1cef55434fbabe7d32f
c = d4c44c9e1cb75421fa1e53c27ea0e8f165d1e68832f905ad8016d7f99624fdda3c9b9a35cd3a08508e03caf03e87c2beee63a4ef130bab24dac68b8fbbfaa65851aa823f693d7b825981b50193ef55a07931f1ed73e144033f9427ae8917bdcfbcf8ed021748157f03a0fc3ea462095fae41b3c87a0439105986939c2802a807
Result = Pass
k = 4595b4ca7bece728eca173bf2659e22f757342d7c9934a3e0740a0fa9629c4e06493ac3923accef944d81c67fe3311af7e94105f7c5e54a0924478818ab8a6b6e167f5da90ed550831d3d300f0edf95a4ca6b4b4b319441152cd741004e25f6eaa44f7c7eb95d67129a2774e8393607508b8a74866b440122919f8e35cb7e5b3
c^d = 4595b4ca7bece728eca173bf2659e22f757342d7c9934a3e0740a0fa9629c4e06493ac3923accef944d81c67fe3311af7e94105f7c5e54a0924478818ab8a6b6e167f5da90ed550831d3d300f0edf95a4ca6b4b4b319441152cd741004e25f6eaa44f7c7eb95d67129a2774e8393607508b8a74866b440122919f8e35cb7e5b3
k^e = d4c44c9e1cb75421fa1e53c27ea0e8f165d1e68832f905ad8016d7f99624fdda3c9b9a35cd3a08508e03caf03e87c2beee63a4ef130bab24dac68b8fbbfaa65851aa823f693d7b825981b50193ef55a07931f1ed73e144033f9427ae8917bdcfbcf8ed021748157f03a0fc3ea462095fae41b3c87a0439105986939c2802a807
COUNT = 15
n = a39e87b21ae20a21848cb48cea20bb4f3b4ca3b6250638abf7796295408109d956e1a981049d2a1b023b6b12f433de0415f6486213972d27f8bc8505a5717f5b6f1969dc7f7abbfb529a695ded5f140444c327537962a26a91f93fa28b01bbe078070874c1d1cf4bb623f5586bf3f689085ed7490513e9159e901e3d8b18f327
e = 5ab045b42aa62e2b430a692d385849d0084e7a8e11ece2225c3cb5c393988f0ec08ff29dce9d081f16c787bab4eecb2a011989dc31b2e389973d5c4b2d8fd3e13f419697bfa5ae62e0ecaf69bb443faa1d1ca7c88cc1485e0e542c16825fcac0be41bdee32dbd4c6cf4d036d
d = 43ac1c3ebe097a756ed818810f111362360a2705087d41b6aee4c600ad65fe718084cbd5956c879358ee29c81a3735bf57a71f6e1c9f30c1ab9bf25b020bc2e25ab2b3aa37429bdad492d1a9ad6d1808eb0783734393c0701db2d9ca833a577b58ed3fe55cfbc663c5da913d1372c58a75c5e7f0b0c4b4d8cdf56afa5dd06765
c = d3daa06ca2645f5a968b1ebdcd078921f2e6432c61242bd48b7bded09c7c7d4c5cdfb0e15318eac4312bef3e6dc0945c2b7ac6e76385ce96406ed383c638a1dcb8aca9dbb9f048f8b15b4c5d7288b49a9ca9b79abd1e08d5bd4759c87a961ea2afe893411a15005cdec53b0226866f430b1c1d2db81860facbad7587ffbe7a08
Result = Fail
COUNT = 16
n = ce79188c14fc8e6432ed82a67408a4665055c61f039c77c5d250f30fe986d8b4b3d0428007e2340155a6e5ac275321c33d1364a9aa230bd6ccc37842ffe2542ada03c44426a45828b947aca8adf98f4a7ca9cb6b4545fe94fc5b79e7c4fe81559bc3ce017400495085534c3ffc61b601da77996cad471e0b58d3e3a33eadf551
e = 96434d0562cb2045e0017dbb8fcbb11c22f14e7627703cecc970e2de91ecd3e9bc6b575ade98802aad7a30f027263655e0a0ea62cf511a8dcdc0ce5e3d7f74d7d0014f612ac2a6ad1a8a9ab3d08cda37bcd9c8bf1d7077c17e9e78cf3699995ef5dd39ab20586b55f56995c5
d = 00fd5621f88d03ff7debd30d55248759f9b87cec3e3bb1c27a4a1f1fa9cb5b22fc52086bfccdbee30c6c029ad67d4aa036a1e61d245933bef0800a827d121c3b5699a79b5cb82af1ceb638e3d94159b30c5b7abfc1ecfb75b7042b70a4d543ef3e435e3f967493375e916e2b9e2fb533456b3261160392170365d1546f8b822d
c = eb0b60f4746f7b0c2c81d78652973f949c9dbe9f1e68a93c6e47df5c06db50c2e929bcbb8aeebd09e9320820ff20f0955c152cd30ff7d910c6c8c37f367be0c7bd061db546b85d2d6ecdbf67e540205816e0e26d0aa6eb7f8946f0048304f382afc90a4a72766362027885c3cb9dd8c4122568d7d81de67301e8f051b51f91db
Result = Fail
COUNT = 17
n = b3a4e307e317a173c3e9992b9ddbb0cbb2733ffe89d477c9106047accc2e1d41879dcd8b336e33ce85a5259301223fccd211f1fb3a3530a62a20a1976f1c242576704e70f52352422897b905a6d69aadb4d7b2342bef1aeaed6b01b9a52816642d9ec9b04fb0923104f44f1a9a53ce14b89fbf3e4874744d0e336901e2b3e649
e = 6325a28d28b2343cd8095adbeaff6317d0c9101cc8346ca25bd9f34293d3d29b312439c4bdb1fc14ef9e7aa3db6ed0af3b0bae589c2841cfd059a45a4447d17d2cedf655887063dd41e8a8bab49ab8924c1789242a4690c35a1a02db93dcda752a813cef0911302b7a344f89
d = 10e68ea03575078fc37f66601a1eb8965fd3d16824b680c40c1849c68f50ddbeb9d12591602d24590ee027ababc27f890c4cb99696fe9231ba9c6d5940cfea8a0d4a325d4eec3cee41f1cff42f052cb4ac66a48167d2ea58922aca972c373503300a247ff9135b0342bf519478fcf9ccf7ebbb508c9ba6e4002ff1f29d962f19
c = e736534836f54ef69aca131c072369379afa70bb8afd32555bed7b735444eb06341a498621491a37e1d072ac4c750b8901af948d59c24bcf992cce476c402e91901146eecf914b8c31faa407706dfb2facd9940c601fdd1f957447eb550655b463e2f2872915087af2114e35595362b101431740875c10ceb58c8e66f9de86f8
Result = Fail
COUNT = 18
n = de6486187b72e8c5ea8fd6599e268315dd277be512b6f88c9a593a65b8fa1573d5c297df5182fa9754911c0df37246407869770fecfb1a8d447e5eeea618c13abda8f15c61586420f9aa1446126cf1fd4b96bb48841f9931e337e236e2d7bdfdd91c02b0b2abb5f2965dacdd45bd1a969b215bb31916857e3144ad72c7030ea7
e = d4ea9c310623c90f1c04c6c2fe9c0adcf6e6ebaa083c4cd3b8f7e0bf7a2245fe79b02ec78147e3275d82222141bb2da8857889646ac721582fe23999ea86b5a2c843f6674bf9cb1c6a0bd0e13ff33c19f0cbb72ff70654d2a64c460a1188a26a4beb414075682a595c90939b
d = 024110ab2212a6ffb81008ccdb18c9cf2398c4e1cf8277aa59c162d69a60585624fc50e3e80dd9d60f4ddd7168b55f3cb533dc2f96f6d4720432dd6e9e508c6534d6ac3b4f07246347a40d3af8dfbc5bf46998810357125871733e4eed010c632f53b28b4226e09b73e0cdef172a0a7cbe72320b0f1a8aace8149c697486d853
c = c03c2f116dbe4a1b79605b462037b2f15147d0e7c04a1e3f37adde802cdc610999bf7ab0088434aaeda0c0ab3910b14d2ce56cb66bffd97552195fae8b061077e03920814d8b9cfb5a3958b3a82c2a7fc97e55db543948d3396289245336ec9e3cb308cc655aebd766340da89213834dcf1a759ea57fd22094904229abf45d45
Result = Pass
k = db782b4e3453d70a5c25ae2a7e372cd7373ef6a869117f03bff989f4637ac6203e15509dc7892a89d3045e24584a64d7d22452671b04bba05bf004d2238e47e50e73ea42162e152d0415aab5668e4ffb5fba70c2fe467d36660ff4ddc2784e152b9d6a41c3d6046fcd3d7d40949533d599f8d76d6d45e97a18c759b61b96ef29
c^d = db782b4e3453d70a5c25ae2a7e372cd7373ef6a869117f03bff989f4637ac6203e15509dc7892a89d3045e24584a64d7d22452671b04bba05bf004d2238e47e50e73ea42162e152d0415aab5668e4ffb5fba70c2fe467d36660ff4ddc2784e152b9d6a41c3d6046fcd3d7d40949533d599f8d76d6d45e97a18c759b61b96ef29
k^e = c03c2f116dbe4a1b79605b462037b2f15147d0e7c04a1e3f37adde802cdc610999bf7ab0088434aaeda0c0ab3910b14d2ce56cb66bffd97552195fae8b061077e03920814d8b9cfb5a3958b3a82c2a7fc97e55db543948d3396289245336ec9e3cb308cc655aebd766340da89213834dcf1a759ea57fd22094904229abf45d45
COUNT = 19
n = daa9f6cceabbe6d4c3a746ba35cf73e2ad8ba33423e440588068a6856461b119469faa5ae8c34a1706bcc6ffccf87e2bc7c8435c4db172c2ddca00f1a2670f5593d864f20d131c84e6b6d0d2aca8a53393f51d70283ccda0e6fbdca9da2bc58b8917078ef33eeae27e5eccf04f6ce6c6a67f0ccd23df8e138e368ac55f0319e7
e = 9abb97533bbba5f03f42a767d6760ef258b59e3626b40082cb77bf35c0731d6f892df4130eaf5ebafec080621a8d9456e345c4de8ed636f293e94ea277274ab3c9c240eaccd76c776d8114a306f79329139f632c98e34b03de0ca0ae677c56c623d0f0ee9ed7458d66049cc9
d = 07b99416fed71aa6163b2460498dc8b04307acedf14c540aacbe0e11099fdac638a7aa5604b435a33a1d206a660ef5b4dc10a9443e77656580d5de7cb6d88eb357324bef2499fafeb3889f21f53c16c29286689c4dfea8c230bc301c8c81b38029b39e28ce53a9d5fdcbf5a913c77cc20404bd162b85957202cdad19b64f5559
c = c220f5e14b2f072452e9acfcb1502aa7859e25463236c37ba7da0e36e31e9accb71d674ace6a0808ec4a058173207f612b2812e04268004f92e48bf02312a20bf18dc03eef0d12154b97d8dbf4f10daf5a594ada7576e85f088f65d427fb0871f7d9c867b5016b72f93aebb23cad1db7989994dbd049c4d490436389f6c31525
Result = Pass
k = 96d3e28be2e679094ce939556304d53d28263480b6a67108dde9a3ccf4ab67c5f511f9086ead5f04d65520f106cc95f9d933ee3bdb3187dfdaaf1ebb601e9d057f03e1bc9b4e02836085b51e8f27080426b6d2aad7adbb8fee8bc67246329e168b93edbbd4680b5f877ad7993ccfcaf09330b16f90b566b18b9fa786842db2cd
c^d = 96d3e28be2e679094ce939556304d53d28263480b6a67108dde9a3ccf4ab67c5f511f9086ead5f04d65520f106cc95f9d933ee3bdb3187dfdaaf1ebb601e9d057f03e1bc9b4e02836085b51e8f27080426b6d2aad7adbb8fee8bc67246329e168b93edbbd4680b5f877ad7993ccfcaf09330b16f90b566b18b9fa786842db2cd
k^e = c220f5e14b2f072452e9acfcb1502aa7859e25463236c37ba7da0e36e31e9accb71d674ace6a0808ec4a058173207f612b2812e04268004f92e48bf02312a20bf18dc03eef0d12154b97d8dbf4f10daf5a594ada7576e85f088f65d427fb0871f7d9c867b5016b72f93aebb23cad1db7989994dbd049c4d490436389f6c31525
COUNT = 20
n = 946fbef313db4feb475be7623aee647290d318b912a58f4406ad3223cb91ff639987bfb207851d249908547fba3b10437e25622238f0bd1dc6aaba45dd0312e0606766d179f2e5dc9e9b0f764850b6acb729282f1056860bc16242da9fedb2e0a26c2bb8485d1ec78cfccc45980b332f16b331a2ca2c90ec38612babea7ae94d
e = a6b6836f2ff7266120779fa67b5e4663cce025b16ce02864819d1a6ef480282adfa8844e290594dac85aa91e3efb8d3af0292f4401d18d5c34a652d9e5eafebe6a8330c67004e4649c2a742a439ae9a9a530c1b060238f0521a244e581580bd9fd7b2261b3f5e173ad078a31
d = 23e28b6c311d1273ede5f035fd6ef4bfdde1602b1ac633e4c0bd76f0fead6b16559854a8c4e22cbebe094647af7461d8f48a6b3fdae287ff605cb0802292b47f59b0e5a5f0c3cf0950e4883fe62c7498c4cc2ff1683a2f911d42265311651aaf7075e79eedc4167421fc1bd06f048ea8892d67672724612230ce866921c48ed1
c = 4283055abe9a5eb6b2e73d063a2447ebc515fc7477603c91cb9f09ca7db48e30a75c60942a0805f84fe8b343ae4859394f1fe4a910e5bbe846a68b7fa7554a21686276e0a28e9ea0faff24cb818f4146d96a49a49ad8319af3574eb395ed5f45ccbccea4efd73395fb541a067ba306fcab1eb6ccdce0a68e1adbd9cf0d25d686
Result = Pass
k = 7d74f307217927164435cbb94b3b1559c7504c81c53e42f7481461b5f073b38e89a92d34aa2d7e992589fe2b7a32a72666416d6cfea095e60bea7f4fc62ec68d430a2f4811834566bf1c820861d9c5d6387ca2f2e09d3bccfc13a7e38361015b084d1a8b766b3ce1796a69f49a17e924b9010a216c966cdae86c9df725779746
c^d = 7d74f307217927164435cbb94b3b1559c7504c81c53e42f7481461b5f073b38e89a92d34aa2d7e992589fe2b7a32a72666416d6cfea095e60bea7f4fc62ec68d430a2f4811834566bf1c820861d9c5d6387ca2f2e09d3bccfc13a7e38361015b084d1a8b766b3ce1796a69f49a17e924b9010a216c966cdae86c9df725779746
k^e = 4283055abe9a5eb6b2e73d063a2447ebc515fc7477603c91cb9f09ca7db48e30a75c60942a0805f84fe8b343ae4859394f1fe4a910e5bbe846a68b7fa7554a21686276e0a28e9ea0faff24cb818f4146d96a49a49ad8319af3574eb395ed5f45ccbccea4efd73395fb541a067ba306fcab1eb6ccdce0a68e1adbd9cf0d25d686
COUNT = 21
n = c808f0ecab4b7ed4a221296651aaa1198325e6a84c831cfa575e7197b26a2c88803a8219dfd4b1375a2725624e4117a775174328ca3ac6f79e512a021c2fcc13cc9fc854e41842c20a837b27c6e282fc11e40a3535121f0d314a50d0ea5df1c3723e0185474c073e17587ca0489b8c795aee3eaf0428fab71623f86b4efc6a93
e = 2bbefc263e208c3b464aa3728f017932d188a998a10dd18480242453d81985e859cf4060eb9b613400d6aa81313430c0359314430cee62f354d83b1751dc39e358b0239f9e59ceff6db2e18f02e6ecc0d5fbbd09a662bf76ece012141620bcddbdd20a798d11ed9a302f82d5
d = 07f5bdae6528c0e55abfb79f96aa63f748efc95c05e406b067e309aeccf62d4e7fc27839c0ec54ecfef42890e211af4bd23010e9445585dcae485d91108eff679ec8d578bfe06f475a5fc3772d37ac205b5abbda1a903c4e19f4d3172197d94a2f342009ca3cd307c0eb0456c91f2782193be1c8891a6411c5780ce7f2fb551d
c = 2e274ca37cc810a0e3b32901feed1e7eaf9e0134b35ca1037aac003536c608603399798d660f2699489261dce5cfb4092fbad25599d2ccdce1a688402d9870935ae1677791d501831b68f3e976f2c856a82fd61ad38a71890a9b5ea163ee8aed4d06fca824a10926033ec770daddc42fc006f7cb8a0cf6d39c936aa0ff50c035
Result = Pass
k = 7f963c7f56c95dc3e8b03942368989fa16ae8c55c4c08cdce415b10623f8be526110a353f3e2887e30472d878945acdfb2cda2e7f2f2de22c6361ce9638020a142014b5818bbbf73564f9112f3d7cd854f81c16d5ce36412fdf0efe0637923d62ebb971bf47d31bb2352d7d6bd213d4ac0a40136c2017a48d742bdf11d6af856
c^d = 7f963c7f56c95dc3e8b03942368989fa16ae8c55c4c08cdce415b10623f8be526110a353f3e2887e30472d878945acdfb2cda2e7f2f2de22c6361ce9638020a142014b5818bbbf73564f9112f3d7cd854f81c16d5ce36412fdf0efe0637923d62ebb971bf47d31bb2352d7d6bd213d4ac0a40136c2017a48d742bdf11d6af856
k^e = 2e274ca37cc810a0e3b32901feed1e7eaf9e0134b35ca1037aac003536c608603399798d660f2699489261dce5cfb4092fbad25599d2ccdce1a688402d9870935ae1677791d501831b68f3e976f2c856a82fd61ad38a71890a9b5ea163ee8aed4d06fca824a10926033ec770daddc42fc006f7cb8a0cf6d39c936aa0ff50c035
-d
COUNT = 22
n = ce5b881879dac0e0cdc0c86279e0cb930e56f396190cd5e4b23c1d48b22ca6d5c1f4ceaab5806c03e18351974dcd07822094b0d99c76abb45b79a302e428d621858a0997ea8e2b254cb494c5ecc404781b0d6db70bc8373f21656c862cd70d2ec616f7bcd808ac2e3c346c33f99dd80d188d659ea22404505bfccb3844861eb3
e = 74dfc453110baeb77206b4c8d50f315f36b15a1de4687a971fa8f0f0ace78b1f0ce3833c0732a1e13feda7319eb8e4637598758e3ff0262a9cb0f8ebab4d7f84d2361ff6f67a5077d53ec036950502e6378b4bbe0f9484746d69dec6d731592ec1831137c1cad42f3ce660b
d = 401a65cfad9dbbcc9517c8fff3d8df2f1c8e49086b31fbb69263373f00902df13f5d564829e976c8cf3172e3b7a9e8da7dc9468b0e3a339c25699aa8beed58cfbebb2d8169a8ca2d43d902fac5fcd4168fc668cdaa7ac19b8ccf1f980c83d4612dfefe95c655dd2d44ddcdab795eaf541ffa68647bb0f289abaf6bc3df9e87eb
c = 56cd57972d983e4922d85f82e2976dbb552741f4c8b521ed4a214399560e8dd0b3359f4499fe13b61551036aaea9ccd8496b12a44a7705d0fcfce2313390bc1f30807c71c46427a9b9f75f6b6d262d34c067fd48304ceaec43583cd626112fe29356f706f7f30088d5737a6e6536153782c309c8c35e5aa9e7de5a7176b96f7f
Result = Pass
k = 08243ee5974847212303bdffc8451208bcbadfd9a4793f064800110d93d3811891d36fec6b8bc007b24e8381373b6482a1f09fe5ba29603bc9827804dc93f77bcf9e1f30e439d6cdeeede0b52e2fd98ab280a4183d81f997e29b8ef779052c283027b10f9745aa1b0f66e207088020c0f27a61da09ebe29a86cf342264c9331c
c^d = 08243ee5974847212303bdffc8451208bcbadfd9a4793f064800110d93d3811891d36fec6b8bc007b24e8381373b6482a1f09fe5ba29603bc9827804dc93f77bcf9e1f30e439d6cdeeede0b52e2fd98ab280a4183d81f997e29b8ef779052c283027b10f9745aa1b0f66e207088020c0f27a61da09ebe29a86cf342264c9331c
k^e = 56cd57972d983e4922d85f82e2976dbb552741f4c8b521ed4a214399560e8dd0b3359f4499fe13b61551036aaea9ccd8496b12a44a7705d0fcfce2313390bc1f30807c71c46427a9b9f75f6b6d262d34c067fd48304ceaec43583cd626112fe29356f706f7f30088d5737a6e6536153782c309c8c35e5aa9e7de5a7176b96f7f
COUNT = 23
n = e30789a24f07e1c958ebbb76d3512a6f59521fd56d26e5cd090f37b3fbd4375f2d0dd52b0138c7c4becc90f113e02e33ec976f39ac6baab1f9f80b1baa7544231746beff105323da123e5815052a90169eeb465ce973f25e5a6d124b77685b75d3e2e764f627efb32f63649c2df96fa4d99885dc30b9ac3d37d5dd851b71330d
e = 38866527c4c4e12b06f42473e3e3dbeb562f771c1638122087011d7d22b2408959bbb1563c55124d43e54d3fbcc1914cd32b96d0e6721ab8e35cbd1f85927a3a538abb4968f9244700df6720ded241f514d48cd668d282470e7d6f543300731dd31d29616bee987bad9326d9
d = 2f4da1568038e4b1408b2f9d94a229665df873ad38b1c7f0d1df619a13cbbec368283539660cc2217d97ce1c1460718d1478da990ece59ced6edb7bc786883e7369c83a009acf38a2d1eb6643511dc13d9e889fbbd7562e49d22f51a69c957bc4a5a30668e092b2bcd88d2b4b8869272fba0068068e49d8907cece5173a0e403
c = b6782051716f0677b2cbd5a69704b2b99e712765b80dd41b9f7a622f6a46b9395f6e73bc0820900589c56b56303fec444e6f005e45fb460fe34e0cc6eee0795300b70b95952e455263f5a166ea59cc204bc512e95d891726fedbc960a71b92a2445cd223421f8c25e961601decd9b9143e7b474d2840b02899298246bd826dee
Result = Pass
k = 258552b857b95bf5f4f2db3224973380799ae77e062004e25b87fad17706d5d9ec5762789e0197d9b9fffbe8ba60a4cda0b35df9562ac4a8e19ba86832b386328c07a1f663ec8477f7d14295dbfb918fe6f25ca0724b618852c290a2e3f66abf72170560c8e1687fb8104c68c720c78f552d62d6b25890b6afee769ac9e5d6e8
c^d = 258552b857b95bf5f4f2db3224973380799ae77e062004e25b87fad17706d5d9ec5762789e0197d9b9fffbe8ba60a4cda0b35df9562ac4a8e19ba86832b386328c07a1f663ec8477f7d14295dbfb918fe6f25ca0724b618852c290a2e3f66abf72170560c8e1687fb8104c68c720c78f552d62d6b25890b6afee769ac9e5d6e8
k^e = b6782051716f0677b2cbd5a69704b2b99e712765b80dd41b9f7a622f6a46b9395f6e73bc0820900589c56b56303fec444e6f005e45fb460fe34e0cc6eee0795300b70b95952e455263f5a166ea59cc204bc512e95d891726fedbc960a71b92a2445cd223421f8c25e961601decd9b9143e7b474d2840b02899298246bd826dee
COUNT = 24
n = a36898249faf8aee7593baf1a4a8d48d783e09c377289f15a6c3a62192901bd3455d3f412a783c5f18f2101c287ac374ee3f6d766d8fdfd99794a322dc6cc942483c1557b6869f43d50d236f01b1a4a117f012139774679cb1e0e4e0fd6c5c5c430248baab152c65797d21fcb94a10482f8ed72f59995cec37b7263053718613
e = b159561acbac2b40fa425172dce1201fc91587f5ff35915e02e703e6664a81c75f0cce6b84a46df22cda754111e41bb954a8d8fca0cbe02a2c2bd78959a1fc28bd70d015b5f041742592382120f4b931590f8f38fe728b162a99ab77958e8b92f7833feab3b306372e1c1d4b
d = 3d3ddebeee22136f80467c5fc1e9c33ea7aae7c11f96600fdee8356f7b325e657c92f44a636059fb482b7f0a01bd50c54e5977ec0cbbf8e28298369a79bed920a8dbf92ca6daeb6106a4b3bab8697cad5794a3092e97570d37d553a5619f8785674567b674fb2be7fcfbcd377d2c449191093f60805abbad0f1fa3c8efc5f7a3
c = bf904e340d13c0269f65f160cb967f99b843617ac0696f0b197a256cb5b1a4c566a3f97f4618a2b556184ee56549e5ec3478c831d7755a205e24bfdab5d1e42ac9c4bfbcec15d8897bc20896beff80de0fcd0e8c3fce9c6e3558faa7d8c8dda430192751c7b5688c568aa5da9d615958936bbaf5bf1d3ddfe63e5c3be63f9719
Result = Fail
COUNT = 25
n = c68c0ca6bd889aa0776681d49168bd72e36c48917755df4a910681bd104b6be44f0e9ca187a94f0fe53970365d888bea8da738d88be8741869b2a7d644ffc7ccb3c7ca9673d9d239e93ef7408e1a61573ffb5f0de94dd2bd7ca2d946413ae6554244f1b6d7b72910c6e59801458f12b974716a2f78ab59bad64cb7cddd18a9cf
e = 3f2b3682fd25ff3331838e0ab6fc7bbc24911fc722dfc5d1f96be4bb60508bd82f5d3e632e0432fe270354268f85c9159e4555f8590fb86e4d60004ef73438e0bcd58aeaf52d7c0f49c1b5a43231638a3318ae2fc05a51372a620cc238ed13afb69fb96dbb13b38b2bab98c3
d = 1a0d98e729059a750f63918bd108bddece80e1d9f8626ec6506514870ae68a4701646955dd915a154813d10763a9de1c801879092984e5adbfa6dee84600af28504fcd357686e38e870a71872789cd82adfe4301a39adc52a03b1d38e54771d8dc902ef34643c0ee8b5d833d1064f647e7700f674c5f68c85abb12c3529aef8b
c = d107422826d0d4f288a59fedc2b766e1473fccf773b5b9831443ff2129793e03ea420589081739123572bb13e7864566592d95e4d322ce352c701be78d2a95be775d674b08432fc07ab9a803ecf38701656fa245162757c9df0b2c0c15aeb3648340b196aebc7ea45e62afe65968f35c72ed3b43c22e1ee636fc7bb74a6e609e
Result = Fail
COUNT = 26
n = a9e491d3eb68230a1659151c6fc8ecc0297eeb628e5fa0fb1e95099d9d67e3e1288ade458970dbfe4654e002616980d7c9018262039991c76389e0bff8473b9a64555de7e9e1e527a512480f4abca07765e735cc67530715a4b1f3681946c9a5d4e8e92b3340e6b5b53853ec595ad39f7d10124d958aaf458804a994172bda69
e = af10e3af7480716fa3522cc1ad41850d220d88cfa58356238787727ff30d3f07ad374726f5b37c28ae5bbdb877ef4346014be026aab26d94cd1262bb14fc99b5e1d2b8730f8408e50c050fb2d514038a07e5b36cd57db13bcc76f50777808166e893761d9d926b234f0c6c7
d = 28bdb819ec93f05838823358cdad75e276cdd2c27ecb855d4f7da6b92b2a14a269674f7fbcc28b898a301331afe98985ceb8ad950d42dd93ffff7a9510e3a914fecda633cd30e6eb040a56b8b560f427a402fd56fc957ea1aee8196eadf55b295751eff660a33e695a205b9beead0b529febb446fe7e621834c1b3bc747052f3
c = bf64eb657b9b469566a5030850658c4e119ea8e7c3584dbe2e86b6f384e5b4dd4f274950a751731ba86246d523353dda94a8d29054fe4cef1082d9407a6ddc243e0a88d93818aeb9e470d30316e886deeb76f19bff99ad3be0f4db31c33c70697655d08896b89f760218d31a8f450e64fe502c912bf017aa8624e34ec71a17b2
Result = Fail
COUNT = 27
n = b0e1efdb536c975763911df7eeb139cdafae27c5ea29610955638ec4da6dfe86d2a9dd2bd7c93514a51bdac4f74457255077d1911558b714f91c10749242708759defa3ba10964fa180e7690d475773c5fff4240f0feed247e1cbcc732c214b582716c58d5e07c6b8ae22aeb0c75bbd798203d459847aae06c5b8a5c7c4fc249
e = b6f97acab38255ba1e1811ac2944a9ff08e89db629787fe8322a2a72898fecd06210c28e5ee1450ea4848e9e1851c7f17e3779eb4cb7d4f270b6de12e05c36356f1cc00b8be098cf36a0380ea55a553ccf6e2ea16caa6f39e89c1a581a13c8e9e03e345bf4d284229a456d03
d = 0215d844c912d19149979c498f997b8660790157541071cc63fb21f284e0abb8275528c0e2879e832b7a87742573f22df8fb668a103b775c0ff69785dff3dbe5420d24ce3ebeb1922d02bd6e6cd5a3e1b12b3bc71d8cd3efeda287f40073eb49b1e69f30330a2d00dc8a12342466bd6622b5f26e363213c0c8afd8092fc2b9ab
c = 4e5837d9a2e4391a4605efef28844e858f168269a3d58f9e2ff138eda6a3207c64632fa2375b37fa1e1bd7b6508ea036802d77da60723a146490a7c1c86179b9d4a0d3a45f58e210929cbfc1ee7992489029fdd8b489b85479ce78ace473166a2675ed8822c384852af06db8092c6ce34772dc0ba8034f87f612755800c13fb8
Result = Pass
k = 8bb9cd33b7d4060eb75615bafc391468ec8904443ddcdf4e5edb916c99d6d0d4dfb736419926193495d2adb8bf5d64757a8d6287cc2dd12314ff1917d95864278b8758ae8ba6fad88d130234fd7b8e01ea1fe5b3c5fe2cf22b686d63812fdcfd438cbca82fd4bb8638c2add1288a2d4d7fc2bf4720598437ff08e3a889e3368b
c^d = 8bb9cd33b7d4060eb75615bafc391468ec8904443ddcdf4e5edb916c99d6d0d4dfb736419926193495d2adb8bf5d64757a8d6287cc2dd12314ff1917d95864278b8758ae8ba6fad88d130234fd7b8e01ea1fe5b3c5fe2cf22b686d63812fdcfd438cbca82fd4bb8638c2add1288a2d4d7fc2bf4720598437ff08e3a889e3368b
k^e = 4e5837d9a2e4391a4605efef28844e858f168269a3d58f9e2ff138eda6a3207c64632fa2375b37fa1e1bd7b6508ea036802d77da60723a146490a7c1c86179b9d4a0d3a45f58e210929cbfc1ee7992489029fdd8b489b85479ce78ace473166a2675ed8822c384852af06db8092c6ce34772dc0ba8034f87f612755800c13fb8
COUNT = 28
n = a9fb028552262e880332309d34ac90bad8d26b60974ebde5f4eabd868baf81e4fd04d188fb2c88aacb388d3764bfa0ea233853e4e9a1d38789b09ba9571c8e7379cf75e6b6dc9426da036e0609826f5c5efa4e4ef6ba69087384c30fc569f9511336f8f3dcc59294ae6baf93b14e315e753cb592a4904456344bcc31f7aa2edd
e = ca6fc10dc3915fd64289ab032c02ec2b22d4820b4f4fdecdd1710819efb6a90af512229b957430f0630a7bdb7d22b3c999dcc0988bead88aeaa11ca5025d716183f6233d354e2e10eee029fe60594fe3218dc5fe0407fd0821270afb10a34c22e57aae3591d9c345f069ae41
d = 0ff05e75e56e571b4362b84d377670788e53144ebbbfa90ebdc0a57a2cb058940592fd03cb5fe548ba6be9dba4c21e5ee68b09b1ef994d2eceae44df3cd9283bf9e40765aacf41d0b4bd29c5b3466e43e1be31fc31c78d0833c3ae6c979ff33dfb3fe9f70748515f19dde54ec628eb4ca08201b4dbff7fb01a79be5677f2411f
c = f51cae56fb219dd6d3d124b60fc788f83bacdb3813a0ce31f3dcc6838e9632b4e3251b746d66fc259a5ed59a7f217b1fcaf232baf8ab7db1c860354cef3fd9dc0dba25fce0e9e617b7290c2b2a0a01cc0968396b92d70bd8e745bf06bfdae80f5b23f477bc7001b5137af2ef7949c206e05519d249ec1daf38d38b3865300652
Result = Fail
COUNT = 29
n = 89a93f490bafacf6e029b8f9cc3af75a5d59664aaf5dfdc8adb6b0cb5afaf7f6389745efe9a00dbf0256fd128a660a0a8bfbc822e9c80de806d6ea31f3f521f80bde9e52ebc108e2ae07797f20f33adadbe23c16b241158ec81b29e1f789664a8900c4f5ba6e564315ae2c0fd91d3ec3eca88bddef42e3e0abf02494360d9bf5
e = 229a853be5558da54d189215b844fb02b2e27026f80c7c99d2c6404c40a2dda986050e33e926ef7c0fa60c32f92a04dc7bb706d52fbaa8d616ab8d1c139fedfcb334646bb7422dd3d2b45dc4699940c5599a8dbfcb983cae10f7202f7d62bfe612e6cc8013c743e33f50fbe3
d = 308df6730957fb2e41cb1e1be1b8cc5cc8ca79aaf767102aae845b9d3c6cdc0f5d10f14597765b9dd761dfe72d55162d78609288ee68b7c3543b242c8153a8151400326078a30be68ac33ca99ae94d42ef004685c539251a9afdc5f5ca8cad0e681197a375dc3d860579b95303a8173e2cbaddad4181e1e101a9794f87a49bfd
c = 5e89d18ecd20a77fda93bb390a27d2bb726ec5cbc90e31e0c1c56f3e97aac763e9b6e0a2c9827b0e0f526199f3539a7ddb21e0db718c54a2f99c6fb3e2d33a439ab1c280a77ec677f443b435681ad42cbda7c2d990e721a4b4288e08cc59d3f319845d709099f183306d9a549202e690c209510d4da502ad9b72b5847fc6f93d
Result = Pass
k = 4dce2499e166840ccac7ddc56fe2212f3d11f7c3487ca1bfc4406f4fbae46378a6a13021ec88a8a60144c28bbd7afaf53e81907801d94efa1e2a700cd5b9d66c3bd3e5e69e2820e8d37932c0d83ba901285430adcea16f120d264d9f22f1d2ab5ca6885d9d2bcf9a2f866d5c4abd616111ee59e17d91ce9906e39f710c317afc
c^d = 4dce2499e166840ccac7ddc56fe2212f3d11f7c3487ca1bfc4406f4fbae46378a6a13021ec88a8a60144c28bbd7afaf53e81907801d94efa1e2a700cd5b9d66c3bd3e5e69e2820e8d37932c0d83ba901285430adcea16f120d264d9f22f1d2ab5ca6885d9d2bcf9a2f866d5c4abd616111ee59e17d91ce9906e39f710c317afc
k^e = 5e89d18ecd20a77fda93bb390a27d2bb726ec5cbc90e31e0c1c56f3e97aac763e9b6e0a2c9827b0e0f526199f3539a7ddb21e0db718c54a2f99c6fb3e2d33a439ab1c280a77ec677f443b435681ad42cbda7c2d990e721a4b4288e08cc59d3f319845d709099f183306d9a549202e690c209510d4da502ad9b72b5847fc6f93d
[mod = 2048]
COUNT = 0
n = d9a098da000ac58efb7d6c989b7468444d369d9865eec8696a4bc54ef47f4d04bb5fb531134d9edc1254c9665f96462c190a1c47ccf970b3a00a922a37e5ceb548ad638c425ee96310db234a97ed04342de813b5b6a4eb1ace5fef5b0c22e2330e4f285a76fb3d955ef13df1e2288c7e8974220f773b436029e5a8b03f7c9d1c8743ad2e6edab6604fae212244039c0bc2dffe1fb8a37fa8b935fb314764c76f5aba87e9d5466ec413ce3a72af0eebd0b483f2c298b35248538823d527f40e221557c8b25257a131adc7f81adf9b481c8c24405356ea42009676bd6606e7fede6b76a6a264a97507f15f0f12dec9d7bd473af9e0ae86399cf1f2d4021f13325d
e = d107cf43a692284dbe81e069739b0fa121f605eecc587c058405146906b56e1042a19196663e14b4d6d13288b708cd998db8aa5ad53966d547509426a2e28946ae2eae99c9fd7478de2dfed90b185414b2a83d184147cfdcc184314053e655aa7c5af0e065f2eb139dfd0ddd64d878fb87fd39596a804d48403e12a1aee476e8db65a9bb15f50881eb2355531549c1f26832ab8812aa10858b24832e5f8498b43249707d14b88fac7c238b2baa010058c2454aa891f5dba11ff450afcd26afc571858df2230ee7c33e86e814c52780128400e8efd60a3980557b3e95e8e6b01ce80d9a3a08faf1730d065ef1
d = 592cf1cebd9cb99616c57c2281851c02258ff73bedceffec955ab877e21abbc4e8488e836593ae9d1f21cde1bf089f1e03190752cd9cee2e66f478a50a154c654e530534bed03759e15b95f65c7302fc95868f37a2b438e640e25820a3f529c5e1f7caf461a5cff3db3d85b3ee920ba7b39ce115ce23a584e46dc576b81ba4edf3b4fd3d711ab36cb42608752d4ede8265f072671bf9652ffc9706afd6f729d449ea8f2a6be7f8c9d167f89eff4a8a5f6c2b57b29f9981a331204280a110c32f34f158e8bb0202258abd92f775747df6484ad66c120d6ef6242801a1cff83d065497701eb8b6647d69b4dc91c49ca434792a46b8c18ee70354add44d771db2b9
c = 534d1f57d948cac580b88b922bc47bc3d64c8cd1262bbf0944b99833ec94d072c1a1496be44d47a9c419dc403855a4b1cb2bb30e56e0cc5fd557d34373d785dbe70d67e30355fc228a353b05432a40874ba84253af5cc52d3ab4118e8ca1e28e6c9c610760e753f87a15912774ccb80b00ca21e85926143c1ed8385a607c4e55fa531f1f208bb3f23bc0c4eff4c272068f9939157bc61f5427cc32f017ef31f6363c8a736ec984da763ebea5eb94d83fa31d70223ec5503cfd97e598d883f43aca5e884b702a2f76d298659181cb5180e25faf56c9aa0ebe49413b9acbbefde95ec102ee4e351a8ff8d5a3fbdcee448ff466dffb45fdc0a0b3d31b3d192bb5cb
Result = Pass
k = 4d2522357254b309b5239d3350d5c0c4d3b2f1967e17da27450b12a470c5283f10b7a2c33ea1008166481245bcb2480ccd4ac0155a82435ea44a2cdc92e545b34ecd1ae87c5d6fb1aaba9ea15053edf23f82c3918d9ec3133a52ba8076df5c918d166c90a605d1755b205d7e994103f8b1b9afc16e6b274e2a0043e0ad54186c95a7256910f6e7adfa885fd4c67b1edc63e83e85f8992e4239319b18be8592030b79f4ac9e16a4650d9d7675a4f4564018ab85c0db5790e478df656f886dc461bc33c9ff32a0fd75a73a1c6626934c28c923a1c1efe80d59fb2efeb6aae82c0fc8cbfbf306eda799e0c2a3efb3c609156b2715f28c00ff58075e34ed5d327ce0
c^d = 4d2522357254b309b5239d3350d5c0c4d3b2f1967e17da27450b12a470c5283f10b7a2c33ea1008166481245bcb2480ccd4ac0155a82435ea44a2cdc92e545b34ecd1ae87c5d6fb1aaba9ea15053edf23f82c3918d9ec3133a52ba8076df5c918d166c90a605d1755b205d7e994103f8b1b9afc16e6b274e2a0043e0ad54186c95a7256910f6e7adfa885fd4c67b1edc63e83e85f8992e4239319b18be8592030b79f4ac9e16a4650d9d7675a4f4564018ab85c0db5790e478df656f886dc461bc33c9ff32a0fd75a73a1c6626934c28c923a1c1efe80d59fb2efeb6aae82c0fc8cbfbf306eda799e0c2a3efb3c609156b2715f28c00ff58075e34ed5d327ce0
k^e = 534d1f57d948cac580b88b922bc47bc3d64c8cd1262bbf0944b99833ec94d072c1a1496be44d47a9c419dc403855a4b1cb2bb30e56e0cc5fd557d34373d785dbe70d67e30355fc228a353b05432a40874ba84253af5cc52d3ab4118e8ca1e28e6c9c610760e753f87a15912774ccb80b00ca21e85926143c1ed8385a607c4e55fa531f1f208bb3f23bc0c4eff4c272068f9939157bc61f5427cc32f017ef31f6363c8a736ec984da763ebea5eb94d83fa31d70223ec5503cfd97e598d883f43aca5e884b702a2f76d298659181cb5180e25faf56c9aa0ebe49413b9acbbefde95ec102ee4e351a8ff8d5a3fbdcee448ff466dffb45fdc0a0b3d31b3d192bb5cb
COUNT = 1
n = afd168888b0933005db34786b2ef519b1f66cf637379d68ac563305bb391ce351750f7ca2dbe2d83bbd58fa1c85a0cc5b1781740326e16519c238214130826f1d125d8f48d40112626234d587a110d7aa802ee7e834ebb5f395088abd57b875eafbe67dd5de0043c7c06671a066ed58357536351c8fcf1e46b1abc7db17d18a1b625add8f2003271accbf65c60de19e0bc7d26aa609fc5ebd2457e1d214124e05a300fca82129fce10c9876db0308260419f6df2182d13c220b1ad4f28762eb7cf1d4abb55c5d1255d827631822d30fdacee44f0f9793029c89e6db2c42d18572c3aba967211a2cb40d44cabc63c52841f2413129013ec327f3428f62fa29463
e = 85b68e7b34fc67bb6920450e2df4f23d3ea4fcb79dafee132f1fdc6362487cdb8e096075002cd127919d2bf8e626ce9351ce6596af5ac8d9a4b43d785f853e37058ff14e98a891bfe23a123d6d8bcfefad77a2b4a89234ca90a2722bea810bc4b75fab7a7f41640a8ddd2784ccdfbda5ba725b2a65fc140862242314d427e9c1f04b4bdacb3678caac0e5742f317f8a3f97460ce79e69c3bfd0cd204dbb8b53292170bedf78370d15167af1356c9c02493ee86eea9cc46ea209752cd4a8e9c1dff1fbd5cd3a11d6db29c0bd80846b58c90de4b7a3cab1a87aa821812c5f53b51ed7a7bb91c44c7cb39a21807
d = 17ca814c96eb33022139ae6f02e8d4561f81a3861b8d330c3d03eb1d5bb3337231a9c57b00831610ec3c548fab73240f34654d90d07b2b7c73eed189aebb988191fde2f5b4ead9eb40f2c1356bd0aac278268869d10809778652485d1157664147d72e6e07cacb2e8ce855831188cdd7cc3cb5f8c96d37ff3d87a88976a2625eeb6a28f6df8e2311da391dd2e92cd7a72ef0390785566d896b665f78fd3e93bfc70169ac0993940c5e318ce4024262c59aa26d085d28fe8cd4f6adf2b1d3ae71ad5194da7ee7700242139dd3fa69db970355ec082098a0a47690b42a691b1e95a86949c27ea674e6211f4ffb79a2b36f897d7e21cff3aa36e72ccba96e33b6af
c = be0c23c657a95073f42526575804a7b8c45537c0c7370923589cd702224dd60e1f2fe9f068c414e94cf434b59f0eeeb6540ae64e4f11318d743f0c0c04a7ce1829971b13cf1e5b18b6cc6adec5b991dfa2c8b6b97f2dcfd4372d9d45992596f203ce23f734bf0b495b342f99730d797cd31a0fc80195cc41c8f0f0758ad216e4d75c67643db00ec462b4ebb051138cd4128559457d510e1c4f106f647eb33736cac7512295f84ad1f4d407e906d2b3318593fcf69a677fadf61380d91ed2df2f069947f8e29fa9b8391de90d3b52d7d954cb60a301e1063be3838d9d1236f718b359b3b0cdae12c05816fae4979cde15a8b5ed165ac68a103ee7fd7901e76839
Result = Fail
COUNT = 2
n = add4fa4a8739880df5f0d447c31703060fb5fb595eb67930891cc12695080f46979e9330e87a210f994264dcad9a3a305e4d918281d1c99588ca7bbff75eb06225381499b8c1a15a79f34a4532b70e14f8e442f3151fb0b76fc6013db13c4ed695920709ae895c92719c240045b795bc91614138a95366987484277561cbefd82416361cc94790b6e4c224924fa6b3dc086d66601152536df76c070253d9f8c2efbe6adba06bb7c164c11d050a16a58a7ffb383159e9f4198e508be04a5de7e0a03d0a5a3610ffc20486e2c67aa4c8e421e4107aa084533fb8522555d58ab90c97e307711d36bac1aa16bc4fe98ea366dce234101770b2ed27ab102fa3138b1d
e = 15d43816a242725e744bed006ed70043d083bdb1bd5c2b3ad84901915b6223ef2e95d74f2ee264bdae384039aa14176157ac3f6786bd9b5905e552789f0c175b82d7fbe0ac5532058af0132d6f3c823871fd4738e81b27c03c76f499facfc4cb1fe997787aac104f0d2126b4d376bf701e7340285227d8e4d09d72519aa58dce758b866da9f66e5878b0c223a236633f5847e914a06115b57894041e7ac075453929e4fd0d86e55e3f0a94b0c1a690be0c431229565b50e81ed2086329251755f640480fc97ed4020a652182079ed1bacf64d8165f18c68c5e57c1fe56a08ef4a5404e1f715227e985292599
d = 22619aecf5cef47da45b6573192b4fd33756e0c1e0cd99249c878dd3a4ac8e0dc47151e488e3eef56f2035a9e16ca6c40ec84e662ebee80173219dd5c14c60580696d2fdc33e83be379e77cfaea3342682ec6e9d23e45898e6cf84185b6069c5aa7a15028bfc78e7dd49250f3751790b4713eb2d96bef5e5112884b8446b69d9dfec28b2250a9c8c467e7896c0f67f111431dd2c318a365b11d4b58e6b4130d0724c7684c585126fea00472bdd272e7480e630e6417426cce6dd96e778a641e36a3be11fe69f27a45342659ddc23597c640f100303a53f9adbae0e2e1a1e57098f87ea3dbb061ec364018feff7fd8bade78935a64df10438f935dd520a1fbab9
c = f1e607554bfba5280667c5dcf2cf4958a67d274b67b06d1d4b3682259d3dae1c8467dcd1e01c9f1f7524741c4b754794544938b650749e0ceef54cb134cb14be200a8a05902d0a025faefd0ed1d457d631cd640cb8fcc55cb194b6a2db66925a0ff7985722d6efb90d2ce8194b958406832e36b567f0e9f4dc3c45605bb62ed897578e3160be552bc7c7bea4835fd30c9397331925f713bcb71483537c64f2200152f5fa108e4442d5a705193fdb4ed0a92ee5a0bab94a9c8945f7e30518e61a950f541afbedc5e57ef348df48b1fc3b0d1bd3b3eddf967c9cf62979c07911af9ab733f9e984defc0bd40c5e6688e533068785b88711ff443650a27b73307bc5
Result = Fail
COUNT = 3
n = dacf6b379186d92a38e18adf394dd56b2cfdbdb41b22d7c4c6171bc994df4d37edfcbc58f25a6ebf9ce9c4e979ca750f5a5243fcedcf97fbb6c78721028a1b6d6b6ce82d336dc1d8227531fd33103f3166d82fa55e5402459b12f79433c2390078e593a62493ec863622613a9bcba7fbdc09611decc074e4e46a8b657cfeb640c43c3f2a6d89ebc797fa0ee76eb782145e8a983eb6f63d4613087b5c8f5a025bfd3580887a6bc3215ffbfb594a3dfde21fc07c8813ff97ff5613d26e4b6f0db333bb706b2194718e86aa22238d64517732b9cb6a203a9937bc960b0e81d695ceff4b1c52120d6905e010a7b191c9caffa2da694faa6e8c3cbe41660de6f46e93
e = 3432563e5c37e78f1d9cc0c6c5ccfa9d2954d79680ea59086d3c6ea61f913b023369caaaa169ce0f7fec2be6abc1d66dff512639d5e64d588e3a6143543a799a239cc571c20ee95eb2307b6809a677d4b83c95398bc7d07ddb2c021fe9ef715de99b66de48e791578d5b285247901acd1352c83f42a1922e814c48bbdb95b94a7d304d6628c01f2a3abd74ccf75ee9a47d857fcab7bc4ebab27c94742ae1d486622ec92ad54501ad740938c97c7859f64ed5cdd95e040dd50516c360699e073f33cc3e4cc1b25c55218ee19a46dbd92f3bc6676fd417a39afa130c153ecfe873772e6996fd117ab2c34da147
d = 58f7f8fac9e55ffb2101af7e2223a58aee61cb1bf77352264401a3d129c18adccce81dbcefebac1244dc4db708a2cbdf01f012b3897c267664f8ed29c78ba2d76b46bedeb26cf05f4cebc9b6a92fba04271b635284ea5d353b4d0099a741f2d8d0f54c66ad309e3f5793c8bcecf796b51e8385fb4aa2dcc1f172f010050f0c26cd942c7d232d8c74d58c1c41e8928e11eba852eaace66d21eb93c8b338038d9424c91e0d36d9ad028a6725d158f46812c0f1681067be644a30f385358196d95d61a8368a963b88af8af497c63155af579633f5ed24e3132e39e27db6dd05c3d30532abbbb655cd7cb2c211a708935334e16840df9e6e04fded7d23d22506f897
c = 42e599cfa9578874a7dbc3b1638a4d9094d131fd4321681dd1e8fce23bc16edd9de75653f5f049922ab8ff854d9bb5871ee7d175d290c5071326356049055ce318ccac492910b4f02e514776202cdb87cbd32ff38dbb31045b941e0e047eeb47ba7ae4d9ce1e9336bb8ee3ac66a78539a47d93a0fd0873bcb01aff15f694e2b18bda452d6b84ac0cd9571a4ea6737c44b0cd44a4a9e055d91aa01f9ca7b00bc894d4196a88a9c7189194368569f88852f8ac8c2619ac9d00a10ec7cc9e382c35dc51a6bbaef5ae05ea2d7d78369e70088200b14ed6d214db4e4c3fcd63960ea06b37364663d02879ed0a385095cdfe1058b3fc4567bc82122843cfc67e3079af
Result = Pass
k = c47710d3fd466cf4d5de5475e0e21c0291f316445550808b1a28580d9c0330803683b6ccaef0825f1ff07a60676013e7eebc7539ba4323cc09a806811fc56878789a5bae30f179fc40c7de1751590090e7ab54d8fe20994dc52606401e18e199e5fe546a7f90c9a4b730992d3dad6316199462fc67462484f3aab85d76d438ef988134761aa13cd51c1a6419461ea634bfa9b1600a738e9be44004846c0b368d051303922629bea38b95ab24011fc6c7207056da08c45229b15b58ce4bb433d2fe184ef242b712b4c246f755a7e3b68e18d137010081c82ff3af7f115919d0eed2b5c806ca71c4b2a44b4318de600a04ab7c8e748ca7cad1eb034be6a04342be
c^d = c47710d3fd466cf4d5de5475e0e21c0291f316445550808b1a28580d9c0330803683b6ccaef0825f1ff07a60676013e7eebc7539ba4323cc09a806811fc56878789a5bae30f179fc40c7de1751590090e7ab54d8fe20994dc52606401e18e199e5fe546a7f90c9a4b730992d3dad6316199462fc67462484f3aab85d76d438ef988134761aa13cd51c1a6419461ea634bfa9b1600a738e9be44004846c0b368d051303922629bea38b95ab24011fc6c7207056da08c45229b15b58ce4bb433d2fe184ef242b712b4c246f755a7e3b68e18d137010081c82ff3af7f115919d0eed2b5c806ca71c4b2a44b4318de600a04ab7c8e748ca7cad1eb034be6a04342be
k^e = 42e599cfa9578874a7dbc3b1638a4d9094d131fd4321681dd1e8fce23bc16edd9de75653f5f049922ab8ff854d9bb5871ee7d175d290c5071326356049055ce318ccac492910b4f02e514776202cdb87cbd32ff38dbb31045b941e0e047eeb47ba7ae4d9ce1e9336bb8ee3ac66a78539a47d93a0fd0873bcb01aff15f694e2b18bda452d6b84ac0cd9571a4ea6737c44b0cd44a4a9e055d91aa01f9ca7b00bc894d4196a88a9c7189194368569f88852f8ac8c2619ac9d00a10ec7cc9e382c35dc51a6bbaef5ae05ea2d7d78369e70088200b14ed6d214db4e4c3fcd63960ea06b37364663d02879ed0a385095cdfe1058b3fc4567bc82122843cfc67e3079af
COUNT = 4
n = a2ba78dacf4a1b12888bd52b7eb4af5736a5f578337642ce72fc33bbc4ae1cb195f56c8158feb16c732d841e840ca1cffe799222849298605356d38ca6f057d1cc8fd8a5fd7775b792aa9c24edbd2c73d848d13f15dd48884b67ddc5d082283cfa43d72bdc4c36a48aad2543508f1fad909554e5da069472c92da84d5f004d794c8f743046c5b516d11f4870d8e1cc4e18a97e48350624aba96136435e7460c9b7e498c36a94ddda52a317a41958d5e1f14286e5cd31718e59bb1aaa7c100e812e68cae3cae7dcd5164b22d4bc84c52e9b95749874cc3d9dcbb98582170d5279425cbc8143d3d96141fac99bcdaf34d880557a531f359de2de618a5a87f969f7
e = f71e81981ba0bd38df957e82116a2d0faae23ff4ddf6e33b5e26d4383c16fb5ed9582082339c848a19f5f1dd124e9b5f1c33e5bca517e267f4de29a6615865619197439387112de739485f106422bccd1b56aa728d45410dc1895ef4b9530f857cdee32a16d66afe84b35074e21151a1a6f9d2a45a7e60f2da06694e458b7ce658cd2eff0b13bd917a919d5f9de068d9f38cac992e04dd91094312eedd7d9c24d559a048c52f873b5b0d54ef1b07580d8bc10c22ed300ee9b3d6a048afac9f568385f68d7f16a11b7efb26b3081ad98339bdc6207789b834a9491fb6b825a763a35cc85533abf6d4dca64645
d = 379587b1ba33f355932fd7aedff39631cf16d341a789cf294ae0057de72a527097e697f5f6825f04770f0df93a3864757fce983821005dc77201f7a60899ae3af8bfea6f8b8a37c5715a2f0e737f923d8b009accb51d59455e14cca7434e5a2dc9aef603c4869c7f47bf858fb0bad82aeddedafe81ad6e2efc2b46e8754a5e85fbc4dbe6ef477e1675f27df40bfc8a8932d53c48ce61d1b72685508a3a64f8d52bfd870faad2596a3f7be9c520466e103ef6a6b69e0218c7531e2c62e58b33fbe309dd7e9292c501420dfb66368a9083cee61152adda247fb92c0f7e61169d8ce9e9d92b89cb6a7f5382e4a892a37d9ba76a7ed563f15ff3eab56fdc6fdb1b0d
c = 2e5c82295dfb60a6e4a7d519544096779b86aeaacdd269e32404713245bc3754c4cd94ccebeeb135b7b324d624bc5b77aa2d3e73085d100f40d3960ae36e7c758ee3f4c5b56da0279fbfb213b23e5224f16d4027c3a8ba72f616a07703d9d6989487ea3d43def624a5b3c8f9872c4127772ffbed871a2eb44db5d5a02e650c65dda2bd5c1eaa7bd6d077aeb02aeff127455cb8eeda1b367e4e987eaeeb7ae883711ab649cd3af7e228f4ac5f23f02acd61dabf5147139878ffa7e2c8c380309b58d91d2dd8f532f3b5100a2efb96b3c1d593583f536a1d496acb4b173ddfad549ac53a2fc842f3af80b40f46394856aaa96dcbe088898d9997eaffc2e1ff2757
Result = Pass
k = 23fe7f280bac1aa67d089288d082b43f95a1ad3ad43ab408b563bb2c6193f0d3578baa3182c1345f622639fcdca91f3cb87ba9fbe717ec05a80dcf55fb5c1f2deb38cbf00eda9a1d60a617bc52c261bb054e3c5323ecbc72368649dfcd58be10f1de6692eb93eb778033edcfd901f6e6bde391ffb5704322c191d024770c0155baaed6323f6390097dab8538ef3340260ba1ffc1d2356624630919bf668a46b04c7c86531866828a789d7b4dbb99be164d34374b0f0cb4c1d36d43122984a9a468fa9808ad6ce28eb064070b2800240321b45b2d50ba98f8ab067ca275e4302ad0f59d20151b263628a34d79adc2e8c2e280db80e3a714cb4cc38802acf64696
c^d = 23fe7f280bac1aa67d089288d082b43f95a1ad3ad43ab408b563bb2c6193f0d3578baa3182c1345f622639fcdca91f3cb87ba9fbe717ec05a80dcf55fb5c1f2deb38cbf00eda9a1d60a617bc52c261bb054e3c5323ecbc72368649dfcd58be10f1de6692eb93eb778033edcfd901f6e6bde391ffb5704322c191d024770c0155baaed6323f6390097dab8538ef3340260ba1ffc1d2356624630919bf668a46b04c7c86531866828a789d7b4dbb99be164d34374b0f0cb4c1d36d43122984a9a468fa9808ad6ce28eb064070b2800240321b45b2d50ba98f8ab067ca275e4302ad0f59d20151b263628a34d79adc2e8c2e280db80e3a714cb4cc38802acf64696
k^e = 2e5c82295dfb60a6e4a7d519544096779b86aeaacdd269e32404713245bc3754c4cd94ccebeeb135b7b324d624bc5b77aa2d3e73085d100f40d3960ae36e7c758ee3f4c5b56da0279fbfb213b23e5224f16d4027c3a8ba72f616a07703d9d6989487ea3d43def624a5b3c8f9872c4127772ffbed871a2eb44db5d5a02e650c65dda2bd5c1eaa7bd6d077aeb02aeff127455cb8eeda1b367e4e987eaeeb7ae883711ab649cd3af7e228f4ac5f23f02acd61dabf5147139878ffa7e2c8c380309b58d91d2dd8f532f3b5100a2efb96b3c1d593583f536a1d496acb4b173ddfad549ac53a2fc842f3af80b40f46394856aaa96dcbe088898d9997eaffc2e1ff2757
COUNT = 5
n = c13dd5aa8d4697085ef847d809956cd8fa2c7057f206713ce61a3a1c7a56aea2a00e07d46a04479646e0f6cd306646658b5dbafb209036a0e9f61766d83a51cb6f45d7b38ef7be5483fe46b2b80a50b80737d8fa1f7f9987f0e2bad6f3fb5d8b8a4e7fdbfc29e4496c423f675872d17c307c016b4123a7c813ab507aa0bae63b6e23157b08191b1afaa11e85b8208a0bd4a14795ecde7608feb1f51d0da6171b2e2c8e4fa625c629a5b5eaef65a0a71a6c08bdd8a3cb2e9d1eb4c4584689da81fd2106e349df8cf8f50fe9cecc709e1462e3270cc9f934223ce463bf955cd68e36502a059895d9c45fc0d5029dc009d3b629380ee7477a1236064e014241dae1
e = fe69502e23f2b2be9056ee6b1e29e3e826f3a43c2ab005aab19c1a0418f2b30dd1fe6e25acc0107938943c961316712fcde09271a73942c98c3e6e906513b8e5bcacc226294078d04ba3a98efb8c4f86f7938a9b78d6563e8daed8ed9475150374c5ba5bc1ff4120506f121a87cad8cc32f2372351c33164d1ad850eac14bd9f80e80b0a4537c661d32054563ab01456575fc672441ecd693a8dfa3dba4d70c6ae23fca6db43882f313201bf047dd07800d256afefef3c8954c54fd291a2ff5a95a35bb4e6a9e4ce0047b71fd518909bafd625d9cadd15e5db6f103f81e14229fe6fd48e476cece911c1db7b
d = 19c10372f37b3f400cada8e5099fbdaa5cb0def2adb8e414b78910c74882e11057c4c62e2cd8c8f3f68c3b8282047b41d552a4f76a847eecb1c387a97a133a0762af39cffa26b0904c26410c223a05a2b44cd74b3760c079238e6165fdce1beef815f900c94aa3ea3253d29d9b8d79d40b83854adefea288ba73566be5037048b1888b4da89dc712d6ec98898f8584ebcc19dbc540fce1f2311f2b2433d4afcd33ae75fc3d3fe6e4a575982872901f100132a13aa5afb9449db9285a28993325a551532ab7878faf80749972c4510ed504ac55a9d0dcbd2afa4feb80a2f52aff26f79506dc326f535f66397725e7497d77f8d4ba6ea03691fd4e1900a7f18a99
c = 67a8dffa58643b7387419e9b5c1d3e5f5d717e2c96286d5e3eb28ffc9754e1a216c217bec4ef28ffe4240c0bd650c4713b9f9cde5a4dad93c3bda51631c5cb28b54c3df811187c9662e12baa03aa1466ad516cb9e36458c68d36b094e33202078c70da0f0786401f4ba183e1aad43528fbaf7726f81477dfe54636dd73438f25e354756b6ee27c82e58b9a1695752f9d6de2448b630510c51315c159a99f796c022096740ed336a779c8fab28a360baf4b125b51eae02e625fcad8704fefc8c330fdc592af0278764e7f2b1e52bfd045dc6645e1564dd69d108d048a2bda8411b7138b2d181649d7aed9b3c1b5b78646690789a16ef3125e7088cb0f0709b640
Result = Pass
k = 8a5fc5cc032f0cf4d9cbf2a303fad08f22a2941b25324f56e72e546b0a0d5bf2373afd66b583fc57a26c4470096d7adfd468cb209fd7f1ddfe3711dfd0409979bd9eebac1264d12834691a60e806b4b5139b48789d9f7dc7ad4780cde20ba8ce3e6dc1216ba441a095994c347d530a046d28ba058f8d3d07f1dca451c9185923cbe5f0ee647e14923eb4b163c5719f0ee3faf4acf2def1683bc142ab7490cbcf5e983b55084cd19cf76ff86221bc64595af589b78217be75ad61443ce0a71114ab490cf97b14509de56c69e4138c8c0c3767088ec35c9865bc5d4eba2a6587859b683133a039730add26289418b30b38b2503102634820cd4269582482610cf9
c^d = 8a5fc5cc032f0cf4d9cbf2a303fad08f22a2941b25324f56e72e546b0a0d5bf2373afd66b583fc57a26c4470096d7adfd468cb209fd7f1ddfe3711dfd0409979bd9eebac1264d12834691a60e806b4b5139b48789d9f7dc7ad4780cde20ba8ce3e6dc1216ba441a095994c347d530a046d28ba058f8d3d07f1dca451c9185923cbe5f0ee647e14923eb4b163c5719f0ee3faf4acf2def1683bc142ab7490cbcf5e983b55084cd19cf76ff86221bc64595af589b78217be75ad61443ce0a71114ab490cf97b14509de56c69e4138c8c0c3767088ec35c9865bc5d4eba2a6587859b683133a039730add26289418b30b38b2503102634820cd4269582482610cf9
k^e = 67a8dffa58643b7387419e9b5c1d3e5f5d717e2c96286d5e3eb28ffc9754e1a216c217bec4ef28ffe4240c0bd650c4713b9f9cde5a4dad93c3bda51631c5cb28b54c3df811187c9662e12baa03aa1466ad516cb9e36458c68d36b094e33202078c70da0f0786401f4ba183e1aad43528fbaf7726f81477dfe54636dd73438f25e354756b6ee27c82e58b9a1695752f9d6de2448b630510c51315c159a99f796c022096740ed336a779c8fab28a360baf4b125b51eae02e625fcad8704fefc8c330fdc592af0278764e7f2b1e52bfd045dc6645e1564dd69d108d048a2bda8411b7138b2d181649d7aed9b3c1b5b78646690789a16ef3125e7088cb0f0709b640
COUNT = 6
n = ba1faaa97aabcb0b18afdf3d1f5d67ab589c9442f24f8ce53f55260eb8d6ed1ba72d102d4a8306ce089810aa55df9874b4d85d57672e11816ef895d6754aeed7baa1805a7c94135678a0f80ed3858c2d5e60b331c1ee648c064deea2278e3c83c38a318796bccd5293ad99845bb2dff97d7a5c27c7fed5b892dfa0da9c231ad67ec374f86aba1ebec52b3104a1c9aa294430f639bfa6d26e8112a17866eadf3ea4b437ecae54f4203bd40dc2d196969079a74e9d20e3d69a4a5eebed2bf4e1a92c254ec04341c8c84212d6dd28a5293946c09fdbad4ea0953a43f29372b4f24a98740937ac93144c7095feff2a7833f58bb268bc55528d49b45a4307febf659b
e = c27b115142cc3adaa5f76bd75e372aa5d28145dffde61a9eba87861121922a4105d7da4f65d425700b9dfb8f74a2a4cb1c576fb353ea27eab88fb6903b2956e19ee24900b25275e7277abf7e5de20674eb85e274c4dec09df8fb50e1402f38af403e9574a916b419fbe9fc104f4492857e8a915167b0648fc94495a92925d0c8c061735ded2744e00c39f3bc3d0d8d73c155ae075f032c1073ac8199501907726f4c3fb72ab4ea1951712b08be6e7f9bd6aaef628bcfd1861de45b014983c7c2c93d4dace794bdddad00436cd73b19e6ecfda766b7b9077a770021ae0b1292be562e5c2897bdadc5e15cd2cd
d = 39438fa36d7ae8e05e5100363b19e4e706bceee7cb1ca0bb70b4b1ca3f78e4d69a16e0fe3b7c9d5ba831485c8f70f59be58987033a36da6818c1b8d31d864c615889342833515a3e85e968547fb885e69c8f1210a91fafe39c07879b4f8430974f195d8f6239b2ca185e9db75008d6f9232db050329c357bcabe8c01a5d2a3be4610dd59c9e2916a53661cd8725feba92e84e00f2d2611d2d4ee913a6422211ea9ec326c8c6f8fed3ce9acd7c5014adde49cd987f7be03db891ec5800dea1cd997c5a174dfd92bff243858de92d033d5499666b95df5ddcb029592d390262a49eb7e240cd52ae76b3188e620ccb9524d2c71e323e9a4fc78269e678c3836ec45
c = 7d4da0516ff08f3fb62de45d47f461b3211a1466dda18a24873a40c2ac085a24b4a7975e726d8518faeff137b3c7a2baad9547e13444ad95a58f350480c3868cbfc67fda66586f535c9989b279cb92f3e05add718f19794b34cfa90b42f2948a45b23e0e733ab7b683329318c28899286370c05c16a9570ddd0283211b1eeee7ee74be42bf99c40a18c2f6afb585201fdddfd6eaf37bada44831ab8c33cefb6a6413e5be7500fe16c2529cc07b4a8da1f7b009654b18e4d91c640894b18a23dd4c979dc9bbf4cda42ae86c923b5f4a7659ea3f134906657201a18483bedace065109cdacb9ff997af78f4e6f1e4dbd66aa95623e12cf9737a1f2069f814764af
Result = Pass
k = 7f4372b8b758bde011249d12ebf344b5ca74afcca9f94f15a1c00d164d5d43da9ca8021c5f71f4a3aeeb9d952c75515cec27c6b988d670ff1e1804f7ebc6346e25f867ff17e430da93160db5ef055e4efc75329190b6931d0e7ed7e4e1288dc50d508b74e35863c4bdcb9a1af9435d4153773535f8c304809ded940f6530606c204f8ae6dc55887f374747cbbef4f37c6d0dfc1fabd493bacdb05552f9a68cda9e5db9bbcb3be2dcfbaed8a06d56e14cfa00bf0b26de8a7831cddb1935327a7426ad7c7d82fd5b5be3096e95114f81ef0c481abb575e2f98886e293b1acfbd9d44e96d046ccbdc22fd193f7520033bfdfa1d4472a513a4305d027837051abf5d
c^d = 7f4372b8b758bde011249d12ebf344b5ca74afcca9f94f15a1c00d164d5d43da9ca8021c5f71f4a3aeeb9d952c75515cec27c6b988d670ff1e1804f7ebc6346e25f867ff17e430da93160db5ef055e4efc75329190b6931d0e7ed7e4e1288dc50d508b74e35863c4bdcb9a1af9435d4153773535f8c304809ded940f6530606c204f8ae6dc55887f374747cbbef4f37c6d0dfc1fabd493bacdb05552f9a68cda9e5db9bbcb3be2dcfbaed8a06d56e14cfa00bf0b26de8a7831cddb1935327a7426ad7c7d82fd5b5be3096e95114f81ef0c481abb575e2f98886e293b1acfbd9d44e96d046ccbdc22fd193f7520033bfdfa1d4472a513a4305d027837051abf5d
k^e = 7d4da0516ff08f3fb62de45d47f461b3211a1466dda18a24873a40c2ac085a24b4a7975e726d8518faeff137b3c7a2baad9547e13444ad95a58f350480c3868cbfc67fda66586f535c9989b279cb92f3e05add718f19794b34cfa90b42f2948a45b23e0e733ab7b683329318c28899286370c05c16a9570ddd0283211b1eeee7ee74be42bf99c40a18c2f6afb585201fdddfd6eaf37bada44831ab8c33cefb6a6413e5be7500fe16c2529cc07b4a8da1f7b009654b18e4d91c640894b18a23dd4c979dc9bbf4cda42ae86c923b5f4a7659ea3f134906657201a18483bedace065109cdacb9ff997af78f4e6f1e4dbd66aa95623e12cf9737a1f2069f814764af
COUNT = 7
n = bee45e6ca63b88af2c7c4010eefc78ed53c112ee43f0ed6c3289ed4e5ac04014b9e6c9b8d3922c14ef77ad05c0c7853eb084ead872df7d7a4d0cf6eff52914677ce5b0e5ee703d17028cb7e7e6b381748b4b5eb7adafea963c0c5efabda0ab2f2bcdbf97ec6aa8f631235479e54314ba97c538895b750e7eb558c4d673716ba845fbbf7184062dc8f1c839f1a266b698934133f7b633fc75ebba50487165910dd43087585378cc0aef6317cc3ae59598c9f569c88c26d02afde784d0430461120b73577f0ae868b2be68bfd18a95af50167e759afdd787d80a96805d7aba0419e1ea89415c51cd056ed66a20d188e366cff495354cb6b4e3f18d0881aab58a37
e = 72ef24093579f49f14d57927720bce29049c3ed70911463917edb77f19948765849c633039712bf084de1b5d10a110db0868c2958e258363c3897568f2bd2e1dd018d61f273fa779a8eb53214a5d4d141b8146bf322dbea6d177492196d07a441c638fa6eb8e7e7fd233e9cefca1ae404414a417cd554f4cc99f2d022738874c0330e01d6a63c4600dc01d8b49232a17578f41aa36cc64623d8b227ae135fe8f2dbec28c23b66245cafcea80015980b7b31b07b8485a4c94038b217b46174c0c637f82f23522a380c0d33ff76e10cd46b5c892110350f634f3bac00857834a3cb8ddeb275a552a933daba731
d = 4e8880a99b5c105bdf516adddf5e05b5521cfd0195d882591c299e8c8cd9ebc5eefa627b9d6056fd50c29d384fc83316b2ab7a22f69438562288076dac63eccede8f342ced61b754912490a146c91f93cbaf02fc14f2b7b3d3e401e6f04d20d6d4d7b7fbd0aceeddd0c0495e7542be8cb0eade3f464d529a1d5a0c4eedb9f98f267338192cdc9f91f42d204470ec10adf09033339476d31330f7257082279444bd476db695b86bab784a940fd60f762108a785a7831e379f399235e7060fb9f89b77ebdc8607880f2952aaf61e8a8f42ec47302cfc531111978a2b7146006f793c9023bb54247e4620dea4155da4e4da3c4a25c9559b1ddb5d4ccd61c69b6859
c = 1020cb28246e854ff177516f45a87cf3e67830af6eede87e596227295d876a8bfaa95bf3513447ca3976d27690a5ea7dcf24f9eee1025ffd36c41fed1364d8332c99f8d874592c1f349c1b685a64535414fa832a9e7aec79599112ff1c86b7cace77099d35e61b950974920c4deba1bedf82372a4d5d763cea54682821f5ed990accf80b3be2fb75e183a02c0f44ba0455457bb895b4e78c12928830caba64e8061f2cea2f55b607e353ad8e4877886ea0cab89a1e8626b2f8d5dcdfbedc02ffeaf80d02b8473393386b22fba18af143e899579991db1bf6c6a4cbfda663b125dfdf031a7fc15a610753653bc187dfcd543bbe7d96bbae9fa188bd51295858a3
Result = Pass
k = a0197aa5eec1084f99d4208de689f1bbd9985f47f1a1f251d197840a542b0cc864b4079fa275dcb20a6f31cca51303f3efc2250dd6790f33b3e55d77723a1ad9d518f6b6afbc5b16101b19b3fa3cb58758f7a10d6dfe1256610ba2d8d212d9fd0824d2d800cceb0d966f83ecbf7f8dbeed714afd6fa1faa4620dd7caa1d24c3c35db1b585b1623796721d23dfa41fdcd59df9f2273f6d0e7e542dafaedd2998cccfc6f35ad0dd2733bb6b06a675deaa515f4ac964c1a3923d362848687b7da4217c641cb72de0c05ab9775108be745179cdac78f1f313b66609a2a5a5898c45551cb7917ee0f9db0730d94dfa7d2ffd8f66045b579aea44a9d0110fbea32331c
c^d = a0197aa5eec1084f99d4208de689f1bbd9985f47f1a1f251d197840a542b0cc864b4079fa275dcb20a6f31cca51303f3efc2250dd6790f33b3e55d77723a1ad9d518f6b6afbc5b16101b19b3fa3cb58758f7a10d6dfe1256610ba2d8d212d9fd0824d2d800cceb0d966f83ecbf7f8dbeed714afd6fa1faa4620dd7caa1d24c3c35db1b585b1623796721d23dfa41fdcd59df9f2273f6d0e7e542dafaedd2998cccfc6f35ad0dd2733bb6b06a675deaa515f4ac964c1a3923d362848687b7da4217c641cb72de0c05ab9775108be745179cdac78f1f313b66609a2a5a5898c45551cb7917ee0f9db0730d94dfa7d2ffd8f66045b579aea44a9d0110fbea32331c
k^e = 1020cb28246e854ff177516f45a87cf3e67830af6eede87e596227295d876a8bfaa95bf3513447ca3976d27690a5ea7dcf24f9eee1025ffd36c41fed1364d8332c99f8d874592c1f349c1b685a64535414fa832a9e7aec79599112ff1c86b7cace77099d35e61b950974920c4deba1bedf82372a4d5d763cea54682821f5ed990accf80b3be2fb75e183a02c0f44ba0455457bb895b4e78c12928830caba64e8061f2cea2f55b607e353ad8e4877886ea0cab89a1e8626b2f8d5dcdfbedc02ffeaf80d02b8473393386b22fba18af143e899579991db1bf6c6a4cbfda663b125dfdf031a7fc15a610753653bc187dfcd543bbe7d96bbae9fa188bd51295858a3
COUNT = 8
n = d37689a77d930ac8a12af47830e94b62e4ac68d670deeebd675ddabe059b5dd1a788828783891cedac28813e069a3f417c6eaebfa6090b5e0e10526d859b46de9ebd0e760c579a83669ce25622306a8e7090916dbf7c40b1b03fc013cd0198a8ae78838c00b8e90cc9d2343095635810f546b9332175fb857b57b88fcf3a56ff506e9c81cf7c11caae57044ed2808adf37a15302651e389a1d94ff4c7f30ca1ec481a8f72b94101d36914e8f3482adf9928b7238661f85ce087f7354ce3dbc1924173bb603d08160bc00b8304f81be0470e221c503c2b4ca5dc3d1c751105944ff2428382d000aa2a20db754cfa224c91368aeda229fb73842aa08ebfd27551d
e = f6b3cec45827bfd05ebedd0fc703a3c1e74c941ed566e196c5299a76853289f6c9cb7f96b11f2a040958b184f4b09a437c42863b5a2d0231770a0b2e1b0bd0e77365e4cad226b6159f1b82744fac0a2b0126b2caac3c5942312293c138cea7076e1aa2d854567679ad37ad20a8bde472518f6777f3c4d21f42ce9edff1ce64ac7040272d6ca8e0a5bcb1909aa2da00f350357fe76add7dabec19d1543ca611ede38f0bdd9fc2ec0983ea77b266a7cd90e18eb48fe5e4d4cc7965edb46c23f5e6b40f77e9360b0776889fb9252ddd2b01901d522cef5d12aeb5942b6ba5c44a0ac5cffd705c24a0c2da437c45
d = 0ec2f1aa6ef8891b896d8845fbe6a20b77b52463e4f97b8fc6e4aa634e245b4a6cb6ddd294a4f121884c103a4326715d6e0d7b8503e374bd41b0a48485e7bac2ed0f5848a5f43baefdc9812b1625570cb48a4884d0b1af5b78063c1783ee690ecf603e97e24a6b1ee0a12eff3f2521c6cf7962ed4df9c0d707bcfe534f3d9368e59568de626234a475e549b48ffb74b6ee527f5534cbcedc0fee133631dc2c6003b0e62f7c655473aa72b69460352a0c24a1f6369bdc779108d27f14cbbd302f87dbf5107ac37aba83851d2815c4dd720ad74906e277d67bbc3f3ddba9e58bbdc273a623b0e51b276fb89741afb884f5b57413cb212852f5d28fdc1cd07ca563
c = bbdd187566e7156cf520fb4aeacf8137e0f53bcb1e8ac9746c0a4f18263025fb8e01cfe2660d2f79bff2f9f20c2168ef7ae52fa284a1b332c15977610173d76d99bffa33fbb6029a8aff852fac38410d20f20b0092fd09ea6ce72165f0bfb1a9841e81b14c69f699fe50884bf29a755a7925b72e7028346215bc366a199b1a79f6274ca182ae733dc4ece88c07d16d9e2e851c7447aa9d6363e19cb9a48f7aa397e1434ec40de14d84db8f3b136590a1e61a20193f09abb4fe5d3d9aba233af010544fff3b0fa892e526639f3ddc452a4aedac677fcfc51f8f38ff5483e0c028098856fb0f3b30d490d44e02aec0f6030205a9a43083556abe7acc31264d7513
Result = Pass
k = 846741525e22175ae809d4d463563d84858d84c1aa80136c78f68117f878163141a4d7284b6feaef86d6416db745562fa3a3d24b56b6544bd33e87dbbdc617142d03123ebaa6364b34981464e3537125128ec459d70d9120080edd8074c8b973c046b10c40cf06abaa3664190d73203ea4b5ce6d86d65db806c9364122820b7815693b1da9a56c5ac0f26927c0f72d57736fc61501b890b8416ef2d31e613ef4bbf39e4d1273ffe06466882bba9e3f50333e7be08d63104988e6b4531b1a0b76565fe4c0af8b765dac2dc217cbddc7d07cd930748883a3847a89dd680cf164d5701069083d43aebc0210746392975e064e854cf0e2de3f8af2258c5fd015b977
c^d = 846741525e22175ae809d4d463563d84858d84c1aa80136c78f68117f878163141a4d7284b6feaef86d6416db745562fa3a3d24b56b6544bd33e87dbbdc617142d03123ebaa6364b34981464e3537125128ec459d70d9120080edd8074c8b973c046b10c40cf06abaa3664190d73203ea4b5ce6d86d65db806c9364122820b7815693b1da9a56c5ac0f26927c0f72d57736fc61501b890b8416ef2d31e613ef4bbf39e4d1273ffe06466882bba9e3f50333e7be08d63104988e6b4531b1a0b76565fe4c0af8b765dac2dc217cbddc7d07cd930748883a3847a89dd680cf164d5701069083d43aebc0210746392975e064e854cf0e2de3f8af2258c5fd015b977
k^e = bbdd187566e7156cf520fb4aeacf8137e0f53bcb1e8ac9746c0a4f18263025fb8e01cfe2660d2f79bff2f9f20c2168ef7ae52fa284a1b332c15977610173d76d99bffa33fbb6029a8aff852fac38410d20f20b0092fd09ea6ce72165f0bfb1a9841e81b14c69f699fe50884bf29a755a7925b72e7028346215bc366a199b1a79f6274ca182ae733dc4ece88c07d16d9e2e851c7447aa9d6363e19cb9a48f7aa397e1434ec40de14d84db8f3b136590a1e61a20193f09abb4fe5d3d9aba233af010544fff3b0fa892e526639f3ddc452a4aedac677fcfc51f8f38ff5483e0c028098856fb0f3b30d490d44e02aec0f6030205a9a43083556abe7acc31264d7513
COUNT = 9
n = cab0e5eb5d84ff2bf60980815098f51fa06eda89b32b330b43fe15f4c14fbf72e3ce364fa107e9f86dafd3decb14f817f37d71c7c94d0fe11823e842117c01b48445a5c5d40d091334f8b7939868f6e1545c1f7153718cf8bd0b4b953e582bde07061f81a0940f3846f97621f8a459b234f2cab4e0ef3f35074c894b514fcc81b7ebc337ebc70a7ec53f4e8425b5e6b367c463ee6467ba73095f75414035a06ed614544cdae9eae9d22a84e9870688d38f29e178c685833a5d899e6fd1aa6d316d3d5cfb716521222566952f9097ef2e4d946956ac52d8e6ea48f98294884871c361ca877b304aebcca85c234e08279736e4e890f1a2e45a466ea622f26a2313
e = 724ff0e239421813985d3f0dd48eaf71a3318fd42955a451a8e75c696dc40c771d9848f6f38319f0df33b2053ffa6ae579dc48d80d2a408ebd79dec650fabe212b20a4138f16bb6cf2395a1a0df7935b9d424682f2b08eafd13cf8aa40b87d26bb1e23ef46ab94dcea227507d931299c1b8baa6241553b10252ae9411f58887c0d796cbe3035847993029b8a7e85f35c892a59dc6eb3a2391182ad6a367d08ad636f1cb75b0d0db64e8479ca0a43ef60a3d4ca0ebcb8edfcf34520f86c43a67487dd4269d78032b9f4d16aa6561cfeac6a04a5727e04552139a2f6a5716cf81afc431d23aa91de3e55153d9f
d = 23509413005ec5e23f8027eab3ea95c3a72ae0a28a164f24f5fce1036fa61e4d5d2432c24fdca5e03f0b92fff04e48b60d658bb557aab7dffca36cc9e49ee1eb0396b4235746a2aca315565891ff71e050868443c1e68defd11b361ed09e8ca7e4f0e7818c227d232ccfdb90d25238a77c0e02368e5e2dd4e48271ff2edc76dd838dcc4440b0bb285a0e8481981873c378f84825386faa277c715332ea95f87fb5a39a906337c7c4c83cf0e3b851b4ef0c23929a754751de106bf0ed18f39001905d0ee8734cc43921a72a6b9c6a7af22dc2b11566bb96e549448d634e8c5f565786d11ce94b09fcd24cc85486d7396737f5f0b70dae3206e09fb6475bf6b56b
c = 44e9415108a149ea6d200066568e80c6d18d745feebe857fd2861553071230081698bf3158e0ff69090432399e74953c583c91801a8a3530786ae47010d54b891dea9646497be49ec3cbf892929631592952bcbb3bb508bbd0777a789959635580662f588479dfd0c4ffb93bd9fe3d6669575cd6f948e5670334403349a75eb56895f02fb0e2d7483327dcfa1cb4a2ab43d1d89afe4ab37d392a9c69c9c626f1fdfd429276bfb64f39cccb9803be4670dd4a9acfefc35c4599dff7e1c0bea15166288e4a7e17632bfe75eddd352613fd5f49093d77bbc7074cddba64d798b91dcc9e3a206ff2c624a9aaaa905bf4f099f2578dab3c3bdc0b7aac4bbab65b559c
Result = Pass
k = a21bafe520e650976d04ccfab9eeca93456c745e9a82ef91df95c36ccc731084f126ac2f74d3529fe38e25c1d1fc78b601587d8f79db40d26a013c0cda60211045e282f218821f5e85e4760c75170a34bcaafba531fd77f2490086ec16a603990b92a49fb775067f9e401714dc825b3f01674653b0cd004654c3580de56fc79422c8868863648b9efe7ad6594074bc70e7370996190373b36bab457dc2f6b0744a6574822371481e5fc6ba49de5fc21edb337f2131f194f6439488c3ea6f2c750458dfc93721a381a4c4e0f21f4c229b1c9428d80585323cef540f3bbb1bee23873fe5d431219a0c842f8178f8ab5f69a2534de585f0bf5b1d2bd09e502ab7d4
c^d = a21bafe520e650976d04ccfab9eeca93456c745e9a82ef91df95c36ccc731084f126ac2f74d3529fe38e25c1d1fc78b601587d8f79db40d26a013c0cda60211045e282f218821f5e85e4760c75170a34bcaafba531fd77f2490086ec16a603990b92a49fb775067f9e401714dc825b3f01674653b0cd004654c3580de56fc79422c8868863648b9efe7ad6594074bc70e7370996190373b36bab457dc2f6b0744a6574822371481e5fc6ba49de5fc21edb337f2131f194f6439488c3ea6f2c750458dfc93721a381a4c4e0f21f4c229b1c9428d80585323cef540f3bbb1bee23873fe5d431219a0c842f8178f8ab5f69a2534de585f0bf5b1d2bd09e502ab7d4
k^e = 44e9415108a149ea6d200066568e80c6d18d745feebe857fd2861553071230081698bf3158e0ff69090432399e74953c583c91801a8a3530786ae47010d54b891dea9646497be49ec3cbf892929631592952bcbb3bb508bbd0777a789959635580662f588479dfd0c4ffb93bd9fe3d6669575cd6f948e5670334403349a75eb56895f02fb0e2d7483327dcfa1cb4a2ab43d1d89afe4ab37d392a9c69c9c626f1fdfd429276bfb64f39cccb9803be4670dd4a9acfefc35c4599dff7e1c0bea15166288e4a7e17632bfe75eddd352613fd5f49093d77bbc7074cddba64d798b91dcc9e3a206ff2c624a9aaaa905bf4f099f2578dab3c3bdc0b7aac4bbab65b559c
COUNT = 10
n = b39b390eb567e531a8a9a4616a45dce89b9a3fd3e9bc592bb83211374c9eaef8ee45ffce12138b095514b65b859a034f6c296f25f168a8c23a7c144362675b488fed726b7ed1cd99a2bb4a41c05ff6954883be8110e80f753d39543f291c3027125d07c3f337cc2c43d6d7c1e2c83624d7a17f25ad1d1b7737bd022248c406e7ac028746d31257fa390ce506d8e13fa4ed3dcc69b63ec495fbd6ab67cdf33e657d97a792673d1e94c88a2a87618dc21bb6d72779d546d47f2b5ff4f8e3734a3c4e7238d7a4c6701990df7eb9a6a15f42c2f6728b6c8db7fda5b16303ea7bc3bc803a9689891b98d37930aa0c137ee73db52d9b3fb35840e90f306ae51262b001
e = e8a10bc0a9d9973d2dd712ce1ef77a79b7aa44ece690ff006298a891bf72c251b970a3b14f70837877517a73e8d430877cb29e155cf863d0c2ca23d1ce16733773c8f71dfded55e3a278f4f90363ef5521a76eb87af53dc003c2e9660d671612890015248ad2a11b7f1b5ea633702a8b1747da14023b5b38feb155f29cbbaaa5e3bf848dd89ca5551a4db6068e13464825555080b30f60b88bdb145c7d192455b98a7e7fc8dce339d50a88fa08b30e684e637fc3fcac159b690355781bc014c1303bb78f422bc2801809657bcca4af2c5b64a7582d1883d4b01ef45a671c46c73262a925d506b8a6e4aa92ab
d = 17325b84a08c2cdff7b2671ea0f948e4fe168b22a8b5239c5849d3612ef679a5d4ce68fac111c527b162e63f1a96ee324316d5e480523f97b48868cab65ed5df4d3c64eee2d4eacf3b5d7a42c0b9e699b7e2d41eb67a2300950f80a18aabba7463a2980becefc048a2d0db98810dc1ef986bbbbf5a1f61026ad2ea1093131665817bc8ac744e84cd471ca0877bd085947e71697e946f4e2514cad526ed0a00a779e6709e0bd3e2bee3ffbc3dfe24bd9ea8acf3b78865fed242c5670690ee6262191f776fb632cadd3b114017a11986917ad296920898de02bab6f8baa77ee3dfefb917fbe96bddc690c76a53edf7f57784be57442cb54beb607cf68c3127d139
c = a2e18f72760f49bf611eed99bb9343bd22266ece7abc13ec3395bd89cac7807893ebdd47b516e6cf760ba209b9aeb324c4bc36d447baebec9a2b962f4706a563c86712a892858b0852e4d14f76cc5e1deff94a3935946f288c62ccff873c2775cabff63c134480927c124013fad38ad12a4571a64d32e7c990a226a0924f4fd5205951ac433b0d947cfeb8fc4ead8067fd0872c3967c9bf62f536dbb702965ac529feb9f27537a36db0f00b279408808f0aa1637185bd2d8f0dd69f72ab0b121e9f78cbec9720ea220ace2de8376e9dc8c9325abdbb5d6975ba9e2fdc6ce7a5d6ccbfbb1308112fdd33f24287535ed0a582c67c6e874ed5af81da0744f6a0a88
Result = Pass
k = 557f33353228982ff7290befb2a45d280bf6722fa4a59b6917fdedefd2ca6e106cf64f48f57605b1cefd9ea3859196eb73708bbc4d644f4b10029df332a07dc35f1a87e74a0a3f1e5284a0f5c2510f7f8c6027fe4f46a487257b776e776a3aff237dd1a3da7d559247d5466f2067be1d8cd5ccf6b57a24ef9c9b08f0029267238d15e9f0fbf71583551cf6185750a61ae853ca0b61f375c4dce03336f8d864947af79ae6170452d9a8369033f6eb1d385791ba233f10e72521df69e9b5e56bd280fdb17506742eac8d6b6bad7aa0c259f09b4d79029870b4f4b934270e9f6005387e4197ea29858010b8d2bb42d4443abe4a0a2d3e1ddb704960f7d02ff370c2
c^d = 557f33353228982ff7290befb2a45d280bf6722fa4a59b6917fdedefd2ca6e106cf64f48f57605b1cefd9ea3859196eb73708bbc4d644f4b10029df332a07dc35f1a87e74a0a3f1e5284a0f5c2510f7f8c6027fe4f46a487257b776e776a3aff237dd1a3da7d559247d5466f2067be1d8cd5ccf6b57a24ef9c9b08f0029267238d15e9f0fbf71583551cf6185750a61ae853ca0b61f375c4dce03336f8d864947af79ae6170452d9a8369033f6eb1d385791ba233f10e72521df69e9b5e56bd280fdb17506742eac8d6b6bad7aa0c259f09b4d79029870b4f4b934270e9f6005387e4197ea29858010b8d2bb42d4443abe4a0a2d3e1ddb704960f7d02ff370c2
k^e = a2e18f72760f49bf611eed99bb9343bd22266ece7abc13ec3395bd89cac7807893ebdd47b516e6cf760ba209b9aeb324c4bc36d447baebec9a2b962f4706a563c86712a892858b0852e4d14f76cc5e1deff94a3935946f288c62ccff873c2775cabff63c134480927c124013fad38ad12a4571a64d32e7c990a226a0924f4fd5205951ac433b0d947cfeb8fc4ead8067fd0872c3967c9bf62f536dbb702965ac529feb9f27537a36db0f00b279408808f0aa1637185bd2d8f0dd69f72ab0b121e9f78cbec9720ea220ace2de8376e9dc8c9325abdbb5d6975ba9e2fdc6ce7a5d6ccbfbb1308112fdd33f24287535ed0a582c67c6e874ed5af81da0744f6a0a88
COUNT = 11
n = bd36ab9135d9297c1822cd7d37e8431e2cd4a892fc86b347861fa433abeababa2cadccde47642f20350ecab36f4d352913780d55f53b32e5fe21e402dbe7b462495e682aa5ee3e438f498b09492b16beef675c8478f552f478c560e2e42d97806a9ef2aa56acbca322cc629c2529c9b6880b467f2d843c21f0f623c8ccd4475b9cfdf099f99f801a422e2fbeb336e5f569835833241850c66567355d5a74b389a0b7bd11b6cd3a8728e0f12e6323ccc030759fc972ee643294a0e424e224073d0e6a2299afdcebcd3a254726b30e276b2f89d508368aed69f6d1f83f16abeb7d26fb811516472b72162b4cb92a295cbde9293b6a39886b7f0676c55bbce0f557
e = ccf5f343691ea8eb086ea76475d1dfb31bd729cbbfe64c8d8b2e61778fc3a55aa7324ede2d5b774eb57815f4f5bc0d0bf5afa51a915c3c2b94d605aa4b5f3385b3cae6b3899e20cdea9e3b4a4930af885a0da38c144c364a5cd986e41e0554ee54c3f10c6378bac1ea56d3e623d584af5a2dd238869b27867853e2b66abf2bcc7641993c9a62046272cf41b5fdc2c46b194f5bdecfacab508fc6c50e5c28e13e36928e3a933499e23b11ee79b86b3f7d6cb19e0196a54de129bd32e09631beb95105984ee31d1a18d49570db93d4e191d5620dcdef8d6add5ce6438156dbe42d944460917d61927061c96aa9
d = 2c90fd4ec3ad3712753ebb5992c281a763ff43b6996eeb3db40106ae7097bdd084ee6f24a2b88f91fad58677bc81f582a8c717292bcc1be6bae0adc3d96041166516fda380c38fea99e8037130708f29659d3d2e59b7426a9cafae744df52f0c4ef8d43d56a0686e6710ffa27c45a635efa193cc5e2b0e5e39289e11e13b39983ea540d7303c0e31c85347fb85b5e34c8f56b7cff1068541be80ec7064e28de49bb7ef5e7ffd56d7e7eb94da36d9ad7a41627fa8a4a885108e6a071a2fa8a199df84c88e9851534cf33d1ea5f6340596a632ef30bffc5f79b0f95a1839559e1f4eb94047b7418f42fe3a7a4f7f9c0938b0ba29a36f2111aee1c4bf65c53c579d
c = 4348e86c66d89592ab1fb8801e4fcd8f432a9f344d68158190594fef39cbf15a3d2ebf4d8ff66b809641aa9fdeba8d4d0ebd0f691abceb90b9e1b0e31af4160ad28093791a312af13781844a39934171e85f90adfc10fd268caa8ba7c9f003a3ec858b766d517aee76266b0a97a49101bb5a4a865b2df64bf1fe09c4b0875f2d7286d0cef21e057e3b7a896660b323076ef4647f9fdc7c07d02352c13581d3b14ccb89080f6070a96ec306e6fc89a28ae976061d30e3376311628d26c2a50635629cdfad2ede6677f74a0a12d4eeb49314285aea760ad1669d03e27cbebca1c49c41fa44b6618df1be57bc734eaa0129d751856dda1bef195a4e7a49918e4b63
Result = Pass
k = adb28fde4591ed50602e106db780d562a113aa142779a6eff8ca99bfe1cac1f3b6197d5e92a2b20830d1657bcca8e7d3d1ef9bba9d6cb436aa83da429571b65502fdb56d00ce663b42785f31ed092642596f3f202800b8215466bf7919081c143a4b4e4b59a3efb9e622ad63032fa46ca1f7300aa676635b56b090382a0591b2bd70eeab588f33bd3aa68675203d333029a8be9db3f9d045da10ad195af249daa857f877534be907b0a4f78af17a418332ab750293f146600502739b9144573e572257234de024482b774e2e033c8460d64c7aea201ba9fcd0ea1925c834a086cdebbe8142c45e549fa85fc1660fb630c2ac4ee6b1e88b24d3203b3e70038b4c
c^d = adb28fde4591ed50602e106db780d562a113aa142779a6eff8ca99bfe1cac1f3b6197d5e92a2b20830d1657bcca8e7d3d1ef9bba9d6cb436aa83da429571b65502fdb56d00ce663b42785f31ed092642596f3f202800b8215466bf7919081c143a4b4e4b59a3efb9e622ad63032fa46ca1f7300aa676635b56b090382a0591b2bd70eeab588f33bd3aa68675203d333029a8be9db3f9d045da10ad195af249daa857f877534be907b0a4f78af17a418332ab750293f146600502739b9144573e572257234de024482b774e2e033c8460d64c7aea201ba9fcd0ea1925c834a086cdebbe8142c45e549fa85fc1660fb630c2ac4ee6b1e88b24d3203b3e70038b4c
k^e = 4348e86c66d89592ab1fb8801e4fcd8f432a9f344d68158190594fef39cbf15a3d2ebf4d8ff66b809641aa9fdeba8d4d0ebd0f691abceb90b9e1b0e31af4160ad28093791a312af13781844a39934171e85f90adfc10fd268caa8ba7c9f003a3ec858b766d517aee76266b0a97a49101bb5a4a865b2df64bf1fe09c4b0875f2d7286d0cef21e057e3b7a896660b323076ef4647f9fdc7c07d02352c13581d3b14ccb89080f6070a96ec306e6fc89a28ae976061d30e3376311628d26c2a50635629cdfad2ede6677f74a0a12d4eeb49314285aea760ad1669d03e27cbebca1c49c41fa44b6618df1be57bc734eaa0129d751856dda1bef195a4e7a49918e4b63
COUNT = 12
n = da1e6ca4f885c8f90aedca0ff72ecdd8782d2c78f4c7f4ba488fc23b701ec01ad0276e37037d84f8317052da21992ac321607289e93a2fc4c23508395af069e6af08d256e472e8e87ba19b6018cca36a916fd9175bcdc4089706f83a7240f757044bd125cadd0b3dc17152e30b63281fb9560d3f05de91dc444edb3fca14a28233ddfb086307c551c62ef2ce71b9cb9993747322a1c6d9d6372ffe4ff44b0b92be88173cc3291c2f9096bd69d141ecc59fa08085d8773f014760ab1dd8175190841d5baca2c72dcde8fa2c8a3a018ec905c53006c79fb0e4666057b125a0590aa919676adf832367e1d9546d2705f739d84f0413b4b7e32112e99ce0b2925ce5
e = ce7a575525e695a7237e2d7be2859c8a2c48c409fff6e6cab151703cbe7e303842191512ce9cdd7be1bab9c380a6f57c957a28d334dee98899c62e39b1981c21be40660095a33ec7d24b13455a0aff100e73984eb06e7343cdeac1e5c49b63ac9b2b9ea91c5b55e4a97c68be9f7a84f061c16fb3b66a411ca14de505c985d68ceb020d227c1ae36abf1851217fef4a753b10a075a5c884d2957f043046f90a760827aa895880c4a0fff00ab20a81afcdd1d5618f1aff2c1e55de13bc730d659afbbe444d8d61813915460b221a94b7284791aef1ddb103f89ea5966a3916f204d9b607e26ce448ea441a80e9
d = 1283e9e838c81b0c31a79adfea03e8dd648fc5212ba84bfc06dc92670892d7f012681fac2d2bd8e26d6441aa69aa3216e41dc705ec96d759a136f764d8900a849ac429ee6ba416a812f6ef8cfb7c6fbcb1c92acd81312b3e291c936a334f32b787f1b31b60587fca2af856794415a65ec4348a85d99a09d39a7c3a98960790166bda8fd3c5b6bf43918058de3eef4463d039e9c78cf1115e6b7b2a8bec6239bda506837a27d6664c5079fb6140daea2f411f94f74b77acab487d932540e2ca66f1574b09dae73c84a576425e7d3b9471795439715df6e52d333291ed1edbe6707b6b3efe223719d34592f9d99ecafc9d9f8252859538a03ef480e0d80331eff9
c = 56ee33692682a1ddcad436bb9a64c49d9abbfd77b6a1db724c8f3ff7eb67d8095b6346d9dd4b7f94b3ec7280e3c5eb473903b7938bb008da40271b7c13cb170b15f839e9f13a2e1974bdc04f4d05b54911dff4628298ea65106c2c9fa0415e388d9653c3ecb67513153168505f8cea4b2a38fe0f23c149b9c348bc8919337338ca23dd8c56261e2b9c2fb1ada1c352f48df41bc0f693ed7e61a2116106081fb4d4881f6fb5f4ef08139ee58b9b10b4ed41fd949e84779d5df3617450f0282a54b4ae61929387b15381684a15d6dcdadd4e39b1d054d323fd806f2d7e5efb5cbf717ceb1d77472bb3ef742870d9908a6dbd92b97eee10450810b38412d8e97d9e
Result = Pass
k = 77f8bc1c6b059b5ee2d1c1cca8fc87fc7ea425194fd0f6dbbf067dc6c2970bf62f76639b3b1b1e1d5897761b59b31096f48e70bb68734d9df7d5e1fc2a3ce5325de5edbc81a147fb69fabcdc91824bfc9c2251f720479c93f0eabf03cfb8eb41db20069265430eafe6362fc03f3c3d866267327c5683e41d805a2fdcfcee6dc727233a5b6c49acbdc186455a1d36b67d881d9efbf55b67ed4ce581fd72d3d5df42c8796bd449a4e766dcda43c78dd5fb600e5ba45936d1d384a4a62f04e5d92fe79b21d03aaa28d6d04d6f707a2bdf29e1e14243957337b235949bbe5db109d792e294611aae160164184b06bcd88f0d9c210068861b68dd3517d0535b0a5202
c^d = 77f8bc1c6b059b5ee2d1c1cca8fc87fc7ea425194fd0f6dbbf067dc6c2970bf62f76639b3b1b1e1d5897761b59b31096f48e70bb68734d9df7d5e1fc2a3ce5325de5edbc81a147fb69fabcdc91824bfc9c2251f720479c93f0eabf03cfb8eb41db20069265430eafe6362fc03f3c3d866267327c5683e41d805a2fdcfcee6dc727233a5b6c49acbdc186455a1d36b67d881d9efbf55b67ed4ce581fd72d3d5df42c8796bd449a4e766dcda43c78dd5fb600e5ba45936d1d384a4a62f04e5d92fe79b21d03aaa28d6d04d6f707a2bdf29e1e14243957337b235949bbe5db109d792e294611aae160164184b06bcd88f0d9c210068861b68dd3517d0535b0a5202
k^e = 56ee33692682a1ddcad436bb9a64c49d9abbfd77b6a1db724c8f3ff7eb67d8095b6346d9dd4b7f94b3ec7280e3c5eb473903b7938bb008da40271b7c13cb170b15f839e9f13a2e1974bdc04f4d05b54911dff4628298ea65106c2c9fa0415e388d9653c3ecb67513153168505f8cea4b2a38fe0f23c149b9c348bc8919337338ca23dd8c56261e2b9c2fb1ada1c352f48df41bc0f693ed7e61a2116106081fb4d4881f6fb5f4ef08139ee58b9b10b4ed41fd949e84779d5df3617450f0282a54b4ae61929387b15381684a15d6dcdadd4e39b1d054d323fd806f2d7e5efb5cbf717ceb1d77472bb3ef742870d9908a6dbd92b97eee10450810b38412d8e97d9e
COUNT = 13
n = 90cd69af72c6e77b5c6137f2cef9a39773b26cdb04e77b4a1a7621c23f60255c795ddfa893e1b810eb8cc591fffe9d6dbbe06599bcd4c2297bc73293ea074bf35781fe24684dba05805edf2b4ea3e293d6706436d8f867e3883f6d2b5381ac8c6d206e8f49bbcc052e06c5106af30e17400d81c8de72860f9b878f96ea12365e063b8f967d667447328681cc4a9a0323e8597300f24cb8cec6c6291fabf39c427e2698280d457813d28fea30323198ca78c9568669d78744ef4c87d105e75c64638b7b5de28b3e0d5083d4f92d84adcb31e1c4dd839fe2911f1bcb7e1da102428a78c3d8b5a3a2be1a9ea033955210fb0d0a0784a102255686e43c5c259241b9
e = 312b6b696713dd3088c8d7bf17418f4746d1ace4fdfc09945445842b65514a078301da08b116d7070de1437a0a08465dbab5d793764e46a95c0e86bf5eeb95f5cc9490b4cb74576f56f0ce45208640a3ae3f91773dee5cbc129d24f473b8b6d5be3d76e1e4bf5644d5ba710c239e7c1ae31f0ba646c8980eefa0c14c6101085b6a88d8d085eb83b05bb307fe5c0a193d263090b8e2acd86835d8d02291d22d1783d2703649317bd19b3eae27b24b26a4f41cd2bbe90d2eb53a740741c110f73121061f8f22c56a1fa3be5fc2351c749eac3b832d5003b707b52f3e0c074a24e055f0d592ded199835ee569cd
d = 23897fc0f1120aae3de40b7ee43fe58549578908e30b7c01a40743cfb5647a249b0b22171208c758b08a53229a3951b73a81f31de27337b0bd1a8237b714cdd30ceefd8fb89cc215c3799b1b8f5a16f7e8f8f6f4f885852f0e9995ef3447a512d3fbf5387546f0de7426774618d0251a099f4feb23545ff3cc41bef2ba9994342d79de6fe85057c09bef6d897fe29894472f5ac1f4aa43db8f78a2bead9bf4108cc2abd185d21e87e53705dafaff186abb2dacd0d7ea9dc7e16096fa0a5aab8568a7e1035934adfb32e07201c0a112f3129c3d8a154d59e80b2bd315a63c63fad8e9c472fd01af124d0b70cee313bc7468f70f36e0c030122828ccbfcca25841
c = 53ea8be7c838e167048ffa06a86090675dffba160b04be104cf22686201616dee2b2dcfb7a5bc9bed5a03fcc92ec0c92feaef68743b697b1dce26c6b4cfb286510da4eecd2cffe6cdf430f33db9b5f77b460679bd49d13ae9b89d0350c66e62ac6a90844365b29790cbf92c2eb35321e655e35d92681d80e6f2e7b6bc721f734ed68338a10c9f2ee425eef012b822c8dfaf187c9a12a8ed942189495e4f2058b6b60f647c7df00d26b664f78014af6ce5c5f85f4ae60de18fb90443bcda2b5382ad67a02c366fc2d6e20d9b0d65437e971f059e1b3ea70d282deb3e6e9f9b1421015e6436c258d0733d4b630136998e423ee28181a91eb0fbf4a081da0bea1b1
Result = Pass
k = 0ce3ff3ff8768e9a7c07ae8c61d0d0c8a1e5d5cf1bc4de0c51b1e2d40991d03266cb69d29146e354119730845fba05e8787952e4df9f337e48f124f49333a10e224ff7dcf17ec30c8a7f4f06671227e652a99aac9604194643d4822a8df52ef31609c013f221c56c1921300e23d283eb50f53f45af96b46d4df99fb12c0c1a3a9aecdb58740aad5f7fc901a1e8730984a58fbdaced538dd924c6eee94f86dddbbc54e45cd72211a6158ec982c10f7f49d0f0af7397fc53c54b0b98e41fed32e9635d8d07d823371c16c8ba1c0660e53d9948b84ad5c20b7679e916e4cc0c68e059a5171bc06ab278044f929019093e73531812e6dd3cdf3b96467144eea44c82
c^d = 0ce3ff3ff8768e9a7c07ae8c61d0d0c8a1e5d5cf1bc4de0c51b1e2d40991d03266cb69d29146e354119730845fba05e8787952e4df9f337e48f124f49333a10e224ff7dcf17ec30c8a7f4f06671227e652a99aac9604194643d4822a8df52ef31609c013f221c56c1921300e23d283eb50f53f45af96b46d4df99fb12c0c1a3a9aecdb58740aad5f7fc901a1e8730984a58fbdaced538dd924c6eee94f86dddbbc54e45cd72211a6158ec982c10f7f49d0f0af7397fc53c54b0b98e41fed32e9635d8d07d823371c16c8ba1c0660e53d9948b84ad5c20b7679e916e4cc0c68e059a5171bc06ab278044f929019093e73531812e6dd3cdf3b96467144eea44c82
k^e = 53ea8be7c838e167048ffa06a86090675dffba160b04be104cf22686201616dee2b2dcfb7a5bc9bed5a03fcc92ec0c92feaef68743b697b1dce26c6b4cfb286510da4eecd2cffe6cdf430f33db9b5f77b460679bd49d13ae9b89d0350c66e62ac6a90844365b29790cbf92c2eb35321e655e35d92681d80e6f2e7b6bc721f734ed68338a10c9f2ee425eef012b822c8dfaf187c9a12a8ed942189495e4f2058b6b60f647c7df00d26b664f78014af6ce5c5f85f4ae60de18fb90443bcda2b5382ad67a02c366fc2d6e20d9b0d65437e971f059e1b3ea70d282deb3e6e9f9b1421015e6436c258d0733d4b630136998e423ee28181a91eb0fbf4a081da0bea1b1
COUNT = 14
n = d61c70c1d95d144b07dfc8cb9bdafdc0bf47fe948fdc29365d3f129b53dc0b94129eb0f19030faac918e38b61521a944d84d9bda2111ba523cf7b5848e216bec4a149119c72aa24c5f0ae7c6597aea87dd1ff8c40ff168570602b4b8ad01e80d4f97820ac3ed979d898adebc348eb022ecc66f8b952f9e124e886b2035a91e54688d9a177e4183dcc3a9bf1349899cc8445a908f9fb4d6b698dc45f734bb43c3db07ff9e8d9342fc629ae0451bc41738eeb30fce79fc903b1006f58e2e22a8585f9c080f560deed22fe4894d388dffe07ef572b0345fb3fc07a241f73882e8f74eaa3e4557fcab444bb8808f016cc1b8273666d8c48490362027eab709806393
e = 4f1a10816ac1774f7032d1fead8293b85a4bffcfdc7238c1ad3cafc862c0f3b637ad578e10f4f46097ddb45022ab30786dd565d650290f9d85d0c38ee9ca5705b07d54dc4f9ac1534d437324b6bb5e3b9506b364ef6471a773b022bd9a0b5d0b02f1af786463b065a6c3b762da11ce3357fed0e0582bea5007e8872d225cb9475b7ac79c38edecd5dd38da0cf5f00a957d87468bd77bc54ea8786166297fe67302a182e934acbabe49121d1c0c0b811a1dd68b3ca9ddc401158b3bb5a639b92441b91c6e976424abbc94834a3f1c6659cf21c7f9681ed35e6e8294cd0cd171e45c3c531354183be66506c155
d = 08be6d66ca7bf007f4137309cff63cb84caf1c125b3912a1cc4b749444bf4e491454aa28cd578c7b4e2d54bcb9f1ebc65c67a67954ad75e823f1bd76d48db5c422a10ddef0d8eb0d56ca7f0c9f89904dd5abf9004b781575e5eddb97a9972d9547941c4e0623a1ad15e0ab92db71f78ae567c02619449667d2c60156bc9e00d2360747c3a3a660b0c78c9f85626e3b50cd7cbae7e6b875913876ea1fb55406de167b747ff8250e8ed4e0e2443d8da05c9a89f858ed10deffdf2b98515ba79c48077697253435ed18a9cebc5b36dd7c72fb6f8510a59b412e44bb8477c3e0439346b829887be238f61d278aa7b441f44c832ef39fd0dd1dbb1b37ba502a76c009
c = de6a71c63591b31f166ce57e57c9aec1f4030dba0426ee77eb54fcc7d068b7f952d8c6e776e08e34e4dd03d154f7bec64302512feaa6d78470becf1e5fff2af755daa2b2fca34edb3bf2736fae4a9e9f54f8efd1883eb8e833b147c53fe0ff0d4f36ae2dad221a9c8374dd604f0b73d491ad92a8c636b9299af50cc35a535fc4a8b5916272a41b00252ce8ad1d8168ee61e9e0bd8dd504d10f51c720969f72a3c81ff3593473788e87df3d5d02f6a2742b738117c365be68f98f20e5dd0e5f32173c7e19d9d55acf12588478e5b04cee59141ebe522c1274c075be1916e64ff9fed4d8aa4a13e9492e5e6407adf88ce452945fbb2073267fcbcc4ac429706981
Result = Fail
COUNT = 15
n = 91bf251bef75b328aead5a7152d01bceeea88e40de0336bfb75dc0e850889a6e22a63e457ccc255719d6087cfa2f16c88293c774e3bff44316a3fada996fe5a81a80134ecd1c3c8a9f914b7bc9c2e373fab41b35dfe1e74bbbfedf97b91f39aa8c5489dabdc8bb6e3a6fec63e0395160e0437a69f421032c1137dd807532fc0fc4a84a020dd00ea9527bbfec3c2821c277c8fc26095749814cdc0a661e5283648d1ef06e9b75a6bfbed01332c851a81d9cbc8ee9b7e47f5ec794b1831e302e9e52f5fbf607eb979349d9519b4936e27650509ea0bc0ef74e7fd7aec176f8341c9efcad43d55ebb7111e3548e0ddbc21c1afb3f36ad2d32101a468a8fa9a628f7
e = c326aeaa1013cf86d4526d1c5b7b78acd6cb0532deaf2679d518cbca03db7ade6d925cace25ab5fe18bcde6e5b0333e1a6dc0ad579565f54fd92b25c8438f5fff8c0db00bdf53595d0bf5be7f8afedba0e32395dc002f9bfd98d76093081a4f0fa09a22b402060ed0de71dc051fa1204165085f81a9c53f07b83134d208d0e49dc278b0558bd0b10882f2c9bdec304684f461f50edbbb96f72b2f5c5eca85db571cd1b7c493a3be536c23a2f3db981fe77346ad82e18af85d079788536be47192081d7184aed05e2580ca16582d23e9d00a70c420000ecb8a2e25e1b057a53d20fc6153c653d77c7035bebb7
d = 32eaeb4ffc89beb539a34c4bc5ff910f29c277beb4e5613897b941b63db990bf3226f9bf6e91a1e2be63908fe1eebdb73f9d31aef783bf51a67c3336d93448b3203da6bd2fa5676e5bf3425f9cce2e90b02b55942c46acf95307fb1669b5235faa2af59cc1df5e9cca704d623bb3fbdd1340c3d09c15bbf4e2d5d6efd876bcd9ba922c0651b3546c79e71d4d9f1f1a3593be6e58ce24aaed481bc7d664678db92d757d168b63c699db22f8e6216b41c472e9d6c386583a27421ce42c5ad42f6e1f4ace9613acbbe927a95e1598fd1188946fc4f8b27b1cb023c2b61a20fa2cd7819cfc6164c86584a5735e67af7321f412e7fec8565f6d6cfb85ca02e43f028f
c = ee4bd9ab7450472ec11ff32049b103e17710666fe6bdb0e3d44f253fd45e1366c29f666cfc507610cfd7238730a6247cad619c54a343eeb6b0bed34b6b61aac253ff0f18060eae16b44d591bd2aa591b136202e8946a8bb0560e1cc7f2d827a788b3fc36f950984756c9be6298844ac8915bc1b222f92cdaaf87273cd089351e4902564e3ddfdcab9e927ae6e8fe9e8a0f93003ab5ba7b3aa1731d326d3c7a2e7e3645e83a83214a74f2b42f2bdefd6a7553e809b67320db1518252f31bb9edf0f95f08d58030f2dc12f95c3caed116eabe3a1a68bedc3c2f4c068bd84cd4a39e56880c4ff294f5b6b92442c2bf37fa0998b52999ef00bf924b10d63ce392645
Result = Fail
COUNT = 16
n = 84da326b6c8aa5d02621803201750014b539bedb67002f56006c0c448cd5cc7881ad5c0ed95d3dc285fea85d30db72b89182352903a88caa2b3393d6a4cd9b9d8a543dfa60d14880dd4bb806ffe632d8b3fbccd78a4d5c5f10f12b0645f2dffa924c8cd8ac85bc92555721360513726d05ad984e1ee75c5473d1d3d30c247f3871785adc4b298e4731756f208470f0efde356fbd18a1240a49e670b91aad23f07b1f343f3e5d3d6f5ddd85870ca29aeb9060810de962df81392835ce7924e537e4e456e8118c8418203c5f2b2629fc2080bf233ad1fa376b4ef367d6ea6516409014ebf515ecbe9c7ae9fed7b026ded71108a307b20596010477754223165245
e = 963e85936ae0a94a8fe3e9be076490cb5acbd51c1665b605cad96dfac7b95171609f30c9588e4dc9041928da8f46f0e1074d106fc94521d8c52069130f81cabffd9e240ba50538b684d00d277223f96880ac966479cbbcd41164a8bbd0ca43702f384bfb17cff76b2ba6ad2740e752ab3c8968104197ea873a0a2f3e13b85a655007628cf78ec8e9ebe55c6212e77a9a818a223116dc4580e22b622d6cdf1548d9c0361de30c11312a620eccc4c7480a28dbffc9a824d85966c4b7e894887c7e5a4490e1025c9009f6e420d340620fd2f7d8fb912bcd42659e81deac115960bb79331aaa4fe2acc9edfb71f3
d = 1327930132316cc458e2e6a04a3da993d6e3e2c700045957752cfbc4145a8c5dffd1a635614ab362cb97c3559d762575a41bec36c3b4f6bff8e0dd3e85ddb2f883fcef768d18b5dd6cd97498e371a0829c8c80ed2cb4d1e7d113f1e3327e08aac8bf45411bd7c840d7d6174d079fe83863f4ae0c6eca48bb24f55a0e49ae8cb34b9aaa4f58549059049e748b30a553aa56d273623a3eb0d9fd3a98dbc8924dc507cfff9d93d87b9530db0b00a255fd9cdfdc540892ada7d97fff712bea05c203e25ceb66a170d33146310d92bb1f01b1833acf7fa73b4540578c377d3b5947bb40d1b0d3101e215c24451aa85db0f2f51a6e2e8c273c8f1801093f19ea141fcb
c = c02eb4df9968f68f64b157f0fa12155625b6fb72a9e385de852f45f676f085eabdf42e112272e980394183dce448966c19366672e57309bcb156cb76c598d0420a08fb8b14810f155f1914d9d99cfd11a139878f0f7a6452f47a995b235225bd30d4e3f4777cb17760a3d291e2f6916c4627276f2ee2dfc9d503784e9806cb83b6beaef4544a17cec44685a9063e9ba68f680eba4a92c249dd5930f72d9c0bbb24302335b2d589411169f4cc4e5c63e6056404196c7255f992e489fde9fc2d8d03910b5c99044ff8d176e8a0c03831552e83d1339a6ae0027e0c4b09d50e7922d9492e1411bfb01c8bd429cd67bb4d1b952e3cb2de62aa8c293a3dc2f7bb36a2
Result = Fail
COUNT = 17
n = b22c983e0ce92f309ec9f5f9c644d9342fe374d32c752f272d203b6e2612422e9dc8819874d5c38027439d909e21457b764f175fb932c6e824b5b4c57094bc2029c99cde54a562a8278b53b69958d0e47e335e60443f4c09d2808af908c1c4195bc5df9f330c41fecd80de9d4860856e401561e1dfa835a47097e77ba36bbaddce34c10de47ac63f952a32c737eb81beca7815e46a8929422443c3267c74502738884f7898e64fdbc5caad2151a2007c988fff663e0d69dc24692a58b60c3781afc943c35ddfc16dcda91b708e389a2bd292ec203e6473dac91f3b9b74dfd398d4798f60b573464e1b006674399a151ac4d48954298276adf517577e6a9101f7
e = e89eb0db23e82e32d6766962367988b3ed2641494150a73ee88aac4afd88abf7337f2cb9092bdc61b48cb3d2cd91337e3df978deec3973f76d5531bf4ef153169be108a0ac1abbb69e26abf7826bf3dfd535ca11003baca4a7357515b6375effbab4cd71bf408f69524f06c11944a9e48687306d6b53f2b3083d023dae602fa83a931242b3fef5d7e57e0805b08536b8b7b45dbebad44f9f8ad944a6c59a0fdf9605913741cbbb5c2e434ab99868cc32776de125c2115ea573b3655ff7c26157cd03a3525d4adca02823bdd31c1c0d4d03fc196746a8acda87ee1fded7e9e610fea4c841204266867c71fecd
d = 50d16a858841e5a22372e94bf737a3c701487c03174ca5b65f71494f7c0e130460e818c46311b7206db01c625343ca059f3a985adb64ee4518d3dff64f1b41091d8b682087bc9b5d7ff15575b6810e1faa1512e69e3b2014b2ff72017378bb13538948f25aec9fe2c68fca4ddf9645222534a22c9fa23bd863883f2ce89881bf14bc68ab9434fb53ecbdcf44afcdfeb6c0ff8f5b03e0cc9bc00f92e08eb083c22e42cda7236cac7e297a0dea642f7da7df6042c959bdef0329c22529299fbd834f66232a6cf4bacae83da2c56f6ec51719a2e3bb999d38907edd6b7ce5721c111fd83c0f5812266f6554e2ffd99b0dbe73e25cd6bb1d91073a06c2f4a9995f31
c = cd2e492e102a4c85328ff73063a20f3b955b3afad369fb38d475e392d0ab061d9277ad4fcf8c4a1cb62bb15fc8a2847cea13ef43b87696181de1cc51200706e001008f3285487d578e09e362ee9d48137d4e58b36a61da40ce54e2ca8763481d435158a0db64cb7de3b2f7027f9b42487797dc128e32aef710548dc4abc6b41c7ff2716178ea1ed8dcac530720a55a620073e327cfeff9870b6b350634383224de6c403d06e15daea28161397bc178ab3f6cd5bbd2a2a536e6204259cbc2aa7e88452ffc2a5270485cb8876038fa84695d091b964252994dcafb1c85186a0473a408a5658e443eee33da2f43ff5566e582d21b80c508bd13de852c52c23a2849
Result = Fail
COUNT = 18
n = b4784cd9b3ba0d7321414dcb1ada0e22bb9f64d98bba019b5cc28f4ae82af35636edb89b43d5ecd40a6ec87d6eb8b245477955e3ff44b838620033c2224328dc61a923045331f8708057920587abd8194ab7c248be45f1b4d216da870fd17da7a024e9bcab6fb2ee3680f2160df09ff3c619a098a88b8bba57ee57d231626e899121aaec1b11e606cbd59b7d6b982da291c91e401dc6377b49488370dcffbdea2841230d7cb878ef910763bb5369878e92c78ba155c4c48eeed803526217c3b6b8d4a3014d49da8dd2d6b02b7b353f9dbd8f1376d31e15568a3ffe8332a2443acab2b1011706fd1b43ca86048f0c1ea3a405730a903ff6479899da079c1c4699
e = 215c0da39fd2453152991719f331d018a51a3936a6af3cc4355d18360f684ab518e13e14105d2de7e5ab10561508ab4fc74d1dafb855636251ecac7d51a36b6a9f02e5c1641da0742a6ef7acaf54cef7167429de92a0cc44117d9b944aa597d6d2ed91e31431cda36ffb5532405b3f7d8b6f7624f6d4b8f9cb51a0ce13831fa507b34b129b41124501120c4de0452a78642ade434f622e2b35926ffb2cf99c7754a95e1741e7f24524e5be8e91553f4826cd4c82b6c3ad8f3b5048a19c401aa32cd355522eb6c53be3c8b83809dd4e83de1d14a94f3f3512a077356a040b99f3260074bbc866bdddd8762915
d = 09a5b7951aa459ba65f9696e67fcafc6aa61ff01fdf9a6bcc963d6b51bddf4c6404c347cd753613ebdccd1fc8063bc83535d907317311aea8620b7644f9f67bf3e886c98bf92b66c6a15ae5f466f61d3c1b55e0cbf202d3f26f3c814b4ba1d205204b83b4a320e1ee4e5dc360b7ce986b348f5ea0dcc7055e9086643cf00bcc1efc87d4842ff48da0b846649247f9a4ed71f751ec6b9d2929a7d2e8c3898d74ce266757937dbbb8fb2e72ea97faf67c82ec96facefceca0e795a7aff5f95b5a19c4340dfe87fdb9a7ce4048626fc163a4d2a829ed13bbcaf331e7dff96361bc5d005911a277f3293c2a2aeed94797180b5f071362a1ae2d06b59e4571f4ace7d
c = 7a82228a2da15b5d74c540f70e03a6a79bc756df53bb643af8ebbcbd0926fe5e39a78cc220f5e14b2f072452e9acfcb1502aa7859e25463236c37ba7da0e36e31e9accb71d674ace6a0808ec4a058173207f612b2812e04268004f92e48bf02312a20bf18dc03eef0d12154b97d8dbf4f10daf5a594ada7576e85f088f65d427fb0871f7d9c867b5016b72f93aebb23cad1db7989994dbd049c4d490436389f6c315255067476a282c5b497e9906af543af7a17050ba8b5dc7dbd5b3684eb898500e5087a105f250772cbf601ef3794382e39667e6829323d9778bf766ee08168c3e1921eec9a536ca24fe292f79b9116b29be07c3b59b2a68de1ee7a60b2277
Result = Pass
k = 277e3a514dd4b262be1955d546c0fd464488082fc0e1fe19c101e0b7203aa920807295eda6dded673d78fe17d417c25b49c765ed54f03203ea5a30463a9e8e60c469527d9faa1a6f0b30e9f687b59337ee5273d044a43d5813aca9545acd7af709f8faaf8ef6b89b403f44ca3217294301371c0f8356fe63071a28bea7cfc24b34a02b5bab7877b43c5ea31e3cedd656656fc2160a094802066ba980599ad61d50ce4c40d52c7c376769559c8033619403e56e7a63651cb54866d3b866f36ae236cf643030470cb0a39ba57cf70d4d481bdedb4f1b603a2acc6e1626de31dc3ef96f56ddc61672d53229a12482178d42b0da4e87e6b7a2ff995e84d93e221a8b
c^d = 277e3a514dd4b262be1955d546c0fd464488082fc0e1fe19c101e0b7203aa920807295eda6dded673d78fe17d417c25b49c765ed54f03203ea5a30463a9e8e60c469527d9faa1a6f0b30e9f687b59337ee5273d044a43d5813aca9545acd7af709f8faaf8ef6b89b403f44ca3217294301371c0f8356fe63071a28bea7cfc24b34a02b5bab7877b43c5ea31e3cedd656656fc2160a094802066ba980599ad61d50ce4c40d52c7c376769559c8033619403e56e7a63651cb54866d3b866f36ae236cf643030470cb0a39ba57cf70d4d481bdedb4f1b603a2acc6e1626de31dc3ef96f56ddc61672d53229a12482178d42b0da4e87e6b7a2ff995e84d93e221a8b
k^e = 7a82228a2da15b5d74c540f70e03a6a79bc756df53bb643af8ebbcbd0926fe5e39a78cc220f5e14b2f072452e9acfcb1502aa7859e25463236c37ba7da0e36e31e9accb71d674ace6a0808ec4a058173207f612b2812e04268004f92e48bf02312a20bf18dc03eef0d12154b97d8dbf4f10daf5a594ada7576e85f088f65d427fb0871f7d9c867b5016b72f93aebb23cad1db7989994dbd049c4d490436389f6c315255067476a282c5b497e9906af543af7a17050ba8b5dc7dbd5b3684eb898500e5087a105f250772cbf601ef3794382e39667e6829323d9778bf766ee08168c3e1921eec9a536ca24fe292f79b9116b29be07c3b59b2a68de1ee7a60b2277
COUNT = 19
n = cd929c5058128e7d913dfcc070018c1a6ecaaf0ee9b92e6cfd27c0fc2b1c959eaacb93654ba56cd710edb1838f335697dd8f956778fe47a7d0ed7a756582b9372773d398dbc3318691ecca8d97494cc42eee4b7ea7b263838a3ee9af6cb037321582d45aec54e9172738d59611cef8302912e9bfc43352f652b7e247d30dc955dd17df99d1bb2a1ae7c101e02d27226aa16a73ae65e0cd09881e605fca8c10d61c864ad0eeb59523af085fd2a823be836d9d3a4172f367341fa85fa6f8b59d1ff442b1a57aa4013f7603a6d769d0f097d20fa306fb55f77a18baf92443200d421d9de7d7c5fe4512a1f5f301580dd7bcec70dc9ecd415e8443028ca24531cb53
e = 612a4cce48bdbb2d4d21e73ca5a19218cd143969981af918c585f0066af5966c5e997f2b0ec71bf2525ced593ff0ac61966f90b3f7f5f951dcb39a566097c4152d23e70573b969a790a14cf75dc8c934a04e870f0bde69e8a7dd2c9b2607fde42795e040bc6b75919481f6dd6a6805ee77f9391555365de2ebc5331958998244c2b6c3a241e924d04fadd32d2700a2b5335bda394c8e25f8ef9915a450f27ddc214b3d5f6dc544355ea0bd2fdf3193cd514c8980b0539b9a0a4d1819d36cb1003ce1af3a19f9641c28f1f3b01d061b7d4f604abd397847cdca5327c102d01347e0a49ac0195a8d077b28af43
d = 4f5e18dcd237f640a6bd83652041931ff174dce4197a632cc98451cdfebb12d1eae82497e6fd4768792391931015914816e3f0c19df27a5f95a4f56deb6391e9230b4d61c6d03b123fc427e4860c87676cc937224cd25ebb4a23a7b9c095c72a473b9a30768e3648f75c92c181a1b15f85e3565d4800e4279c9219f67b32e78c5e4478d02dc812bc259bd35ee2cec06734ba860bb65af679b5bd6708a048ea0a177eb23832e88d804e754adc160db967806090810dd38bbd38880f6c119356b74a5d686dc19c378752d775853692b86e643ebc33799145b5adcadc2e7e98538a485d42c418b8a8f597e7469ddb4a14e2e66342517fb7282039efdcbca755b93b
c = 8713a82c0aa2f1aabe3761188207e103bab1299be97feb1383e84d4bfc5a9dad25374055b81eec74316b18f6e001b0623d470c027b7023456000fc61538b663cb7c0e98d77a7fc3ee2277816bacb4d9487c6741e3134255bcea249ddb9d13203e4b78a1d6fc789d279726bbf36ee2261413648353452571d77d81c0655b369c855230b4dc705fbf69d55d93a7cf19591139f7090ac52235500a95d2550b97354b10c5365a8e9bb73f6d6a8d0b55c10eba40ad377c0bdf0c9141ef482d16bb96fa17b4cad39fc2f112d00c1c609b8fa389d7e5b3198192542593dca650152a1e0cd76dd6da3c5c097ead80c679f8bbb40a504ef085df12c887710c51608f59471
Result = Pass
k = a4b9878cf5926f2a3004f2f5c3a896cbeaebe153c3b1badc84ca1650bdce2d24e9ce057853112031bf7ebee84928e8c2447da4579157b13d43f419661c58a820f0feccbd175dad3fc3268238cbe3d8bacfda4e4821efe585bd87cf923f155543f452e6f49ddf1ae261bf53122139f622c42cc7d67cb0b7f15e4297cf79441da4b64d8588939112145429bb0813ff992c0afd449b231fd58d8018adaed3858073a5e97354a73929c0b5e9a43e596fa010fdcf133210ae6124d999f9069bb6df30169b5780035ae209086226283f4ee27da19066ded8c4d096dc2f9801ce253a93ee39df7f67614a2eb5da24cf3a18aeffa1701b335294dd9d51d8562f8b6414b1
c^d = a4b9878cf5926f2a3004f2f5c3a896cbeaebe153c3b1badc84ca1650bdce2d24e9ce057853112031bf7ebee84928e8c2447da4579157b13d43f419661c58a820f0feccbd175dad3fc3268238cbe3d8bacfda4e4821efe585bd87cf923f155543f452e6f49ddf1ae261bf53122139f622c42cc7d67cb0b7f15e4297cf79441da4b64d8588939112145429bb0813ff992c0afd449b231fd58d8018adaed3858073a5e97354a73929c0b5e9a43e596fa010fdcf133210ae6124d999f9069bb6df30169b5780035ae209086226283f4ee27da19066ded8c4d096dc2f9801ce253a93ee39df7f67614a2eb5da24cf3a18aeffa1701b335294dd9d51d8562f8b6414b1
k^e = 8713a82c0aa2f1aabe3761188207e103bab1299be97feb1383e84d4bfc5a9dad25374055b81eec74316b18f6e001b0623d470c027b7023456000fc61538b663cb7c0e98d77a7fc3ee2277816bacb4d9487c6741e3134255bcea249ddb9d13203e4b78a1d6fc789d279726bbf36ee2261413648353452571d77d81c0655b369c855230b4dc705fbf69d55d93a7cf19591139f7090ac52235500a95d2550b97354b10c5365a8e9bb73f6d6a8d0b55c10eba40ad377c0bdf0c9141ef482d16bb96fa17b4cad39fc2f112d00c1c609b8fa389d7e5b3198192542593dca650152a1e0cd76dd6da3c5c097ead80c679f8bbb40a504ef085df12c887710c51608f59471
COUNT = 20
n = 95be1e384fdb82684c50748da0664d76f8d2d966b358fdde18c95bafccf4134804b5a6becf8e1230977ebe91e44a28cc86690668ec0091b7772c3b6c6f3b2db0c0dfb97eb4c785a0e35be3fadc7d7a0c422e59710f05792cb4a38b0cfce2be2ae4f14f3fcd4a3065b59922a3558137346c67517e07e283e8d9f1d64d9d98318a612f67f563cec2d627faf09fe130fed4e3522379ef242197b2e455091efa797128a170fd891ff7ab1940bfb1c8a64b1584653256343fcb9d96ee398d19be3913fe4deee15a464c5e2cb3cd14d5e787a86775ca4561c44023a4b745c4d0338204d9f2e9530f24e3ee00f98d6228b3db5eff753aeb0dc67707ebec5d932385a0a9
e = 9a6666d28d42123f56eea93a663241d69fc37ac5717eeb6e6b17b1dbe7abe135a43a13e5ffda00871ac27fbafb5a3f9c32315f89420146cc83c0ba6787aea261756d25f23ee7e4f8646795519b4e978d15970db185d0d9daf01b7e863353a288cc65e75c39561171a7afc596bd4af71c255e18d65e3de28c0e0c6338765a3e9387da5a2ffc442fc6758d783bec5e20aeb268e21f11e7a057954f45c1734492066d5d18ff3a14d5147092a94ea8fdf30d83ecd512012c98bbf1dabe2b05ae9b271c862bd0a68bdcf7bee91595758e77980ec0ef83d152f4ac56db6a90df51b450c06fa53fdbea925088045691
d = 03e0ada5fda6ff761468aee51ce46b762a5fc35f1c94a293641ce9241341078d3f9fb3767ae51ef6132c992e62892eddd4ecfc0791626687087b97a9b3489122d1f07ea65b3c10eee84240b75feed50a51b38078c323d00587ebf6bea42533d0f51a10f90961bc985d8825a62947dba3de520a4503b0f55453d1e0361e9a58d03f8069c20f20abf367fb883b5e504e412dfa0434683388cdac5a6a01d36946d6cff04a20353a8a0ae668e48622a7310726fc7b27d9438d3377317ea8c43e1afd1da2a8f55ca9fea7019622f08c3657a5bc257db34ab20bdfe746abf08838b765a854b226f9fc9e74e902efc34f7162e7292a2ef0e22385c7bd8a01258afeba89
c = 787b8dbaf52c3f91eb2120f0075ef026aecacf669c3d0075cbdaeca6969f6a081e3a3ddeed1ede4fd9d77d5f2b9a421e0121d81ff1b62c2cef8d723871566a95d113e168f2277a5926b0ae8f4f1712db45e6d83378d99963d73752fff062ac9c58ad803f4d6f9a169a56bd66bbfde8c542c0d88979cfce80498192e25aebb8837cb2224d461dc6eefc6eb1ceb6734c44bf58df093cbf53ed0e123cc8f91817b405c7cf79245a874916a393ae8aa1c7c08655f59b08d2b110ee94579b13125095bb9690ab314d638fae9a6aed7db0e0a15d602227272f6f53b0acec42f101eb9065c76ccbb31fe4288dfe3e75d8c8204f0d216f95df00151d1e0402a5db0c700c
Result = Pass
k = 6ae2bc20b74613348f6c1d26ef2b4c74d4d07b87e2e0a4acc71233715373b7b89402c8aed2a468b49ec5077e1b9251add0c8831960d23f37d289eb88e0fcf0fc7987c11b62662dc5e9f0a017c70af20c4d23ca2fdd1923f954cf6eb58126c00bfd33ddd759124d375ffc6bf2d7a45674847006020ed97b485a612ed9ce3960b4fd8a8344d81b539cca6e057c74c7daae333a91679667d75987d69817a8a23704096ac889d9ba09d69f559e8e2a0be4c9b7e4e9ffdf880712549a078e6d1d1a8e554a00e1c172ab475be4d098ef06c90ecdb0815d1c740c3649334118cc07fe2cbeb7919dd81c5ce5cfa9214d6599f466eec4657868b384a2bcf1d1106ecdec52
c^d = 6ae2bc20b74613348f6c1d26ef2b4c74d4d07b87e2e0a4acc71233715373b7b89402c8aed2a468b49ec5077e1b9251add0c8831960d23f37d289eb88e0fcf0fc7987c11b62662dc5e9f0a017c70af20c4d23ca2fdd1923f954cf6eb58126c00bfd33ddd759124d375ffc6bf2d7a45674847006020ed97b485a612ed9ce3960b4fd8a8344d81b539cca6e057c74c7daae333a91679667d75987d69817a8a23704096ac889d9ba09d69f559e8e2a0be4c9b7e4e9ffdf880712549a078e6d1d1a8e554a00e1c172ab475be4d098ef06c90ecdb0815d1c740c3649334118cc07fe2cbeb7919dd81c5ce5cfa9214d6599f466eec4657868b384a2bcf1d1106ecdec52
k^e = 787b8dbaf52c3f91eb2120f0075ef026aecacf669c3d0075cbdaeca6969f6a081e3a3ddeed1ede4fd9d77d5f2b9a421e0121d81ff1b62c2cef8d723871566a95d113e168f2277a5926b0ae8f4f1712db45e6d83378d99963d73752fff062ac9c58ad803f4d6f9a169a56bd66bbfde8c542c0d88979cfce80498192e25aebb8837cb2224d461dc6eefc6eb1ceb6734c44bf58df093cbf53ed0e123cc8f91817b405c7cf79245a874916a393ae8aa1c7c08655f59b08d2b110ee94579b13125095bb9690ab314d638fae9a6aed7db0e0a15d602227272f6f53b0acec42f101eb9065c76ccbb31fe4288dfe3e75d8c8204f0d216f95df00151d1e0402a5db0c700c
COUNT = 21
n = be362e3f54ebf8c54774192458555c0fcceb96cf00fecfc5954c48f92b7e8da2a3285f073a0d20195ccbc20e302121498b8a65ad691072af851b65198855bbdae4f8189f563093428fdfade02e2b0065d7bbe398221d295d4752e8209327b345b2649496f59bfdfc3e49658bebe7620b18c42f1625189b1b78a44c2d9c097b95cf99bdeab52df183d2551b74ef09f017e2c09222b007002d6068589cccbc5bb163b216fc68a193ab59668af853cbd4909e964153b01d471bb6f9b1f862e805ee0431a014784805f837bcfa64e0f15b5f94e1be978a9106aa7b27cb957421a3ea81106d3f3eca090a551a8ebe4d46c86c9bbca41967bde13b2c631e15b0849b5d
e = b63029a842edb3c93de8017b990099934edea7de5e99579f362d8d178f4ea2709aeb30c9a42f250b933aadc610c070751c7715e78c6253e0bc0ae25e2a801fc9a54b56ff90ce9d728dafde081016cedbdaf5405fd04a5163b4261fc576312e170067d25a33bbbffaa340ec3fa9c98451eebfd98bb2484d8731eb5183c0c6b1b1a302ca671eb661c6515fac8ba56526a97a9d73199dbb5b2ef55b5539a820a8243d625a719e4c7672dd97824ee28738463c390e34acf8ca6684ef4a64c01509a8658e75ac60b2453e18e13ef308c3a17b7c7cbcdc6ff93beea6bff2a4ca65e178985564feb41f4deccafca829
d = 20c0f944bb7df0d5f48488d1375b2e564a1582076a3807f8cfbc213e065ef8dc262ba8d31e472bcdf2f589c04b5b961b5aab4109d4a87fd9d9ee5f8458e99bd89de879b74c6cbd253a759beb33684cd1087539458ed3a78884d49fa004baa24888170dcfe55ccffec7884455f89555665cbc6bf258e6df35857cf24427cdc394a74cd9d414a67fa1db0075d3ea9748bd0542ba5dd05017ca968a4aa4d31dd98f342a3cb7dc56986575345a3f923a2f7c64c8957b7f5b2540a61f9f087d79808eb0d9157eccd7588e1c13524212b5a1815eb08af8609234a05ae2ac40b9a8b4a5ccbd29cc3a365f93ff4aa0f1bd6dc74524e8ff552925774c60f701fd61e7300d
c = fd4d234133e7dfac588deec09b8213820382ad260303e9744ebb3671ec62f93c8eb982361fcb3f659b73301b241e9bd253d2015bcc70503815365a46a887869f46efc6be8f62c9e4d0c471bb1caf87399e70aec82d5295a42120718465e5ab7ccef6d522ab32e3f09e8998e9aabb3e7f8c629ab54f331f811b8162744e02ce9ccdd699aa9dc5f650adc98dedf6cc286cc6b2af69599a5696aa61155e886859c8ec98f99d8aa36bcda68c380f2969adc8f468d32e7410a2ad77c9728a3e9fb2c6d343dc459d52a82f31da81976b1b355abe8af04ac81c6b8c29c0613f962d435e29df2ce8fb5c173ef5bc50cce36828ebca22ed067c4619fc694fcac6b89c725a
Result = Fail
COUNT = 22
n = b664d083d67aedeb833c19f3af27517236fce6946f8c71476a0fc70b36860049786bffe1697e22ca7884ff9de14168839650f3f1951bfcf05c38deb4b958b833e48b925a0b94d57929df2838c60d9efe42e18ad977f66584bcaab6f59508d3c4c4f399ccaee9ae4dd0c62bf95897f5ff636efbeb8e6c866cf94e818d572102c7cbbd779725f666c04171e1875058f41412bda1d683003e3ecdf4f93b35132c6f98424c3758b11ffc73b5927065affd8fcf52c0c64becc8af561e92f1409d08a803729393ec1d09a60d583f6cb5720770c8b3019f4d4ac7f9c47e01e121595c860f64ca67ee6e3ebe8e2a93629ea66e6886c68fd059617790a69fd842c40c19e3
e = 9845c3e40ed6ad8333b77a0e1e8ff690462d7c253621dcf7d701e898e8fd3202f17da41cf884346b81ceb1a860ed3f6df0c2a2890159233115f84959b500f51842509016f44e196ab4defcafe72e3c7a2e7a98283fc10855750e0deea2bd753c4bb7fead04b6fb77c715cb486f283c4ffef0c519bb4e151abbff7d06f3fcf31965d87e216a24317de1fff273620764dc13f55bdfddb49b2b9fce8dc214bd9f1abed688726df9befa83648fc00278f11f092179a4e3bb69e28f24ccc5ebc856172ed0ce5b49afa19125308e9989f9c0297f7a6695a9469f6ae3a4e6f365a78276dcba3bcde350b005325c7f33
d = 41587cac219102a82350c08aa77a8119f8f1c97f7ad4b00ed47e10916937bec16a8ab614fba6f6e161a481d6840ecc23abc933d090eed3526346b73a3e629381028dc448733e45794e5f5f4e4c35c17e848d8a0bec67719c5cacf35ead5df48302bf7c572e3382202749afef083a3b43297bbbbbecd3e63b69c812a04ec472798592d715904971c7db5b2580396ae1423f5bf191572daafb8e8d58dfce3a96a74f4519d47c59198af00f38ff0cfedd8c6b7eadba6433963af2b0b9975d77b74ccd4a549905aa335f6cd35f1418c1acaf04fee87d040e56b23881b67bc80c1fc66003554909d9731f41af5c7edb735b7632a2cffdeb7615ad8a66a77d761ed6d3
c = fcb7973359ea60ef1aff4fd59648805af7939b5e324e61693dee84347c91bc6b7ce117b1e33c91e5a713e4a37f90a10e977c80cd885ff45487e90365dc9055d6977b8b947e9fd2e84928b7f9121a3d9307382c266225ad129bc91421dbf6fd55b54b9ae511594b8268056fde372d7b6fad8f4971a7e6b22adf555e716009db713e1bedab83b3253a6c73b55bd613832cf3487cb441eb2b24bd578a5c541318b19ab12beebef58898be3a3177d7127e51402d6ff9177c41899c953feb9d5adb9e31d5fdb6a9679b25c4228a3a22739467fb04ca4711e01bdfe3d9262524274dbe6b510b0c2c518768e7f369ac9f7eecf58e9634a71761e3b1fce9e712d1c1959c
Result = Fail
COUNT = 23
n = ab7274933e9f2ae41740fe62bce2a1d54f6a86cd74cd21dd50236761911b06bb47073dfd210eb51dcab5ed1472389a598a65c8a915937aece2af26db13ee74401b1e2cf9627b9737caae78319b6b0b31b51771e9e21898c95a16fdc57e992136bfb1b80bb35e0c439db6aa114b0b122eb925c8fb78736f7ec0a0478c16d544e8f17f571150d26f173575a8bb0216c841cad877dd51e03d7734729dee4dc7bb696292785459d8a15bc796d714b095f97ab84535929f24a4e2375545230aaa8331ca8758b19d6a0b36e6efbedff5305385493e6087e4271d45dfc011ba9cf054482fc80e95897d787dc173f3b66778f93e9da7efddee6ceb2866f44661639bbea5
e = 85cab747fd4c7f7a7e81ca95f58d50699b9fceb8e74b97d10e54bb10a5b791166482cffbc41fda7551cbb799b3f3a252eb7af8778fa51de6b16b2284ec6505030f0bb7c245e105c9ec3e9ce5102f91360ca67104ecdbedf6cb56a8af53c89b1e314f1298fc408f5bb16effadb6be8dd20d2f15534f8d00a82d4ad8d9b79c26e0dd463da28ae9762015aefb8f1373f7795160d17cb3354655694a760f35e0c5b0f81fadc57127fb64148f5156959139b19068747d309c19e3c810c87ed94addff69425e515adb57b5b8496a7f5a401172ef343bb189c1d87ab9de710cc3240e9c34f85e7d82d81956008f2e3
d = 064c0bccf74da00201d8b9edcc21de5388696da9d311bbfb25a8725f72cb15e1c63a17efacc20eebe8ad06735a8c7c110e079a34acc3e74af862d5760cef74b0c9126debfb9b7379164f2356da6ef0d27d706d4a7d7761639ef4964d4fc1c29b57fbf0aec25894e5436a7049df5d4152f9ab456524a51bafc31018cd6c57ae43ea23d78fccdea771a2e8e1a37dae74c6e8b8b8666e6e4b48ad5ac3e81c4b3c58f27f95cea42676c3e7d8263c4cf172fd1659884d45f5490348978a6075417a88714f8445c83caa5c624dde9281fc43035c38b575dc84d8d6e705d31bbf812bd875e364ff2072d69b35267b1ec74a410c0e3c0cdd028cece2f0d3da662100a593
c = 78313a6d1ea2fe21488f33d08e04448dc94101356cbe969a186cb9e16a3e282918e8536e3ce755acefc129471a8e1baa89b77c2e41fe9a3e14bef0ba72749998827f0bd17124017b0bd5b93288b360bda851cbef02bb67ca98b773ebb04a6c22df7ec9606763e9d6c3544a5b7f7bfb0e4d98543d56fde486ceddab3ccbc7890d576ef7e1c3abf5043fc54388a8efd4e5a11280e3e5cdf9badcbb00776cf4d9a111d6fc1d30050d4fa8b00e82ab16d48acc49b7a758328eadead6db623ad74228363e40dc547719fd269d12112ff9e144f5c5625357358ba821b8a2c7de7bade8ed2e2be5d70c0157e015b7fcdc9ee45d440ce7ad89ddd8f3a8e8bf6cffe5032a
Result = Pass
k = 9cb07856dfc13ad20ea33a8ed357036e28b80ee0272f744d95885e205461f8704874e31e7783d4f05072c0f5b33449853884069d367a2b17eac3f4f327ef656bc416981b5b3cdfb07c66eb7928c8f8287bbceab539b5c842afdd977d7a5cc3aa551bb3f702a572c74bc4a90ab1008ddcfbdea06b3d9bfaf2e60a08cdf47e697daecb1f60fe48f1f301abc1aeb6a53c04e9da47457bc304d6a37b63fd1280408c3de6dcf12eb3c67641938a3ca57860f65c886e66a050f5b12ed6624332577ed887a46f7cca3ebe9abbac304481edc6c0b0bf2469eb053867d3a9fa1767b8c468ce16dce808baddcc392fa7fa340480dd78c67ad3c4ad95c9f085ecdec4a995e8
c^d = 9cb07856dfc13ad20ea33a8ed357036e28b80ee0272f744d95885e205461f8704874e31e7783d4f05072c0f5b33449853884069d367a2b17eac3f4f327ef656bc416981b5b3cdfb07c66eb7928c8f8287bbceab539b5c842afdd977d7a5cc3aa551bb3f702a572c74bc4a90ab1008ddcfbdea06b3d9bfaf2e60a08cdf47e697daecb1f60fe48f1f301abc1aeb6a53c04e9da47457bc304d6a37b63fd1280408c3de6dcf12eb3c67641938a3ca57860f65c886e66a050f5b12ed6624332577ed887a46f7cca3ebe9abbac304481edc6c0b0bf2469eb053867d3a9fa1767b8c468ce16dce808baddcc392fa7fa340480dd78c67ad3c4ad95c9f085ecdec4a995e8
k^e = 78313a6d1ea2fe21488f33d08e04448dc94101356cbe969a186cb9e16a3e282918e8536e3ce755acefc129471a8e1baa89b77c2e41fe9a3e14bef0ba72749998827f0bd17124017b0bd5b93288b360bda851cbef02bb67ca98b773ebb04a6c22df7ec9606763e9d6c3544a5b7f7bfb0e4d98543d56fde486ceddab3ccbc7890d576ef7e1c3abf5043fc54388a8efd4e5a11280e3e5cdf9badcbb00776cf4d9a111d6fc1d30050d4fa8b00e82ab16d48acc49b7a758328eadead6db623ad74228363e40dc547719fd269d12112ff9e144f5c5625357358ba821b8a2c7de7bade8ed2e2be5d70c0157e015b7fcdc9ee45d440ce7ad89ddd8f3a8e8bf6cffe5032a
COUNT = 24
n = e7bf89dd14eb3132f9098ce62ea46bed94a97d3bc7de936913d250bf6a3740915249ff91a5655eeaa301c799c807a27653cf3d8a2a4d3d85b9ac8d74dcf58c1e2ae8fabf52ce40866be0564cdc45430587f53def99e24e5da73f8d8ed3ff674b597e2eba42f5f2d7c2fa33ee5271737677d807cc0823f6f1bfa3fa4a497e299e8459aa64a62bf5122f9b8cdb40a0cc55a4fb06897db080bdbc56b1dbdaa531443a285189a047b8c60d63e11d5f3d502a9d0f2e655ee30607fa5fc8481ecacc709f2cb356c77d3d94b58ff0f3af8ef68b1c2a2b4f0ebfdfd229e609fcd672df3e18bd76e0c5209f503a52f5bea21b8a34a94901888dd7173e836710c1ff26f9c3
e = 8056940c538fa279070927c795acee2faa60ab159896bbf08916e62800f88238aeacc82e14c1610fd7e1bcc7f157509fe97771297cee0a198d4c31482f8ed3735ac66274a591f9a88b1ffeda31e21d18492f5514e9765b0e54cab62577aa18f9be8c135ac2c4a8b78fdd7874951901b5bd0fe6ed90e574e5a5c03aedf61f0b144703bea39ed743cb90c54b7d1792c2d88de5082bfa47b2720befb20c310d5188436182bdc8447f0ecf9a8c1bb3874694a548931dd5b08516384351fed49dd260f14939428966efa8ca34c4ecf5b0aaabd1b186c2e3417900406623e3f2f8155da59b5d478c821a2d82990ba3
d = 4f54cce4d1fe19eb7a5157515169c8e49bac53a2c7b5aa43c1571e8ac22ef215321feb037b4a19c79d008064a380b69870a14990869b42a56fc7e0904c4052f49157eaa7b251082d29905f0e3054f165a3f79b2518e85be81774d045fba5aa722a2651066a980cfd2da0d2e0a916d09b78785632bf17aa013d9a1cfa5fc243035c0b6049e37a47958342d9c9c886d6bbbff3b188a2a5e812cce482f30cc545d88d75f1be34d872697f3d88c11a4f38ac7d2f551b53364de6c4e28cd390a0fa28fb2dbb386b04c6ae77a97d2ea21f5a59e30fda7a32f672321923a3b31af81264e09923e380f93ef22b6d9e6da310fd2faa465557d51b4d44050bfc01468d29ab
c = e6beb0d81a1af53f804e5e3357f52dc0081e4211a0f134368296a0245e52c1fd5df341929e6f4f27e6c8f27693329df6d278035c129c2c62b9bec9c8153ec59995251cb039c1f07a4790dafe40607e1a12b3620f8f6800401e981936b0bf4de8f61ce939d25a00c30b6fbdd344c5f7b42f970631fe9fd5551aee3975181b8171e99f4f365080a687992d43fe89a9314d91ec98ca4687d62b1686d08d339a8abcd478f6ae9d7c0a505b921586f556536ca07abfe35168284978298787eb869051206d87a9a09655a5b865db737213869ac4092482068cf637a99f066a2725bab93647aa304115af0f18703ccde727f25e65606eb24d3a667e12b0f43ecfc1317b
Result = Pass
k = 2b0c4278cd9d89fc0cbaef5d8250fc6f4b7ea829a584aeefeebb0a3fef93fc01121a1c17a9996ab11243ee4ab5228cb092cb5f31813abb27df948a7853ade49d550e0d703b892d30c362cd50bc5b800d46cf3a9d74d1816a20b27692f3e46902a01d77a031a8e3824d740254c85fe54d31061fc448f4f9230d16c83cf1166150f386470228c19fead9a2b6506c9251971c06be189db123a0e436f8c8178f3b295217e85219cc9016964280c1e37756a740e84fe744d4bf541003892a8458d201b7ddb9932761e1706d9eae8ee7835368efd6ca512bd71e732487e137647f250f9682984984e596a85bf4e14fec3caf32f809c8b2b622ad064cdb59e0ac3864a2
c^d = 2b0c4278cd9d89fc0cbaef5d8250fc6f4b7ea829a584aeefeebb0a3fef93fc01121a1c17a9996ab11243ee4ab5228cb092cb5f31813abb27df948a7853ade49d550e0d703b892d30c362cd50bc5b800d46cf3a9d74d1816a20b27692f3e46902a01d77a031a8e3824d740254c85fe54d31061fc448f4f9230d16c83cf1166150f386470228c19fead9a2b6506c9251971c06be189db123a0e436f8c8178f3b295217e85219cc9016964280c1e37756a740e84fe744d4bf541003892a8458d201b7ddb9932761e1706d9eae8ee7835368efd6ca512bd71e732487e137647f250f9682984984e596a85bf4e14fec3caf32f809c8b2b622ad064cdb59e0ac3864a2
k^e = e6beb0d81a1af53f804e5e3357f52dc0081e4211a0f134368296a0245e52c1fd5df341929e6f4f27e6c8f27693329df6d278035c129c2c62b9bec9c8153ec59995251cb039c1f07a4790dafe40607e1a12b3620f8f6800401e981936b0bf4de8f61ce939d25a00c30b6fbdd344c5f7b42f970631fe9fd5551aee3975181b8171e99f4f365080a687992d43fe89a9314d91ec98ca4687d62b1686d08d339a8abcd478f6ae9d7c0a505b921586f556536ca07abfe35168284978298787eb869051206d87a9a09655a5b865db737213869ac4092482068cf637a99f066a2725bab93647aa304115af0f18703ccde727f25e65606eb24d3a667e12b0f43ecfc1317b
COUNT = 25
n = 86bb1ddc17af216ab1c963a34fb53918f01001b042e94534dfe2b4e1d55b1f11797261f297d2c8d40a3bd565253863e142af9ca30a25688e0796e263dbc9008e7b84bb581df4b7e91c105e39eff549f8d0ae6de8c70a1697e1522cff3271ac7d33db74ba8178c1d168b95599bc3a89e3538daf71f0d8a557d43bf6ffc5a6c6c42fca154f04dfb1b69cd3aac3c4d2af89ac5d2c9db0457b6e0439af27af6fb73a928d1604dd0fbb9dee7c880a6840870070754a12dab46aa6d2a201c5556505cbe318c74153589fcb4a5af181fff097cdf1790d8fc72261601c5e68833b1fedb7345e96c0bdeb4fd96506c94530a2cba2f496f816fac60261ea32706aab5a04c9
e = 83e41e7a7b626fb30238f3bc6d6e3c8968eb271e65bba444567e33159e1cf75e8112f7800783ce43bde24b729a31194e02e4035746abf9e7c57817a1978c4d95e07c22b31b353da0ba311c6cad70fc28352ba7ab1b2bc69f71b596643482a51756791d4fbfe0dd62537b23a3ebeb426768606f2e47be78c0f32e42825c176351dcf27b2fef93cd6eb00fb0791d91fead4c04a0996bbdba0470b38b18a81a2e75bbc39acb62a8337406c02663c1fa029ad13f838194bc88b56990e956e9d5098b3bb61111e4bc9f399afa1198ce584cf5bd9df4986de1ad3b0df8a92908e3e2d412b714d0382ee16cc924bbeb
d = 0a6520fe46e94757427ef2c8c02245f0123a1b763f043b1ac557ded75417bfefb4258c1626ed72605d6783806ea4586ffd279550a83cb3a7f8bb298cf5c0309d9b999de0451d73a6d1fa6d6b8b8d86317fd69821bdb30379acc12604cbd1f2b9213bfa9c7638d09e533a3d793c8f75401bcd0323a9074c2178cecd8dee862e63a6f036d8068e016077f76fca9a1ebfc91c1c297068c44c82bcdfafc48ebd23789b3bb8c8aa02be0368e1ad183a54bc73822e3446f849acf0a1b9c61f72f274645682cbd3895d87af29fd1a2aaac16d3e94c444f04923aedf52ec6b3dd0b6167eef8095c42915573ea49447199561be4f5dd30a3feecd30b537654c5c0dae79ff
c = 2e39b323294ac082bbc111a938b23d648b711ac1d6a580c7599e506595e9b5a9b121aa331c07bde874d512eba7d0aac9581de5f384d54672655c77d696ee8d6f797a8cc0d6b42e31c466e004cd060e8a4d8ea0971b88c5336b68ef92f31f1f474ded62b49d779bc5731984def37df011336d5395e4e58373356dc083f4a5f397f62233f6ba788d0c4998055f605dd8c5d16104d527150a9b8911f390e1a891c83dc0076e75e08c6e0e8b6b715ecd4e0ef113bd3e2c40e21130fc8fa0014f8243e870e70415d71e538999bffb33f5db54592a85ba3a8c913ff2d79c9d9dc34d6fbfd9d9a0e484cd23836b08e428fe06ffd24f65319a24a18b964a236efd2c7ab3
Result = Pass
k = 309b1b04d49f140444d165438332a0525635cecadc70825c979b2354981588b59852573210772794f28df61bf6cdb7ac874e68949659fa21e0dcc617c9699a49e934476d0e8ee67ad9de7ef061390dba6fd9e5409a6c50baabb794dd51cf373418565e18be660b6389019596cfae2630d299f4e7ac79595213014fc1ec121c1535e54284d716fc0f6e00bef8cd18b2dabaeab3298bb489e802145d324825e03e642cee5d7dd0ab5130e2bf4109d25f70b2c69be91738badb30c870336fc28df5d28d9618efffb2f5f49cbfc1c35fbbca00a47b12e6dc9230d943e9277bb1c96fb12fc86285e5f0ddb742a8b3c53009484f1f17e8d560de5462ef2c27181f8a9e
c^d = 309b1b04d49f140444d165438332a0525635cecadc70825c979b2354981588b59852573210772794f28df61bf6cdb7ac874e68949659fa21e0dcc617c9699a49e934476d0e8ee67ad9de7ef061390dba6fd9e5409a6c50baabb794dd51cf373418565e18be660b6389019596cfae2630d299f4e7ac79595213014fc1ec121c1535e54284d716fc0f6e00bef8cd18b2dabaeab3298bb489e802145d324825e03e642cee5d7dd0ab5130e2bf4109d25f70b2c69be91738badb30c870336fc28df5d28d9618efffb2f5f49cbfc1c35fbbca00a47b12e6dc9230d943e9277bb1c96fb12fc86285e5f0ddb742a8b3c53009484f1f17e8d560de5462ef2c27181f8a9e
k^e = 2e39b323294ac082bbc111a938b23d648b711ac1d6a580c7599e506595e9b5a9b121aa331c07bde874d512eba7d0aac9581de5f384d54672655c77d696ee8d6f797a8cc0d6b42e31c466e004cd060e8a4d8ea0971b88c5336b68ef92f31f1f474ded62b49d779bc5731984def37df011336d5395e4e58373356dc083f4a5f397f62233f6ba788d0c4998055f605dd8c5d16104d527150a9b8911f390e1a891c83dc0076e75e08c6e0e8b6b715ecd4e0ef113bd3e2c40e21130fc8fa0014f8243e870e70415d71e538999bffb33f5db54592a85ba3a8c913ff2d79c9d9dc34d6fbfd9d9a0e484cd23836b08e428fe06ffd24f65319a24a18b964a236efd2c7ab3
COUNT = 26
n = 9d27882f5756110a353125f496f0dd0dd96eec6abe26dd900d3a6e68e8c614f8d183901211e65f02520fed0348b2dcd1ede54021d4380165079451b4a45e65dad6c29007b4cd9df36a1e90c4103cd2ecc075eab2eaf58de5e627e4d6b15960498c674266816b7b50e86639c7e8f8676c5077225b49370a90abbc40ed3f3e68f95c74aa02f737f1e74da267945702c5c06b4856867d238d8119968e7c7f5fc9bfb4b83d78fa21c03be825bad7ad5b5c1c6bf5b3a5000b5cefcde0d4705f84967f3589e1623752e08d2c261cbdbe3129eb4f4eb5466c55756939fcbbaaf1799e86f9e314325d5c313ff84918b4473ab96dbc80a067241d1e5fa686731a7426dfcb
e = 9bd77929f91ca5229d1177d540494140d9d60ec8a3256434d8d6c612bc131709d5c10f1071a49a93ff5772e09f8c9eee8a8dce2d19a9dfbe8fc9915b02547e54e242d7dea02f626871e90b017130c6d5c9c5e9a2156a10accea981936ab65ff99f03f496191d44f61b2a0e063a00552b5756ff8da50aae48707ef6a061e144b7c7161e16f38e2011d562ebf23b602611168d79c7d1ff0b5e1765eacb5c3d90d71228e43716acff238f3e5a08c4bca6e436d33a4a96066b425c2756c113bfda287a1a5d2af9574f745d06990220d829b5cf72e0d7074539c30342c90515a60fb1e85b0c5d1cc970760c888d45
d = 2aa333f9c14ecb4a4aec82be8b9db293427c3e8ecf4fd60575ef34a7afa01fb08774eaad3239a43b3364a5cade59ae7f65a2e252b50a8ca4d38db14c7031fb2e0e9d1b54ae1c02b968626f738d8d295c07349ad8d3789e13e31d986928fb11534d5a5574f8bb36238a3a91e9a7a6e6479512bca4e6e502b8a7a6ccf2aa079e8b6ebb365b5b2c6de3ddfa2010d91cdc0c0a8e08daddade06d68cf0dff48d6c2dd833cc899fa0a7745288a6453a951a13578c9c62e458ed442ad0bcc3fefcadc5892d5213352f7579cc182b36e67f7ece74cf73dffe3279d7c113a1412442ed41593f7964c5bcb6d75e23ca0143db7cc043fe41b9bc2d9c7d4b4e4c8b289be250d
c = 8d049e80ba9ac7856995fac26f8b44a1e243213ac6c8410fe9bc8bf90cef6362433028b59f63011309d4da4871cba9fd2961f62e8b919adfe292c70b886448de4baa0a2415b7dc00cdeb73e17840b1b2a4202751067ad84362143fa6ab2394666c194cb466bedfb47a82cd76ca11e3281c29ba8a7fa882a230eafdb0be51ce646d25f44fd89f9298db40f1f0b067c7c75823bac03d46206315bb091309197f3f17770cdcb5837d12b7cee635726ae6f822b72cdd897a3af0d92f69b5d4a12e5f32b79b424391298bd5d3b42f5841c721408d1ac8ab6c59b044ef27806711632c868daa6bcbf21d6cfef864c4aa15f3ac7b4c8b69eb46040b1da34b5a0992a70e
Result = Pass
k = 67024c0694f751a67597e269d038603ef808218014c1a12046ef82a6b4bd63d5328bf15ac40ec197dfc63b8a9561aca78841573634303113305b6ea92e60a87d5400b0fafce42ae4ec41c935937856c80a39c65032914ffa682ddf233bd058e8b70a9bc509a490e56bf0de2c3697a53c826dcda6494ccc15de579f3e430ba926c345c466f38418f9e8bb61b43022cda1829378827b7181157c216e42f54ad32b0f5a952836131c089c22aa9eee4e6a9c88694be91735bb08a41563ea2254b5cb50453c4bffd22e7c86b5c0223d55e57d298964e5b4b18bf9a96ab0013f65c80e5aecd3186333a943c7abaedb856b51d22c2c4378f9921e0c7f3c3f937ab7de8b
c^d = 67024c0694f751a67597e269d038603ef808218014c1a12046ef82a6b4bd63d5328bf15ac40ec197dfc63b8a9561aca78841573634303113305b6ea92e60a87d5400b0fafce42ae4ec41c935937856c80a39c65032914ffa682ddf233bd058e8b70a9bc509a490e56bf0de2c3697a53c826dcda6494ccc15de579f3e430ba926c345c466f38418f9e8bb61b43022cda1829378827b7181157c216e42f54ad32b0f5a952836131c089c22aa9eee4e6a9c88694be91735bb08a41563ea2254b5cb50453c4bffd22e7c86b5c0223d55e57d298964e5b4b18bf9a96ab0013f65c80e5aecd3186333a943c7abaedb856b51d22c2c4378f9921e0c7f3c3f937ab7de8b
k^e = 8d049e80ba9ac7856995fac26f8b44a1e243213ac6c8410fe9bc8bf90cef6362433028b59f63011309d4da4871cba9fd2961f62e8b919adfe292c70b886448de4baa0a2415b7dc00cdeb73e17840b1b2a4202751067ad84362143fa6ab2394666c194cb466bedfb47a82cd76ca11e3281c29ba8a7fa882a230eafdb0be51ce646d25f44fd89f9298db40f1f0b067c7c75823bac03d46206315bb091309197f3f17770cdcb5837d12b7cee635726ae6f822b72cdd897a3af0d92f69b5d4a12e5f32b79b424391298bd5d3b42f5841c721408d1ac8ab6c59b044ef27806711632c868daa6bcbf21d6cfef864c4aa15f3ac7b4c8b69eb46040b1da34b5a0992a70e
COUNT = 27
n = b2db46421619b868b90e66b3378fbec47648f4e00b60ab6de51327bfe7960f72acb5598ff79046b4441a9e0145f2195a2372265827a28ae03bc5fa25707adbad06af93cbad705529dd8a4022c1b304e93711bc71ea56423ec5f4052b0483a396dec1e60cd372b01bc96bdfe4d72c676f821f5b8bf5f767df767b759d50382bd711050b09761ae1ca8ee70e70b3cabd545bbb7228ff8e1b2ca1358e21b1a48a63bd618d23093f0b48e2d7b8ecc69352e97fabec8d3422ef20ba48b3f3c940271a5043ae724453af99c4a71c5577cdf6e57fb0b3de1511bc77e64ebfbaa9f8f942a53a054896321a98d612172a340d71b5db74bbc7b37de5e88370313406f4fe93
e = 537f02211de320ca3636419da9d6c0aac945f351713f060f46bd40fd62e550c51e1ac8e7cd9e29b5ae8200eda88faa0a2ae624b1265078260a32b9f61ba704ceece1ba4ff0968db859b250aad0f88eb3099e2ffbb3950aeaa7c4d685443cdb6d485f521d6b73e5bf4275c0b437bbc2a109b78a978173556fd7946a198823f0d5661338107e4f483662ab61d11c498ee311c94f8620422c44c654d19b761dd6ef5b34124af53bce2e05337c30a5245ba426d8cb8d3a6563e863e6473fda5c8e96c062ac361aa16a86997f9c041a7432a90d8d0bdb4b6a250ab23dd57c29cecb0eb313d3b0cd6a6dccf84a88a5
d = 0f23f1402aa3826a9927837fb475d1dd26b8f9d99641d0463cc5f5e80d7f9a315ce2e0f716a5f4ae71fc2e83f49a01c9eb61580f3a43303aa6d0386daa3404b29739d4b0a5d5a7075529d7d9f0af0fa74e46ed0b31e1eeb10f45b5f439b7edb8afa83fb5da1e74d76699026eaf3ae20eacd55a2c34dc7eafb5f2467edd1ca60078104fdf187eef771c5704a967611bf22e50e0b0445b1a2ae5700eaa1948be4384c31488a10a7aac2bdf0a7ac2d84613d1f7dbe81f047052badcef2fd2b2313f587856df9f93bb3c80b034fb05ed7b21ab728edd143f5973b2231272f45506687af2580ee7597f0a26bdb5456aabc24b9aaac636c59c9cc7cded4e39466160f5
c = 670493e17ad34a8c4356697ec21d8af7048dd09ced91cec9348da428af946b83d1dad4d6716c0ba9cc1ee29ccec52b448da7653517309c606de78aa0cfa0028f3af28f9e30eb5865b7034637a44f69fa19f798354dea586b8bd000a87e411a59ab340b603fbaf7680becdf76cd210cc1b165b1c41727cc9197324d6842df7a882b889245273fb05bd0c0f382d0a5dc435cd9f709fe4fbe7b98f4ba09a6e2ebc5c3d66a756fe44de60f69cb833542a125223bb32d89caf7d196fe8fb32fb235b87a06dc179f1094b0cfceafa0855f22120b732e5741013f3a9a38148d67b72008580030543f2a4f6218d7e601476628b0206aadb0ac5a5d5eaa8a90c0d559745e
Result = Pass
k = 994a32d2b5f2eb05a6b4db325435e7e34364d9f7c96af27851a1bfc70950aaae1b450affd2e70d34d204edd262b11ec37cdd0a1c5b2ab249821c786e494ced89bee4499472f2574838cacbce728fd3a923f7e0ba10742900e998e0740ecb7c2b1c20de676865c1cc30196bde1f2eaf2fb5dfbfd44b33879bdaa657ad3edf72e287005bf07781e6f86ef2d3f3c67da2d5d8fb2749cf774286b95777cfbda17dd2fcce6588e12aea2d022904ba733f08485646f8936e12c0f4cd1e8f8e59c16251bd0f3ef3b6c3088b659c81f265d61493e3c9117d72e8ebb16fdd4a989723f8c062f9eeefc567aadc586d8cde78701aa50a0cc94dd8f33442593c1491da5f7b89
c^d = 994a32d2b5f2eb05a6b4db325435e7e34364d9f7c96af27851a1bfc70950aaae1b450affd2e70d34d204edd262b11ec37cdd0a1c5b2ab249821c786e494ced89bee4499472f2574838cacbce728fd3a923f7e0ba10742900e998e0740ecb7c2b1c20de676865c1cc30196bde1f2eaf2fb5dfbfd44b33879bdaa657ad3edf72e287005bf07781e6f86ef2d3f3c67da2d5d8fb2749cf774286b95777cfbda17dd2fcce6588e12aea2d022904ba733f08485646f8936e12c0f4cd1e8f8e59c16251bd0f3ef3b6c3088b659c81f265d61493e3c9117d72e8ebb16fdd4a989723f8c062f9eeefc567aadc586d8cde78701aa50a0cc94dd8f33442593c1491da5f7b89
k^e = 670493e17ad34a8c4356697ec21d8af7048dd09ced91cec9348da428af946b83d1dad4d6716c0ba9cc1ee29ccec52b448da7653517309c606de78aa0cfa0028f3af28f9e30eb5865b7034637a44f69fa19f798354dea586b8bd000a87e411a59ab340b603fbaf7680becdf76cd210cc1b165b1c41727cc9197324d6842df7a882b889245273fb05bd0c0f382d0a5dc435cd9f709fe4fbe7b98f4ba09a6e2ebc5c3d66a756fe44de60f69cb833542a125223bb32d89caf7d196fe8fb32fb235b87a06dc179f1094b0cfceafa0855f22120b732e5741013f3a9a38148d67b72008580030543f2a4f6218d7e601476628b0206aadb0ac5a5d5eaa8a90c0d559745e
COUNT = 28
n = a0c233fe035e540cb4c0f7740bc7f53054af18a75c33a5917c5c827f9500ae4f9588818e4d6cd7eabc6ec38d91bce2d5d908ff7e0223e7277a02dc2bf85d8da68d8e18644cc41702f8faeebf5e024c011455197647b27e92ab73eef7b319edae4241fb59b3278fe9e39253bdb482a0ca2f784303db592a578a5eceb27eacdfb20ee506c724d3fba6ffb7bbe4481e138d2b0d352077105259d22de6cdc196090f38b86163c01c47b59f3ed7aefc7697e471b0a44de4e7c2136681c10553f73fb171fe79b6f662d0ecd2ff0730eb3981c8c36a83b6e33d0de11c4b0eaec0aa3db0814d60576db2b71148b942f48a7df3b484b047fc1d8f5609e23c601981f0b667
e = dbf165bea8e32f1c635ec914617694954898efcf06fac3c87a8e194eb56e97b41d3efb895e20c043597c73ebc737c4ad236231bab07402b5e4a23b0e3ca4263ef10e4c2279861992b101bbe61989b37ec54dfb245063a9b55deddc166f8ece7f62bf572255ea5f4ed4d9339d27c604387f61692cc3696417a849084fdcad28ee5f4b5749411edfb01d7463ac7d427feeb86c309504d532f9a362244c2fa7ac0795dd68d90c07dd65e0905e361dc4f8ee54a29b6e571f7f4dd0ab6d2c63f3c9d0dd1efe43682ae912eea423d1f22dd076291f8d787af803287084fbcae2e2170b910370785b94117d28ef8bf7
d = 395ca50ff05a5394388af7a62080049ec1ce386ecd807fc785a974388ae7ee7bf58e53d8553e4a01a31494a5c8a18f5ecc976b743105c8ace73133ab98badfa7fed37812f447b9a11507bf700ba615b790bae70784a1849ef8f6d8f3c3c9a6ab6b180b15448635fd33fd837eaef64002d41a6432c5d79fc96db48389fed8324ddb553302e4b948e4a2a4fca8c4224ca03bf2e12fb07dee82c123714dadf8713dd4bad6dcc627770a2932dbccb4f55cf44a4f76d134858e01577f9b016b6bbd7a8225f603fb946c8b9af7a0a4f1268af929db07c103376e8b64966f059d35bf44c9272ef95b33635864844644ce0f4a0cb245e36764387c8b1b4b21aaee291f5f
c = c946e2c910b9f19ecc1669c8d4a6fe7f95f6985562d94b620cb0899eb3e9968edbc63d23c260c2dff2eb1739123b524301875f8a266ef23d0137c092065def66ac4bcb24c164bae7004672e3e5506901c0628dc909e33685f30959a34354fe5c635cf493b2cdc3001fb0e28df6ec2a00f90c8bdbb342fe8009acba9912d7abb72982203940a4c47077b0cf01ed177d8ad50ec088cd9331786caa4d3c1aeddec12543b7df11f0a4802fcea10571d94ae57cf19397ffdcb9b3438b7954049e7fc0802a214bcdb94d786f92c0622a3b795a153d6ed2f0277d7ab7d5a5a877f276fd61bcc6461d07a6a0618595e0c144f331c978b8ff497b6514f0123b011cf2abc0
Result = Fail
COUNT = 29
n = a0c233fe035e540cb4c0f7740bc7f53054af18a75c33a5917c5c827f9500ae4f9588818e4d6cd7eabc6ec38d91bce2d5d908ff7e0223e7277a02dc2bf85d8da68d8e18644cc41702f8faeebf5e024c011455197647b27e92ab73eef7b319edae4241fb59b3278fe9e39253bdb482a0ca2f784303db592a578a5eceb27eacdfb20ee506c724d3fba6ffb7bbe4481e138d2b0d352077105259d22de6cdc196090f38b86163c01c47b59f3ed7aefc7697e471b0a44de4e7c2136681c10553f73fb171fe79b6f662d0ecd2ff0730eb3981c8c36a83b6e33d0de11c4b0eaec0aa3db0814d60576db2b71148b942f48a7df3b484b047fc1d8f5609e23c601981f0b667
e = dbf165bea8e32f1c635ec914617694954898efcf06fac3c87a8e194eb56e97b41d3efb895e20c043597c73ebc737c4ad236231bab07402b5e4a23b0e3ca4263ef10e4c2279861992b101bbe61989b37ec54dfb245063a9b55deddc166f8ece7f62bf572255ea5f4ed4d9339d27c604387f61692cc3696417a849084fdcad28ee5f4b5749411edfb01d7463ac7d427feeb86c309504d532f9a362244c2fa7ac0795dd68d90c07dd65e0905e361dc4f8ee54a29b6e571f7f4dd0ab6d2c63f3c9d0dd1efe43682ae912eea423d1f22dd076291f8d787af803287084fbcae2e2170b910370785b94117d28ef8bf7
d = 395ca50ff05a5394388af7a62080049ec1ce386ecd807fc785a974388ae7ee7bf58e53d8553e4a01a31494a5c8a18f5ecc976b743105c8ace73133ab98badfa7fed37812f447b9a11507bf700ba615b790bae70784a1849ef8f6d8f3c3c9a6ab6b180b15448635fd33fd837eaef64002d41a6432c5d79fc96db48389fed8324ddb553302e4b948e4a2a4fca8c4224ca03bf2e12fb07dee82c123714dadf8713dd4bad6dcc627770a2932dbccb4f55cf44a4f76d134858e01577f9b016b6bbd7a8225f603fb946c8b9af7a0a4f1268af929db07c103376e8b64966f059d35bf44c9272ef95b33635864844644ce0f4a0cb245e36764387c8b1b4b21aaee291f5f
c = c946e2c910b9f19ecc1669c8d4a6fe7f95f6985562d94b620cb0899eb3e9968edbc63d23c260c2dff2eb1739123b524301875f8a266ef23d0137c092065def66ac4bcb24c164bae7004672e3e5506901c0628dc909e33685f30959a34354fe5c635cf493b2cdc3001fb0e28df6ec2a00f90c8bdbb342fe8009acba9912d7abb72982203940a4c47077b0cf01ed177d8ad50ec088cd9331786caa4d3c1aeddec12543b7df11f0a4802fcea10571d94ae57cf19397ffdcb9b3438b7954049e7fc0802a214bcdb94d786f92c0622a3b795a153d6ed2f0277d7ab7d5a5a877f276fd61bcc6461d07a6a0618595e0c144f331c978b8ff497b6514f0123b011cf2abc0
Result = Fail

File Metadata

Mime Type
text/x-diff
Expires
Sat, Feb 1, 9:28 AM (1 d, 13 h)
Storage Engine
local-disk
Storage Format
Raw Data
Storage Handle
40/9b/db0083a351f71a2e7cfe3f6f16c7

Event Timeline