Mercurial > dropbear

comparison libtomcrypt/testprof/pkcs_1_test.c @ 391:00fcf5045160

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
propagate from branch 'au.asn.ucc.matt.ltc.dropbear' (head c1db4398d56c56c6d06ae1e20c1e0d04dbb598ed) to branch 'au.asn.ucc.matt.dropbear' (head d26d5eb2837f46b56a33fb0e7573aa0201abd4d5)
author Matt Johnston <matt@ucc.asn.au>
date Thu, 11 Jan 2007 04:29:08 +0000
parents 0cbe8f6dbf9e
children f849a5ca2efc
comparison
equal deleted inserted replaced
390:d8e44bef7917 391:00fcf5045160
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, err;
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 fprintf(stderr, "pkcs_1 tests require sha1/yarrow");
18 return 1;
19 }
20
21 srand(time(NULL));
22 /* do many tests */
23 for (x = 0; x < 100; x++) {
24 zeromem(buf, sizeof(buf));
25
26 /* make a dummy message (of random length) */
27 l3 = (rand() & 31) + 8;
28 for (y = 0; y < l3; y++) buf[0][y] = rand() & 255;
29
30 /* pick a random lparam len [0..16] */
31 lparamlen = abs(rand()) % 17;
32
33 /* pick a random saltlen 0..16 */
34 saltlen = abs(rand()) % 17;
35
36 /* PKCS #1 v2.0 supports modlens not multiple of 8 */
37 modlen = 800 + (abs(rand()) % 224);
38
39 /* encode it */
40 l1 = sizeof(buf[1]);
41 DO(pkcs_1_oaep_encode(buf[0], l3, lparam, lparamlen, modlen, &yarrow_prng, prng_idx, hash_idx, buf[1], &l1));
42
43 /* decode it */
44 l2 = sizeof(buf[2]);
45 DO(pkcs_1_oaep_decode(buf[1], l1, lparam, lparamlen, modlen, hash_idx, buf[2], &l2, &res1));
46
47 if (res1 != 1 || l2 != l3 || memcmp(buf[2], buf[0], l3) != 0) {
48 fprintf(stderr, "Outsize == %lu, should have been %lu, res1 = %d, lparamlen = %lu, msg contents follow.\n", l2, l3, res1, lparamlen);
49 fprintf(stderr, "ORIGINAL:\n");
50 for (x = 0; x < l3; x++) {
51 fprintf(stderr, "%02x ", buf[0][x]);
52 }
53 fprintf(stderr, "\nRESULT:\n");
54 for (x = 0; x < l2; x++) {
55 fprintf(stderr, "%02x ", buf[2][x]);
56 }
57 fprintf(stderr, "\n\n");
58 return 1;
59 }
60
61 /* test PSS */
62 l1 = sizeof(buf[1]);
63 DO(pkcs_1_pss_encode(buf[0], l3, saltlen, &yarrow_prng, prng_idx, hash_idx, modlen, buf[1], &l1));
64 DO(pkcs_1_pss_decode(buf[0], l3, buf[1], l1, saltlen, hash_idx, modlen, &res1));
65
66 buf[0][i1 = abs(rand()) % l3] ^= 1;
67 DO(pkcs_1_pss_decode(buf[0], l3, buf[1], l1, saltlen, hash_idx, modlen, &res2));
68
69 buf[0][i1] ^= 1;
70 buf[1][i2 = abs(rand()) % (l1 - 1)] ^= 1;
71 pkcs_1_pss_decode(buf[0], l3, buf[1], l1, saltlen, hash_idx, modlen, &res3);
72 if (!(res1 == 1 && res2 == 0 && res3 == 0)) {
73 fprintf(stderr, "PSS failed: %d, %d, %d, %lu, %lu\n", res1, res2, res3, l3, saltlen);
74 return 1;
75 }
76 }
77 return 0;
78 }
79
80 #else
81
82 int pkcs_1_test(void)
83 {
84 fprintf(stderr, "NOP");
85 return 0;
86 }
87
88 #endif
89
90
91 /* $Source: /cvs/libtom/libtomcrypt/testprof/pkcs_1_test.c,v $ */
92 /* $Revision: 1.7 $ */
93 /* $Date: 2006/11/30 03:30:45 $ */