Mercurial > dropbear

comparison demos/test/pkcs_1_test.c @ 15:6362d3854bb4 libtomcrypt-orig

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
0.96 release of LibTomCrypt
author Matt Johnston <matt@ucc.asn.au>
date Tue, 15 Jun 2004 14:07:21 +0000
parents
children 5d99163f7e32
comparison
equal deleted inserted replaced
3:7faae8f46238 15:6362d3854bb4
1 #include "test.h"
2
3 int pkcs_1_test(void)
4 {
5 unsigned char buf[3][128];
6 int res1, res2, res3, prng_idx, hash_idx;
7 unsigned long x, y, l1, l2, l3, i1, i2, lparamlen, saltlen, modlen;
8 static const unsigned char lparam[] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16 };
9
10 /* get hash/prng */
11 hash_idx = find_hash("sha1");
12 prng_idx = find_prng("yarrow");
13
14 if (hash_idx == -1 || prng_idx == -1) {
15 printf("pkcs_1 tests require sha1/yarrow");
16 return 1;
17 }
18
19 /* do many tests */
20 for (x = 0; x < 10000; x++) {
21 zeromem(buf, sizeof(buf));
22
23 /* make a dummy message (of random length) */
24 l3 = (rand() & 31) + 8;
25 for (y = 0; y < l3; y++) buf[0][y] = rand() & 255;
26
27 /* random modulus len (v1.5 must be multiple of 8 though arbitrary sizes seem to work) */
28 modlen = 800 + 8 * (abs(rand()) % 28);
29
30 /* PKCS v1.5 testing (encryption) */
31 l1 = sizeof(buf[1]);
32 DO(pkcs_1_v15_es_encode(buf[0], l3, modlen, &test_yarrow, prng_idx, buf[1], &l1));
33 DO(pkcs_1_v15_es_decode(buf[1], l1, modlen, buf[2], l3, &res1));
34 if (res1 != 1 || memcmp(buf[0], buf[2], l3)) {
35 printf("pkcs v1.5 encrypt failed %d, %lu, %lu ", res1, l1, l3);
36 return 1;
37 }
38
39 /* PKCS v1.5 testing (signatures) */
40 l1 = sizeof(buf[1]);
41 DO(pkcs_1_v15_sa_encode(buf[0], l3, hash_idx, modlen, buf[1], &l1));
42 DO(pkcs_1_v15_sa_decode(buf[0], l3, buf[1], l1, hash_idx, modlen, &res1));
43 buf[0][i1 = abs(rand()) % l3] ^= 1;
44 DO(pkcs_1_v15_sa_decode(buf[0], l3, buf[1], l1, hash_idx, modlen, &res2));
45 buf[0][i1] ^= 1;
46 buf[1][i2 = abs(rand()) % l1] ^= 1;
47 DO(pkcs_1_v15_sa_decode(buf[0], l3, buf[1], l1, hash_idx, modlen, &res3));
48
49 if (!(res1 == 1 && res2 == 0 && res3 == 0)) {
50 printf("pkcs v1.5 sign failed %d %d %d ", res1, res2, res3);
51 return 1;
52 }
53
54 /* pick a random lparam len [0..16] */
55 lparamlen = abs(rand()) % 17;
56
57 /* pick a random saltlen 0..16 */
58 saltlen = abs(rand()) % 17;
59
60 /* PKCS #1 v2.0 supports modlens not multiple of 8 */
61 modlen = 800 + (abs(rand()) % 224);
62
63 /* encode it */
64 l1 = sizeof(buf[1]);
65 DO(pkcs_1_oaep_encode(buf[0], l3, lparam, lparamlen, modlen, &test_yarrow, prng_idx, hash_idx, buf[1], &l1));
66
67 /* decode it */
68 l2 = sizeof(buf[2]);
69 DO(pkcs_1_oaep_decode(buf[1], l1, lparam, lparamlen, modlen, hash_idx, buf[2], &l2, &res1));
70
71 if (res1 != 1 || l2 != l3 || memcmp(buf[2], buf[0], l3) != 0) {
72 printf("Outsize == %lu, should have been %lu, res1 = %d, lparamlen = %lu, msg contents follow.\n", l2, l3, res1, lparamlen);
73 printf("ORIGINAL:\n");
74 for (x = 0; x < l3; x++) {
75 printf("%02x ", buf[0][x]);
76 }
77 printf("\nRESULT:\n");
78 for (x = 0; x < l2; x++) {
79 printf("%02x ", buf[2][x]);
80 }
81 printf("\n\n");
82 return 1;
83 }
84
85 /* test PSS */
86 l1 = sizeof(buf[1]);
87 DO(pkcs_1_pss_encode(buf[0], l3, saltlen, &test_yarrow, prng_idx, hash_idx, modlen, buf[1], &l1));
88 DO(pkcs_1_pss_decode(buf[0], l3, buf[1], l1, saltlen, hash_idx, modlen, &res1));
89
90 buf[0][i1 = abs(rand()) % l3] ^= 1;
91 DO(pkcs_1_pss_decode(buf[0], l3, buf[1], l1, saltlen, hash_idx, modlen, &res2));
92
93 buf[0][i1] ^= 1;
94 buf[1][i2 = abs(rand()) % l1] ^= 1;
95 DO(pkcs_1_pss_decode(buf[0], l3, buf[1], l1, saltlen, hash_idx, modlen, &res3));
96
97 if (!(res1 == 1 && res2 == 0 && res3 == 0)) {
98 printf("PSS failed: %d, %d, %d, %lu, %lu\n", res1, res2, res3, l3, saltlen);
99 return 1;
100 }
101 }
102 return 0;
103 }