1 /* 2 * Copyright (c) 1999 - 2001 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 KTH nor the names of its contributors may be 18 * used to endorse or promote products derived from this software without 19 * specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY KTH AND ITS CONTRIBUTORS ``AS IS'' AND ANY 22 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 24 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KTH OR ITS CONTRIBUTORS BE 25 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 26 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 27 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR 28 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 29 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 30 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 31 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ 32 33 #include "krb5_locl.h" 34 35 enum { MAXSIZE = 24 }; 36 37 static struct testcase { 38 const char *str; 39 unsigned n; 40 unsigned char res[MAXSIZE]; 41 } tests[] = { 42 {"012345", 8, 43 {0xbe, 0x07, 0x26, 0x31, 0x27, 0x6b, 0x19, 0x55} 44 }, 45 {"basch", 24, 46 {0x1a, 0xab, 0x6b, 0x42, 0x96, 0x4b, 0x98, 0xb2, 0x1f, 0x8c, 0xde, 47 0x2d, 0x24, 0x48, 0xba, 0x34, 0x55, 0xd7, 0x86, 0x2c, 0x97, 0x31, 48 0x64, 0x3f} 49 }, 50 {"eichin", 24, 51 {0x65, 0x69, 0x63, 0x68, 0x69, 0x6e, 0x4b, 0x73, 0x2b, 0x4b, 52 0x1b, 0x43, 0xda, 0x1a, 0x5b, 0x99, 0x5a, 0x58, 0xd2, 0xc6, 0xd0, 53 0xd2, 0xdc, 0xca} 54 }, 55 {"sommerfeld", 24, 56 {0x2f, 0x7a, 0x98, 0x55, 0x7c, 0x6e, 0xe4, 0xab, 0xad, 0xf4, 57 0xe7, 0x11, 0x92, 0xdd, 0x44, 0x2b, 0xd4, 0xff, 0x53, 0x25, 0xa5, 58 0xde, 0xf7, 0x5c} 59 }, 60 {"MASSACHVSETTS INSTITVTE OF TECHNOLOGY", 24, 61 {0xdb, 0x3b, 0x0d, 0x8f, 0x0b, 0x06, 0x1e, 0x60, 0x32, 0x82, 62 0xb3, 0x08, 0xa5, 0x08, 0x41, 0x22, 0x9a, 0xd7, 0x98, 0xfa, 0xb9, 63 0x54, 0x0c, 0x1b} 64 }, 65 {"assar@NADA.KTH.SE", 24, 66 {0x5c, 0x06, 0xc3, 0x4d, 0x2c, 0x89, 0x05, 0xbe, 0x7a, 0x51, 67 0x83, 0x6c, 0xd6, 0xf8, 0x1c, 0x4b, 0x7a, 0x93, 0x49, 0x16, 0x5a, 68 0xb3, 0xfa, 0xa9} 69 }, 70 {"testKRBTEST.MIT.EDUtestkey", 24, 71 {0x50, 0x2c, 0xf8, 0x29, 0x78, 0xe5, 0xfb, 0x1a, 0x29, 0x06, 72 0xbd, 0x22, 0x28, 0x91, 0x56, 0xc0, 0x06, 0xa0, 0xdc, 0xf5, 0xb6, 73 0xc2, 0xda, 0x6c} 74 }, 75 {"password", 7, 76 {0x78, 0xa0, 0x7b, 0x6c, 0xaf, 0x85, 0xfa} 77 }, 78 {"Rough Consensus, and Running Code", 8, 79 {0xbb, 0x6e, 0xd3, 0x08, 0x70, 0xb7, 0xf0, 0xe0}, 80 }, 81 {"password", 21, 82 {0x59, 0xe4, 0xa8, 0xca, 0x7c, 0x03, 0x85, 0xc3, 0xc3, 0x7b, 0x3f, 83 0x6d, 0x20, 0x00, 0x24, 0x7c, 0xb6, 0xe6, 0xbd, 0x5b, 0x3e}, 84 }, 85 {"MASSACHVSETTS INSTITVTE OF TECHNOLOGY", 24, 86 {0xdb, 0x3b, 0x0d, 0x8f, 0x0b, 0x06, 0x1e, 0x60, 0x32, 0x82, 0xb3, 87 0x08, 0xa5, 0x08, 0x41, 0x22, 0x9a, 0xd7, 0x98, 0xfa, 0xb9, 0x54, 88 0x0c, 0x1b} 89 }, 90 {NULL, 0} 91 }; 92 93 int 94 main(int argc, char **argv) 95 { 96 unsigned char data[MAXSIZE]; 97 struct testcase *t; 98 int ret = 0; 99 100 for (t = tests; t->str; ++t) { 101 int i; 102 103 ret = _krb5_n_fold (t->str, strlen(t->str), data, t->n); 104 if (ret) 105 errx(1, "out of memory"); 106 if (memcmp (data, t->res, t->n) != 0) { 107 printf ("n-fold(\"%s\", %d) failed\n", t->str, t->n); 108 printf ("should be: "); 109 for (i = 0; i < t->n; ++i) 110 printf ("%02x", t->res[i]); 111 printf ("\nresult was: "); 112 for (i = 0; i < t->n; ++i) 113 printf ("%02x", data[i]); 114 printf ("\n"); 115 ret = 1; 116 } 117 } 118 return ret; 119 } 120