aboutsummaryrefslogtreecommitdiff
path: root/utils/Makefile
blob: ce36d4c8a9fc5ec743201a41d68000070922cdd1 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
# Copyright (c) 2015-2016, NORDUnet A/S
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# - Redistributions of source code must retain the above copyright notice,
#   this list of conditions and the following disclaimer.
#
# - Redistributions in binary form must reproduce the above copyright
#   notice, this list of conditions and the following disclaimer in the
#   documentation and/or other materials provided with the distribution.
#
# - Neither the name of the NORDUnet nor the names of its contributors may
#   be used to endorse or promote products derived from this software
#   without specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
# IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
# TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
# PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
# HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
# TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
# PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
# LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
# NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

ifndef CRYPTECH_ROOT
  CRYPTECH_ROOT := $(abspath ../../..)
endif

LIBTFM_SRC	?= ${CRYPTECH_ROOT}/sw/thirdparty/libtfm
LIBTFM_BLD	?= ${LIBTFM_SRC}

LIBHAL_SRC	?= ${CRYPTECH_ROOT}/sw/libhal
LIBHAL_BLD	?= ${LIBHAL_SRC}

LIBS		= ${LIBHAL_BLD}/libhal.a ${LIBTFM_BLD}/libtfm.a

CFLAGS		?= -g3 -Wall -fPIC -std=c99 -I${LIBHAL_SRC} -I${LIBTFM_BLD}

BIN		= eim_peek_poke cores

all: $(if $(wildcard ${LIBHAL_BLD}/hal_io_eim.o),eim_peek_poke) $(if $(wildcard ${LIBHAL_BLD}/core.o),cores)

clean:
	rm -f *.o ${BIN}

${BIN}: %: %.o ${LIBS}
	${CC} ${CFLAGS} -o $@ $^ ${LDFLAGS}

%.o: %.c ${LIBHAL_SRC}/*.h
	${CC} ${CFLAGS} -c -o $@ $<
5:56:59 +0200 committer Rob Austein <sra@hactrn.net> 2015-05-27 15:56:59 +0200 First pass at RSA tests.' href='/sw/libhal/commit/tests/test-rsa.c?h=sha3_mode&id=2c81ecf429e266039a66d83742e22ea0eccfa327'>2c81ecf
4079050
5f152f5


30f8e4e
b3bbd3d

5f152f5
5f152f5

7a89eaa
12ed3ab
7a89eaa
7a89eaa
10dfb62








bbb6e1e

5f152f5
7a89eaa
5f152f5
b3bbd3d
7a89eaa




66c47cc
7a89eaa



5f152f5

8934e10
ab5a876


30f8e4e
b3bbd3d

ab5a876


bbb6e1e
3e679aa
12ed3ab
ab5a876
ab5a876

a615b13

bbb6e1e

ab5a876


bbb6e1e

66c47cc
ab5a876

bbb6e1e
ab5a876
bbb6e1e

3e679aa
bbb6e1e

3e679aa
bbb6e1e

ab5a876
bbb6e1e

ab5a876
bbb6e1e


ab5a876
bbb6e1e



8c427a7
ab5a876


b3bbd3d
ab5a876




bbb6e1e

ab5a876
bbb6e1e
8c427a7
ab5a876
bbb6e1e

ab5a876
66c47cc


b3bbd3d
bbb6e1e
66c47cc
bbb6e1e
66c47cc
bbb6e1e





8c427a7








bbb6e1e

















8c427a7

bbb6e1e











66c47cc
3e679aa

ab5a876
66c47cc
ab5a876


8934e10

















5f152f5


8934e10

5f152f5
8934e10

5f152f5


ab5a876


4079050

30f8e4e
4079050
8934e10

5f152f5
b3bbd3d
5f152f5

b3bbd3d
5f152f5

b3bbd3d
5f152f5
ab5a876
b3bbd3d
ab5a876
8934e10
4079050
2c81ecf


30f8e4e
97c3a85

b3bbd3d
2c81ecf
b3bbd3d

2c81ecf
2c81ecf
f210238
2c81ecf

9cca190

8934e10

b3bbd3d

2c81ecf



cf865e9





1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
  

             
                                                   

                       

                                   
  




                                                                           
  


                                                                         
  


                                                                           
  










                                                                           



                   
                   
                  
 

                     

                


                     
                       

   
                                        
                                               



                                                                           
 
                            
 
                                                                          
 
                                                              

                                                                         
 

                                         
 
           

 
  


                        
                                         

                                                  
 

                                                                          
                                     
                            
                           
 








                                                             

                                                                             
 
                            
 
                                                                                                 




                                                                                    
                         



                                    

 
  


                                         
                                     

                                              


                                                                          
                                                     
                                                                   
                                           
                           

          

                                            

                                                                                                                      


                     

                                                                                          
 

                       
                                                                     
 

                                                                                       
 

                                                                    
 

                                                         
 

                                                                     
 


                                                                                              
 



                                                                                                        
                                                                                         


                            
                                                                                                  




                                                                               

                                                                    
 
                                                
                                                         
 

                                                                     
 


                                                                                    
                                                                                                    
                                                                            
 
                   
 





                                                                 








                                                                     

















                                                                                             

                                                                                                    











                                                                                                    
 

                          
 
                                    


  

















                                                              


                                                 

                                                 
                                                 

                                                 


             


                                                                   

   
                                                                
 

             
                      
                                                                            

                                  
                                                                                  

                                
                                                        
 
                                                                                
                                                       
 
            
 


                                
                                                        

                                                
                                                         
 

                                                                            
 
    
                        

     

                          

                   

                                                            



               





                        
/*
 * test-rsa.c
 * ----------
 * Test harness for RSA using Cryptech ModExp core.
 *
 * Authors: Rob Austein
 * Copyright (c) 2015, NORDUnet A/S
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 * - Redistributions of source code must retain the above copyright notice,
 *   this list of conditions and the following disclaimer.
 *
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 *
 * - Neither the name of the NORDUnet nor the names of its contributors may
 *   be used to endorse or promote products derived from this software
 *   without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
 * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
 * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <errno.h>

#include <sys/time.h>

#include <hal.h>

#include "test-rsa.h"

/*
 * Run one modexp test.
 */

