blob: d6a87b5de06eeb2df74d90a47daced72b5ef291a [file] [log] [blame]
Eric Andersen27f64e12002-06-23 04:24:25 +00001/* vi: set sw=4 ts=4: */
2/*
Rob Landleya13cca92006-04-02 18:57:20 +00003 * Mini weak password checker implementation for busybox
Eric Andersen27f64e12002-06-23 04:24:25 +00004 *
Rob Landleya13cca92006-04-02 18:57:20 +00005 * Copyright (C) 2006 Tito Ragusa <farmatito@tiscali.it>
Eric Andersen27f64e12002-06-23 04:24:25 +00006 *
Rob Landleya13cca92006-04-02 18:57:20 +00007 * Licensed under GPLv2 or later, see file LICENSE in this tarball for details.
Eric Andersen27f64e12002-06-23 04:24:25 +00008 */
9
Rob Landleya13cca92006-04-02 18:57:20 +000010/* A good password:
11 1) should contain at least six characters (man passwd);
12 2) empty passwords are not permitted;
13 3) should contain a mix of four different types of characters
14 upper case letters,
15 lower case letters,
16 numbers,
17 special characters such as !@#$%^&*,;".
18 This password types should not be permitted:
19 a) pure numbers: birthdates, social security number, license plate, phone numbers;
20 b) words and all letters only passwords (uppercase, lowercase or mixed)
Bernhard Reutner-Fischera2a647d2006-05-19 12:30:00 +000021 as palindromes, consecutive or repetitive letters
Rob Landleya13cca92006-04-02 18:57:20 +000022 or adjacent letters on your keyboard;
23 c) username, real name, company name or (e-mail?) address
24 in any form (as-is, reversed, capitalized, doubled, etc.).
25 (we can check only against username, gecos and hostname)
Bernhard Reutner-Fischera2a647d2006-05-19 12:30:00 +000026 d) common and obvious letter-number replacements
Rob Landleya13cca92006-04-02 18:57:20 +000027 (e.g. replace the letter O with number 0)
28 such as "M1cr0$0ft" or "P@ssw0rd" (CAVEAT: we cannot check for them
29 without the use of a dictionary).
Eric Andersen27f64e12002-06-23 04:24:25 +000030
Rob Landleya13cca92006-04-02 18:57:20 +000031 For each missing type of characters an increase of password length is
32 requested.
33
34 If user is root we warn only.
35
36 CAVEAT: some older versions of crypt() truncates passwords to 8 chars,
37 so that aaaaaaaa1Q$ is equal to aaaaaaaa making it possible to fool
38 some of our checks. We don't test for this special case as newer versions
39 of crypt do not truncate passwords.
40*/
41
Eric Andersen27f64e12002-06-23 04:24:25 +000042#include <ctype.h>
Rob Landleya13cca92006-04-02 18:57:20 +000043#include <unistd.h>
44#include <string.h>
Bernhard Reutner-Fischera2a647d2006-05-19 12:30:00 +000045#include <strings.h>
Rob Landleya13cca92006-04-02 18:57:20 +000046
Eric Andersen27f64e12002-06-23 04:24:25 +000047#include "libbb.h"
48
Eric Andersen27f64e12002-06-23 04:24:25 +000049
Rob Landleya13cca92006-04-02 18:57:20 +000050/* passwords should consist of 6 (to 8 characters) */
Bernhard Reutner-Fischera2a647d2006-05-19 12:30:00 +000051#define MINLEN 6
Rob Landleya13cca92006-04-02 18:57:20 +000052
53
54static int string_checker_helper(const char *p1, const char *p2) __attribute__ ((__pure__));
55
56static int string_checker_helper(const char *p1, const char *p2)
Eric Andersen27f64e12002-06-23 04:24:25 +000057{
Rob Landleya13cca92006-04-02 18:57:20 +000058 /* as-is or capitalized */
59 if (strcasecmp(p1, p2) == 0
60 /* as sub-string */
61 || strcasestr(p2, p1) != NULL
62 /* invert in case haystack is shorter than needle */
63 || strcasestr(p1, p2) != NULL)
64 return 1;
65 return 0;
Eric Andersen27f64e12002-06-23 04:24:25 +000066}
67
Rob Landleya13cca92006-04-02 18:57:20 +000068static int string_checker(const char *p1, const char *p2)
Eric Andersen27f64e12002-06-23 04:24:25 +000069{
Eric Andersen27f64e12002-06-23 04:24:25 +000070 int size;
Rob Landleya13cca92006-04-02 18:57:20 +000071 /* check string */
72 int ret = string_checker_helper(p1, p2);
73 /* Make our own copy */
74 char *p = bb_xstrdup(p1);
75 /* reverse string */
76 size = strlen(p);
77
78 while (size--) {
79 *p = p1[size];
80 p++;
81 }
82 /* restore pointer */
83 p -= strlen(p1);
84 /* check reversed string */
85 ret |= string_checker_helper(p, p2);
86 /* clean up */
87 memset(p, 0, strlen(p1));
88 free(p);
89 return ret;
90}
91
92#define LOWERCASE 1
93#define UPPERCASE 2
94#define NUMBERS 4
95#define SPECIAL 8
96
Bernhard Reutner-Fischera2a647d2006-05-19 12:30:00 +000097static const char *obscure_msg(const char *old_p, const char *new_p, const struct passwd *pw)
Rob Landleya13cca92006-04-02 18:57:20 +000098{
Eric Andersen27f64e12002-06-23 04:24:25 +000099 int i;
Rob Landleya13cca92006-04-02 18:57:20 +0000100 int c;
101 int length;
102 int mixed = 0;
103 /* Add 1 for each type of characters to the minlen of password */
104 int size = MINLEN + 8;
105 const char *p;
106 char hostname[255];
Eric Andersen27f64e12002-06-23 04:24:25 +0000107
Rob Landleya13cca92006-04-02 18:57:20 +0000108 /* size */
109 if (!new_p || (length = strlen(new_p)) < MINLEN)
110 return("too short");
Bernhard Reutner-Fischera2a647d2006-05-19 12:30:00 +0000111
Rob Landleya13cca92006-04-02 18:57:20 +0000112 /* no username as-is, as sub-string, reversed, capitalized, doubled */
113 if (string_checker(new_p, pw->pw_name)) {
114 return "similar to username";
115 }
116 /* no gecos as-is, as sub-string, reversed, capitalized, doubled */
117 if (string_checker(new_p, pw->pw_gecos)) {
118 return "similar to gecos";
119 }
120 /* hostname as-is, as sub-string, reversed, capitalized, doubled */
121 if (gethostname(hostname, 255) == 0) {
122 hostname[254] = '\0';
123 if (string_checker(new_p, hostname)) {
124 return "similar to hostname";
125 }
Eric Andersen27f64e12002-06-23 04:24:25 +0000126 }
127
Rob Landleya13cca92006-04-02 18:57:20 +0000128 /* Should / Must contain a mix of: */
129 for (i = 0; i < length; i++) {
130 if (islower(new_p[i])) { /* a-z */
131 mixed |= LOWERCASE;
132 } else if (isupper(new_p[i])) { /* A-Z */
133 mixed |= UPPERCASE;
134 } else if (isdigit(new_p[i])) { /* 0-9 */
135 mixed |= NUMBERS;
136 } else { /* special characters */
137 mixed |= SPECIAL;
138 }
139 /* More than 50% similar characters ? */
140 c = 0;
141 p = new_p;
142 while (1) {
143 if ((p = strchr(p, new_p[i])) == NULL) {
144 break;
145 }
146 c++;
147 if (!++p) {
148 break; /* move past the matched char if possible */
149 }
150 }
Eric Andersen27f64e12002-06-23 04:24:25 +0000151
Rob Landleya13cca92006-04-02 18:57:20 +0000152 if (c >= (length / 2)) {
153 return "too many similar characters";
154 }
Eric Andersen3124a9e2003-07-30 07:57:06 +0000155 }
Bernhard Reutner-Fischera2a647d2006-05-19 12:30:00 +0000156 for (i=0; i<4; i++)
Rob Landleya13cca92006-04-02 18:57:20 +0000157 if (mixed & (1<<i)) size -= 2;
158 if (length < size)
159 return "too weak";
Bernhard Reutner-Fischera2a647d2006-05-19 12:30:00 +0000160
Rob Landleya13cca92006-04-02 18:57:20 +0000161 if (old_p && old_p[0] != '\0') {
162 /* check vs. old password */
163 if (string_checker(new_p, old_p)) {
164 return "similar to old password";
165 }
166 }
167 return NULL;
Eric Andersen27f64e12002-06-23 04:24:25 +0000168}
169
Rob Landleydfba7412006-03-06 20:47:33 +0000170int obscure(const char *old, const char *newval, const struct passwd *pwdp)
Eric Andersen27f64e12002-06-23 04:24:25 +0000171{
Rob Landleya13cca92006-04-02 18:57:20 +0000172 const char *msg;
Eric Andersen27f64e12002-06-23 04:24:25 +0000173
Rob Landleya13cca92006-04-02 18:57:20 +0000174 if ((msg = obscure_msg(old, newval, pwdp))) {
Eric Andersen27f64e12002-06-23 04:24:25 +0000175 printf("Bad password: %s.\n", msg);
Rob Landleya13cca92006-04-02 18:57:20 +0000176 /* If user is root warn only */
177 return (getuid())? 1 : 0;
Eric Andersen27f64e12002-06-23 04:24:25 +0000178 }
Eric Andersen27f64e12002-06-23 04:24:25 +0000179 return 0;
180}