| 1 |
/* |
| 2 |
* Copyright (c) 2006 Kungliga Tekniska Högskolan |
| 3 |
* (Royal Institute of Technology, Stockholm, Sweden). |
| 4 |
* All rights reserved. |
| 5 |
* |
| 6 |
* Redistribution and use in source and binary forms, with or without |
| 7 |
* modification, are permitted provided that the following conditions |
| 8 |
* are met: |
| 9 |
* |
| 10 |
* 1. Redistributions of source code must retain the above copyright |
| 11 |
* notice, this list of conditions and the following disclaimer. |
| 12 |
* |
| 13 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 14 |
* notice, this list of conditions and the following disclaimer in the |
| 15 |
* documentation and/or other materials provided with the distribution. |
| 16 |
* |
| 17 |
* 3. Neither the name of the Institute nor the names of its contributors |
| 18 |
* may be used to endorse or promote products derived from this software |
| 19 |
* without specific prior written permission. |
| 20 |
* |
| 21 |
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND |
| 22 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 23 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 24 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE |
| 25 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 26 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 27 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 28 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 29 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 30 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 31 |
* SUCH DAMAGE. |
| 32 |
*/ |
| 33 |
|
| 34 |
#include <config.h> |
| 35 |
#include <roken.h> |
| 36 |
#include <err.h> |
| 37 |
|
| 38 |
#include <evp.h> |
| 39 |
|
| 40 |
struct tests { |
| 41 |
const char *password; |
| 42 |
const char *salt; |
| 43 |
int iterations; |
| 44 |
const void *pbkdf2_128; |
| 45 |
const void *pbkdf2_256; |
| 46 |
}; |
| 47 |
|
| 48 |
|
| 49 |
const struct tests pkcs5_tests[] = { |
| 50 |
{ "password", |
| 51 |
"ATHENA.MIT.EDUraeburn", |
| 52 |
1, |
| 53 |
"\xcd\xed\xb5\x28\x1b\xb2\xf8\x01\x56\x5a\x11\x22\xb2\x56\x35\x15", |
| 54 |
"\xcd\xed\xb5\x28\x1b\xb2\xf8\x01\x56\x5a\x11\x22\xb2\x56\x35\x15" |
| 55 |
"\x0a\xd1\xf7\xa0\x4b\xb9\xf3\xa3\x33\xec\xc0\xe2\xe1\xf7\x08\x37" |
| 56 |
}, |
| 57 |
{ "password", |
| 58 |
"ATHENA.MIT.EDUraeburn", |
| 59 |
2, |
| 60 |
"\x01\xdb\xee\x7f\x4a\x9e\x24\x3e\x98\x8b\x62\xc7\x3c\xda\x93\x5d", |
| 61 |
"\x01\xdb\xee\x7f\x4a\x9e\x24\x3e\x98\x8b\x62\xc7\x3c\xda\x93\x5d" |
| 62 |
"\xa0\x53\x78\xb9\x32\x44\xec\x8f\x48\xa9\x9e\x61\xad\x79\x9d\x86" |
| 63 |
}, |
| 64 |
{ "password", |
| 65 |
"ATHENA.MIT.EDUraeburn", |
| 66 |
1200, |
| 67 |
"\x5c\x08\xeb\x61\xfd\xf7\x1e\x4e\x4e\xc3\xcf\x6b\xa1\xf5\x51\x2b", |
| 68 |
"\x5c\x08\xeb\x61\xfd\xf7\x1e\x4e\x4e\xc3\xcf\x6b\xa1\xf5\x51\x2b" |
| 69 |
"\xa7\xe5\x2d\xdb\xc5\xe5\x14\x2f\x70\x8a\x31\xe2\xe6\x2b\x1e\x13" |
| 70 |
}, |
| 71 |
{ |
| 72 |
"password", "\x12\x34\x56\x78\x78\x56\x34\x12", |
| 73 |
5, |
| 74 |
"\xd1\xda\xa7\x86\x15\xf2\x87\xe6\xa1\xc8\xb1\x20\xd7\x06\x2a\x49", |
| 75 |
"\xd1\xda\xa7\x86\x15\xf2\x87\xe6\xa1\xc8\xb1\x20\xd7\x06\x2a\x49" |
| 76 |
"\x3f\x98\xd2\x03\xe6\xbe\x49\xa6\xad\xf4\xfa\x57\x4b\x6e\x64\xee" |
| 77 |
}, |
| 78 |
{ |
| 79 |
"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", |
| 80 |
"pass phrase equals block size", |
| 81 |
1200, |
| 82 |
"\x13\x9c\x30\xc0\x96\x6b\xc3\x2b\xa5\x5f\xdb\xf2\x12\x53\x0a\xc9", |
| 83 |
"\x13\x9c\x30\xc0\x96\x6b\xc3\x2b\xa5\x5f\xdb\xf2\x12\x53\x0a\xc9" |
| 84 |
"\xc5\xec\x59\xf1\xa4\x52\xf5\xcc\x9a\xd9\x40\xfe\xa0\x59\x8e\xd1" |
| 85 |
}, |
| 86 |
{ |
| 87 |
"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", |
| 88 |
"pass phrase exceeds block size", |
| 89 |
1200, |
| 90 |
"\x9c\xca\xd6\xd4\x68\x77\x0c\xd5\x1b\x10\xe6\xa6\x87\x21\xbe\x61", |
| 91 |
"\x9c\xca\xd6\xd4\x68\x77\x0c\xd5\x1b\x10\xe6\xa6\x87\x21\xbe\x61" |
| 92 |
"\x1a\x8b\x4d\x28\x26\x01\xdb\x3b\x36\xbe\x92\x46\x91\x5e\xc8\x2a" |
| 93 |
}, |
| 94 |
{ |
| 95 |
"\xf0\x9d\x84\x9e" /* g-clef */, |
| 96 |
"EXAMPLE.COMpianist", |
| 97 |
50, |
| 98 |
"\x6b\x9c\xf2\x6d\x45\x45\x5a\x43\xa5\xb8\xbb\x27\x6a\x40\x3b\x39", |
| 99 |
"\x6b\x9c\xf2\x6d\x45\x45\x5a\x43\xa5\xb8\xbb\x27\x6a\x40\x3b\x39" |
| 100 |
"\xe7\xfe\x37\xa0\xc4\x1e\x02\xc2\x81\xff\x30\x69\xe1\xe9\x4f\x52" |
| 101 |
} |
| 102 |
}; |
| 103 |
|
| 104 |
static int |
| 105 |
test_pkcs5_pbe2(const struct tests *t) |
| 106 |
{ |
| 107 |
unsigned char key[32]; |
| 108 |
int ret, error = 0; |
| 109 |
|
| 110 |
ret = PKCS5_PBKDF2_HMAC(t->password, strlen(t->password), |
| 111 |
t->salt, strlen(t->salt), |
| 112 |
t->iterations, EVP_sha1(), |
| 113 |
16, key); |
| 114 |
if (ret != 1) |
| 115 |
errx(1, "PKCS5_PBKDF2_HMAC: %d", ret); |
| 116 |
|
| 117 |
if (memcmp(t->pbkdf2_128, key, 16) != 0) { |
| 118 |
printf("incorrect 128 key\n"); |
| 119 |
error++; |
| 120 |
} |
| 121 |
|
| 122 |
ret = PKCS5_PBKDF2_HMAC(t->password, strlen(t->password), |
| 123 |
t->salt, strlen(t->salt), |
| 124 |
t->iterations, EVP_sha1(), |
| 125 |
32, key); |
| 126 |
if (ret != 1) |
| 127 |
errx(1, "PKCS5_PBKDF2_HMAC: %d", ret); |
| 128 |
|
| 129 |
if (memcmp(t->pbkdf2_256, key, 32) != 0) { |
| 130 |
printf("incorrect 256 key\n"); |
| 131 |
error++; |
| 132 |
} |
| 133 |
|
| 134 |
return error; |
| 135 |
} |
| 136 |
|
| 137 |
int |
| 138 |
main(int argc, char **argv) |
| 139 |
{ |
| 140 |
int ret = 0; |
| 141 |
int i; |
| 142 |
|
| 143 |
for (i = 0; i < sizeof(pkcs5_tests)/sizeof(pkcs5_tests[0]); i++) |
| 144 |
ret += test_pkcs5_pbe2(&pkcs5_tests[i]); |
| 145 |
|
| 146 |
return ret; |
| 147 |
} |