static int test_modexp(hal_core_t *core,
                       const char * const kind,
                       const rsa_tc_t * const tc,
                       const rsa_tc_bn_t * const msg, /* Input message */
                       const rsa_tc_bn_t * const exp, /* Exponent */
                       const rsa_tc_bn_t * const val) /* Expected result */
{
  uint8_t result[tc->n.len];

  printf("%s test for %lu-bit RSA key\n", kind, (unsigned long) tc->size);

  if (hal_modexp(core, msg->val, msg->len, exp->val, exp->len,
                 tc->n.val, tc->n.len, result, sizeof(result)) != HAL_OK)
    return printf("ModExp failed\n"), 0;

  if (memcmp(result, val->val, val->len))
    return printf("MISMATCH\n"), 0;

  return 1;
}

/*
 * Run one RSA CRT test.
 */

static int test_decrypt(hal_core_t *core,
                        const char * const kind,
                        const rsa_tc_t * const tc)
{
  printf("%s test for %lu-bit RSA key\n", kind, (unsigned long) tc->size);

  uint8_t keybuf[hal_rsa_key_t_size];
  hal_rsa_key_t *key = NULL;
  hal_error_t err = HAL_OK;

  if ((err = hal_rsa_key_load_private(&key,
                                      keybuf, sizeof(keybuf),
                                      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,
                                      tc->dP.val, tc->dP.len,
                                      tc->dQ.val, tc->dQ.len)) != HAL_OK)
    return printf("RSA CRT key load failed: %s\n", hal_error_string(err)), 0;

  uint8_t result[tc->n.len];

  if ((err = hal_rsa_decrypt(core, key, tc->m.val, tc->m.len, result, sizeof(result))) != HAL_OK)
    printf("RSA CRT failed: %s\n", hal_error_string(err));

  const int mismatch = (err == HAL_OK && memcmp(result, tc->s.val, tc->s.len) != 0);

  if (mismatch)
    printf("MISMATCH\n");

  hal_rsa_key_clear(key);

  return err == HAL_OK && !mismatch;
}

/*
 * Run one RSA key generation + CRT test.
 */

