From 5f152f558e7bc8fc8d93ae250bdc61cd60ab5acd Mon Sep 17 00:00:00 2001
From: Rob Austein <sra@hactrn.net>
Date: Thu, 11 Jun 2015 10:53:26 -0400
Subject: First cut at RSA decryption/signature using the Chinese Remainder
 Theorem.  Not yet tested, and given the number of moving parts I would be
 astonished if this version actually worked, but it does compile. Added some
 timing code to tests/test-rsa.c so we can see whether this is doing anything
 useful once it does work.

---
 tests/Makefile.in |  7 ++++++
 tests/test-rsa.c  | 66 +++++++++++++++++++++++++++++++++++++++++++++++++++++--
 2 files changed, 71 insertions(+), 2 deletions(-)

(limited to 'tests')

diff --git a/tests/Makefile.in b/tests/Makefile.in
index 757624a..46a3aba 100644
--- a/tests/Makefile.in
+++ b/tests/Makefile.in
@@ -34,6 +34,13 @@ BIN		= test-aes-key-wrap test-hash test-pbkdf2 test-rsa
 CC		= @CC@
 CFLAGS		= @CFLAGS@ -I..
 LDFLAGS		= @LDFLAGS@ ${LIB}
+TFMDIR		= @TFMDIR@
+
+prefix		= @prefix@
+exec_prefix	= @exec_prefix@
+includedir	= @includedir@
+libdir		= @libdir@
+abs_top_builddir= @abs_top_builddir@
 
 all: ${BIN}
 
diff --git a/tests/test-rsa.c b/tests/test-rsa.c
index 150c6eb..51e1009 100644
--- a/tests/test-rsa.c
+++ b/tests/test-rsa.c
@@ -44,6 +44,8 @@
 #include <string.h>
 #include <assert.h>
 
+#include <sys/time.h>
+
 #include "cryptech.h"
 #include "test-rsa.h"
 
@@ -76,14 +78,74 @@ static int test_modexp(const char * const kind,
   return 1;
 }
 
+/*
+ * Run one RSA CRT test.
+ */
+
+static int test_crt(const char * const kind, const rsa_tc_t * const tc)
+{
+  uint8_t result[tc->n.len];
+
+  printf("%s test for %lu-bit RSA key\n", kind, (unsigned long) tc->size);
+
+  if (hal_rsa_crt(tc->m.val, tc->m.len,
+                  tc->n.val, tc->n.len,
+                  tc->e.val, tc->e.len,
+                  tc->d.val, tc->d.len,
+                  tc->p.val, tc->p.len,
+                  tc->q.val, tc->q.len,
+                  tc->u.val, tc->u.len,
+                  result, sizeof(result)) != HAL_OK) {
+    printf("RSA CRT failed\n");
+    return 0;
+  }
+
+  if (memcmp(result, tc->s.val, tc->s.len)) {
+    printf("MISMATCH\n");
+    return 0;
+  }
+
+  printf("OK\n");
+  return 1;
+}
+
+
+#define time_check(_expr_)                      \
+  do {                                          \
+    struct timeval _t1, _t2, _td;               \
+    gettimeofday(&_t1, NULL);                   \
+    int _ok = (_expr_);                         \
+    gettimeofday(&_t2, NULL);                   \
+    _td.tv_sec = _t2.tv_sec - _t1.tv_sec;       \
+    _td.tv_usec = _t2.tv_usec - _t1.tv_usec;    \
+    if (_td.tv_usec < 0) {                      \
+      _td.tv_usec += 1000000;                   \
+      _td.tv_sec  -= 1;                         \
+    }                                           \
+    printf("%lu.%06lu %s\n",                    \
+           (unsigned long) _td.tv_sec,          \
+           (unsigned long) _td.tv_usec,         \
+           _ok ? "OK" : "FAILED");              \
+    if (!_ok)                                   \
+      return 0;                                 \
+  } while (0)
+
 /*
  * Test signature and exponentiation for one RSA keypair.
  */
 
 static int test_rsa(const rsa_tc_t * const tc)
 {
-  return (test_modexp("Signature",    tc, &tc->m, &tc->d, &tc->s) && /* RSA decryption */
-          test_modexp("Verification", tc, &tc->s, &tc->e, &tc->m));  /* RSA encryption */
+  /* RSA encryption */
+  time_check(test_modexp("Verification", tc, &tc->s, &tc->e, &tc->m));
+
+  /* Brute force RSA decryption */
+  time_check(test_modexp("Signature (ModExp)", tc, &tc->m, &tc->d, &tc->s));
+
+  /* RSA decyrption using CRT */
+  time_check(test_crt("Signature (CRT)", tc));
+
+  return 1;
 }
 
 int main(int argc, char *argv[])
-- 
cgit v1.2.3