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