static int test_gen(hal_core_t *core,
                    const char * const kind,
                    const rsa_tc_t * const tc)
{
  printf("%s test for %lu-bit RSA key\n", kind, (unsigned long) tc->size);

  char fn[sizeof("test-rsa-private-key-xxxxxx.der")];
  uint8_t keybuf1[hal_rsa_key_t_size], keybuf2[hal_rsa_key_t_size];
  hal_rsa_key_t *key1 = NULL, *key2 = NULL;
  hal_error_t err = HAL_OK;
  FILE *f;

  const uint8_t f4[] = { 0x01, 0x00, 0x01 };

  if ((err = hal_rsa_key_gen(core, &key1, keybuf1, sizeof(keybuf1), bitsToBytes(tc->size), f4, sizeof(f4))) != HAL_OK)
    return printf("RSA key generation failed: %s\n", hal_error_string(err)), 0;

  size_t der_len = 0;

  if ((err = hal_rsa_private_key_to_der(key1, NULL, &der_len, 0)) != HAL_OK)
    return printf("Getting DER length of RSA key failed: %s\n", hal_error_string(err)), 0;

  uint8_t der[der_len];

  err = hal_rsa_private_key_to_der(key1, der, &der_len, sizeof(der));

  snprintf(fn, sizeof(fn), "test-rsa-private-key-%04lu.der", (unsigned long) tc->size);
  printf("Writing %s\n", fn);

  if ((f = fopen(fn, "wb")) == NULL)
    return printf("Couldn't open %s: %s\n", fn, strerror(errno)), 0;

  if (fwrite(der, der_len, 1, f) != 1)
    return printf("Length mismatch writing %s\n", fn), 0;

  if (fclose(f) == EOF)
    return printf("Couldn't close %s: %s\n", fn, strerror(errno)), 0;

  /* Deferred error from hal_rsa_private_key_to_der() */
  if (err != HAL_OK)
    return printf("Converting RSA private key to DER failed: %s\n", hal_error_string(err)), 0;

  if ((err = hal_rsa_private_key_from_der(&key2, keybuf2, sizeof(keybuf2), der, sizeof(der))) != HAL_OK)
    return printf("Converting RSA key back from DER failed: %s\n", hal_error_string(err)), 0;

  if (memcmp(keybuf1, keybuf2, hal_rsa_key_t_size) != 0)
    return printf("RSA private key mismatch after conversion to and back from DER\n"), 0;

  uint8_t result[tc->n.len];

  if ((err = hal_rsa_decrypt(core, key1, tc->m.val, tc->m.len, result, sizeof(result))) != HAL_OK)
    printf("RSA CRT failed: %s\n", hal_error_string(err));

  snprintf(fn, sizeof(fn), "test-rsa-sig-%04lu.der", (unsigned long) tc->size);
  printf("Writing %s\n", fn);

  if ((f = fopen(fn, "wb")) == NULL)
    return printf("Couldn't open %s: %s\n", fn, strerror(errno)), 0;

  if (fwrite(result, sizeof(result), 1, f) != 1)
    return printf("Length mismatch writing %s\n", fn), 0;

  if (fclose(f) == EOF)
    return printf("Couldn't close %s: %s\n", fn, strerror(errno)), 0;

  if (err != HAL_OK)            /* Deferred failure from hal_rsa_decrypt(), above */
    return 0;

  if ((err = hal_rsa_encrypt(core, key1, result, sizeof(result), result, sizeof(result))) != HAL_OK)
    printf("First RSA signature check failed: %s\n", hal_error_string(err));

  int mismatch = 0;

  if (err == HAL_OK && memcmp(result, tc->m.val, tc->m.len) != 0)
    mismatch = (printf("MISMATCH\n"), 1);

  hal_rsa_key_clear(key2);
  key2 = NULL;

  if ((f = fopen(fn, "rb")) == NULL)
    return printf("Couldn't open %s: %s\n", fn, strerror(errno)), 0;

  if (fread(result, sizeof(result), 1, f) != 1)
    return printf("Length mismatch reading %s\n", fn), 0;

  if (fclose(f) == EOF)
    return printf("Couldn't close %s: %s\n", fn, strerror(errno)), 0;

  err = hal_rsa_public_key_to_der(key1, der, &der_len, sizeof(der));

  snprintf(fn, sizeof(fn), "test-rsa-public-key-%04lu.der", (unsigned long) tc->size);
  printf("Writing %s\n", fn);

  if ((f = fopen(fn, "wb")) == NULL)
    return printf("Couldn't open %s: %s\n", fn, strerror(errno)), 0;

  if (fwrite(der, der_len, 1, f) != 1)
    return printf("Length mismatch writing %s\n", fn), 0;

  if (fclose(f) == EOF)
    return printf("Couldn't close %s: %s\n", fn, strerror(errno)), 0;

  /* Deferred error from hal_rsa_public_key_to_der() */
  if (err != HAL_OK)
    return printf("Converting RSA public key to DER failed: %s\n", hal_error_string(err)), 0;

  if ((err = hal_rsa_public_key_from_der(&key2, keybuf2, sizeof(keybuf2), der, der_len)) != HAL_OK)
    return printf("Converting RSA public key back from DER failed: %s\n", hal_error_string(err)), 0;

  /*
   * Can't directly compare private key with public key.  We could
   * extract and compare the public key components, not much point if
   * the public key passes the signature verification test below.
   */

  if ((err = hal_rsa_encrypt(core, key2, result, sizeof(result), result, sizeof(result))) != HAL_OK)
    return printf("Second RSA signature check failed: %s\n", hal_error_string(err)), 0;

  if (err == HAL_OK && memcmp(result, tc->m.val, tc->m.len) != 0)
    mismatch = (printf("MISMATCH\n"), 1);

  hal_rsa_key_clear(key1);
  hal_rsa_key_clear(key2);

  return err == HAL_OK && !mismatch;
}

