Mercurial > dropbear

comparison testprof/pkcs_1_test.c @ 191:1c15b283127b libtomcrypt-orig

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