From: Nikos Mavrogiannopoulos <nmav@gnutls.org>
Date: Sat, 5 Nov 2011 08:29:36 +0000 (+0100)
Subject: re-removed file
X-Git-Tag: gnutls_3_0_6~6
X-Git-Url: http://git.ipfire.org/gitweb.cgi?a=commitdiff_plain;h=a28ad8fc63fd4d0b5b51e1cbb910450177bf3d85;p=thirdparty%2Fgnutls.git

re-removed file
---

diff --git a/lib/nettle/ecc_test.c b/lib/nettle/ecc_test.c
deleted file mode 100644
index 30250faf3a..0000000000
--- a/lib/nettle/ecc_test.c
+++ /dev/null
@@ -1,142 +0,0 @@
-/* LibTomCrypt, modular cryptographic library -- Tom St Denis
- *
- * LibTomCrypt is a library that provides various cryptographic
- * algorithms in a highly modular and flexible manner.
- *
- * The library is free for all purposes without any express
- * guarantee it works.
- *
- * Tom St Denis, tomstdenis@gmail.com, http://libtom.org
- */
-
-/* Implements ECC over Z/pZ for curve y^2 = x^3 + ax + b
- *
- * All curves taken from NIST recommendation paper of July 1999
- * Available at http://csrc.nist.gov/cryptval/dss.htm
- */
-#include "ecc.h"
-#include "gnettle.h"
-#include <gnutls_int.h>
-#include <algorithms.h>
-
-/**
-  @file ecc_test.c
-  ECC Crypto, Tom St Denis
-*/
-
-/**
-  Perform on the ECC system
-  @return 0 if successful
-*/
-int
-ecc_test (void)
-{
-  mpz_t modulus, order, A;
-  ecc_point *G, *GG;
-  int i, err;
-
-  if ((err = mp_init_multi (&modulus, &A, &order, NULL)) != 0)
-    {
-      return err;
-    }
-
-  G = ecc_new_point ();
-  GG = ecc_new_point ();
-  if (G == NULL || GG == NULL)
-    {
-      mp_clear_multi (&modulus, &order, NULL);
-      ecc_del_point (G);
-      ecc_del_point (GG);
-      return -1;
-    }
-
-  for (i = 1; i <= 3; i++)
-    {
-      const gnutls_ecc_curve_entry_st *st = _gnutls_ecc_curve_get_params (i);
-
-      printf ("Testing %s (%d)\n", gnutls_ecc_curve_get_name (i), i);
-
-      if (mpz_set_str (A, (char *) st->A, 16) != 0)
-        {
-          fprintf (stderr, "XXX %d\n", __LINE__);
-          err = -1;
-          goto done;
-        }
-
-      if (mpz_set_str (modulus, (char *) st->prime, 16) != 0)
-        {
-          fprintf (stderr, "XXX %d\n", __LINE__);
-          err = -1;
-          goto done;
-        }
-
-      if (mpz_set_str (order, (char *) st->order, 16) != 0)
-        {
-          fprintf (stderr, "XXX %d\n", __LINE__);
-          err = -1;
-          goto done;
-        }
-
-      /* is prime actually prime? */
-      if ((err = mpz_probab_prime_p (modulus, PRIME_CHECK_PARAM)) <= 0)
-        {
-          fprintf (stderr, "XXX %d\n", __LINE__);
-          err = -1;
-          goto done;
-        }
-
-      if ((err = mpz_probab_prime_p (order, PRIME_CHECK_PARAM)) <= 0)
-        {
-          fprintf (stderr, "XXX %d\n", __LINE__);
-          err = -1;
-          goto done;
-        }
-
-      if (mpz_set_str (G->x, (char *) st->Gx, 16) != 0)
-        {
-          fprintf (stderr, "XXX %d\n", __LINE__);
-          err = -1;
-          goto done;
-        }
-
-      if (mpz_set_str (G->y, (char *) st->Gy, 16) != 0)
-        {
-          fprintf (stderr, "XXX %d\n", __LINE__);
-          err = -1;
-          goto done;
-        }
-      mpz_set_ui (G->z, 1);
-
-      /* then we should have G == (order + 1)G */
-      mpz_add_ui (order, order, 1);
-      if ((err = ecc_mulmod (order, G, GG, A, modulus, 1)) != 0)
-        {
-          goto done;
-        }
-
-      if (mpz_cmp (G->y, GG->y) != 0)
-        {
-          fprintf (stderr, "XXX %d\n", __LINE__);
-          err = -1;
-          goto done;
-        }
-
-      if (mpz_cmp (G->x, GG->x) != 0)
-        {
-          fprintf (stderr, "XXX %d\n", __LINE__);
-          err = -1;
-          goto done;
-        }
-
-    }
-  err = 0;
-done:
-  ecc_del_point (GG);
-  ecc_del_point (G);
-  mp_clear_multi (&order, &modulus, &A, NULL);
-  return err;
-}
-
-/* $Source: /cvs/libtom/libtomcrypt/src/pk/ecc/ecc_test.c,v $ */
-/* $Revision: 1.12 $ */
-/* $Date: 2007/05/12 14:32:35 $ */