/*
 * Time a test.
 */

static void _time_check(const struct timeval t0, const int ok)
{
  struct timeval t;
  gettimeofday(&t, NULL);
  t.tv_sec -= t0.tv_sec;
  t.tv_usec = t0.tv_usec;
  if (t.tv_usec < 0) {
    t.tv_usec += 1000000;
    t.tv_sec  -= 1;
  }
  printf("Elapsed time %lu.%06lu seconds, %s\n",
         (unsigned long) t.tv_sec,
         (unsigned long) t.tv_usec,
         ok ? "OK" : "FAILED");
}

#define time_check(_expr_)                      \
  do {                                          \
    struct timeval _t;                          \
    gettimeofday(&_t, NULL);                    \
    int _ok = (_expr_);                         \
    _time_check(_t, _ok);                       \
    ok &= _ok;                                  \
  } while (0)

/*
 * Test signature and exponentiation for one RSA keypair using
 * precompiled test vectors, then generate a key of the same length
 * and try generating a signature with that.
 */

static int test_rsa(hal_core_t *core, const rsa_tc_t * const tc)
{
  int ok = 1;

  /* RSA encryption */
  time_check(test_modexp(core, "Verification", tc, &tc->s, &tc->e, &tc->m));

  /* Brute force RSA decryption */
  time_check(test_modexp(core, "Signature (ModExp)", tc, &tc->m, &tc->d, &tc->s));

  /* RSA decyrption using CRT */
  time_check(test_decrypt(core, "Signature (CRT)", tc));

  /* Key generation and CRT -- not test vector, so writes key and sig to file */
  time_check(test_gen(core, "Generation and CRT", tc));

  return ok;
}

int main(int argc, char *argv[])
{
  hal_core_t *core = hal_core_find(MODEXPS6_NAME, NULL);
  if (core == NULL)
      core = hal_core_find(MODEXPA7_NAME, NULL);
  const hal_core_info_t *core_info = hal_core_info(core);

  if (core_info != NULL)
    printf("\"%8.8s\"  \"%4.4s\"\n\n", core_info->name, core_info->version);

  /*
   * Run the test cases.
   */

  hal_modexp_set_debug(1);

  /* Normal test */

  for (int i = 0; i < (sizeof(rsa_tc)/sizeof(*rsa_tc)); i++)
    if (!test_rsa(core, &rsa_tc[i]))
      return 1;

  return 0;
}

/*
 * Local variables:
 * indent-tabs-mode: nil
 * End:
 */