2 * Copyright (c) 1998 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
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.
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.
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
33 /* $FreeBSD: src/crypto/kerberosIV/kadmin/random_password.c,v 1.1.1.2.2.1 2003/02/14 22:37:37 nectar Exp $ */
35 #include "kadm_locl.h"
37 RCSID("$Id: random_password.c,v 1.4 1999/12/02 16:58:36 joda Exp $");
39 /* This file defines some a function that generates a random password,
40 that can be used when creating a large amount of principals (such
41 as for a batch of students). Since this is a political matter, you
42 should think about how secure generated passwords has to be.
44 Both methods defined here will give you at least 55 bits of
48 /* If you want OTP-style passwords, define OTP_STYLE */
53 static void generate_password(char **pw, int num_classes, ...);
57 random_password(char *pw, size_t len, u_int32_t *low, u_int32_t *high)
61 des_random_key(&newkey);
62 otp_print_stddict (newkey, pw, len);
66 generate_password(&pass, 3,
67 "abcdefghijklmnopqrstuvwxyz", 7,
68 "ABCDEFGHIJKLMNOPQRSTUVWXYZ", 2,
69 "@$%&*()-+=:,/<>1234567890", 1);
70 strlcpy(pw, pass, len);
71 memset(pass, 0, strlen(pass));
74 des_string_to_key(pw, &newkey);
75 memcpy(low, newkey, 4);
76 memcpy(high, ((char *)newkey) + 4, 4);
77 memset(newkey, 0, sizeof(newkey));
83 /* some helper functions */
86 /* return a random value in range 0-127 */
88 RND(des_cblock *key, int *left)
95 return ((unsigned char*)key)[*left];
98 /* This a helper function that generates a random password with a
99 number of characters from a set of character classes.
101 If there are n classes, and the size of each class is Pi, and the
102 number of characters from each class is Ni, the number of possible
103 passwords are (given that the character classes are disjoint):
113 Since it uses the RND function above, neither the size of each
114 class, nor the total length of the generated password should be
115 larger than 127 (without fixing RND).
119 generate_password(char **pw, int num_classes, ...)
128 des_cblock rbuf; /* random buffer */
131 classes = malloc(num_classes * sizeof(*classes));
132 va_start(ap, num_classes);
134 for(i = 0; i < num_classes; i++){
135 classes[i].str = va_arg(ap, const char*);
136 classes[i].len = strlen(classes[i].str);
137 classes[i].freq = va_arg(ap, int);
138 len += classes[i].freq;
141 *pw = malloc(len + 1);
144 for(i = 0; i < len; i++) {
146 int x = RND(&rbuf, &rleft) % (len - i);
148 for(j = 0; j < num_classes; j++) {
149 if(x < t + classes[j].freq) {
150 (*pw)[i] = classes[j].str[RND(&rbuf, &rleft) % classes[j].len];
154 t += classes[j].freq;
158 memset(rbuf, 0, sizeof(rbuf));