| Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
| Md5Crypt |
|
| 3.142857142857143;3.143 |
| 1 | /* | |
| 2 | * Licensed to the Apache Software Foundation (ASF) under one or more | |
| 3 | * contributor license agreements. See the NOTICE file distributed with | |
| 4 | * this work for additional information regarding copyright ownership. | |
| 5 | * The ASF licenses this file to You under the Apache License, Version 2.0 | |
| 6 | * (the "License"); you may not use this file except in compliance with | |
| 7 | * the License. You may obtain a copy of the License at | |
| 8 | * | |
| 9 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 10 | * | |
| 11 | * Unless required by applicable law or agreed to in writing, software | |
| 12 | * distributed under the License is distributed on an "AS IS" BASIS, | |
| 13 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| 14 | * See the License for the specific language governing permissions and | |
| 15 | * limitations under the License. | |
| 16 | */ | |
| 17 | package org.apache.commons.codec.digest; | |
| 18 | ||
| 19 | import java.security.MessageDigest; | |
| 20 | import java.util.Arrays; | |
| 21 | import java.util.regex.Matcher; | |
| 22 | import java.util.regex.Pattern; | |
| 23 | ||
| 24 | import org.apache.commons.codec.Charsets; | |
| 25 | ||
| 26 | /** | |
| 27 | * The libc crypt() "$1$" and Apache "$apr1$" MD5-based hash algorithm. | |
| 28 | * <p> | |
| 29 | * Based on the public domain ("beer-ware") C implementation from Poul-Henning Kamp which was found at: <a | |
| 30 | * href="http://www.freebsd.org/cgi/cvsweb.cgi/src/lib/libcrypt/crypt-md5.c?rev=1.1;content-type=text%2Fplain"> | |
| 31 | * crypt-md5.c @ freebsd.org</a><br/> | |
| 32 | * <p> | |
| 33 | * Source: | |
| 34 | * | |
| 35 | * <pre> | |
| 36 | * $FreeBSD: src/lib/libcrypt/crypt-md5.c,v 1.1 1999/01/21 13:50:09 brandon Exp $ | |
| 37 | * </pre> | |
| 38 | * <p> | |
| 39 | * Conversion to Kotlin and from there to Java in 2012. | |
| 40 | * <p> | |
| 41 | * The C style comments are from the original C code, the ones with "//" from the port. | |
| 42 | * <p> | |
| 43 | * This class is immutable and thread-safe. | |
| 44 | * | |
| 45 | * @version $Id: Md5Crypt.java 1429868 2013-01-07 16:08:05Z ggregory $ | |
| 46 | * @since 1.7 | |
| 47 | */ | |
| 48 | 1 | public class Md5Crypt { |
| 49 | ||
| 50 | /** The Identifier of the Apache variant. */ | |
| 51 | static final String APR1_PREFIX = "$apr1$"; | |
| 52 | ||
| 53 | /** The number of bytes of the final hash. */ | |
| 54 | private static final int BLOCKSIZE = 16; | |
| 55 | ||
| 56 | /** The Identifier of this crypt() variant. */ | |
| 57 | static final String MD5_PREFIX = "$1$"; | |
| 58 | ||
| 59 | /** The number of rounds of the big loop. */ | |
| 60 | private static final int ROUNDS = 1000; | |
| 61 | ||
| 62 | /** | |
| 63 | * See {@link #apr1Crypt(String, String)} for details. | |
| 64 | * | |
| 65 | * @throws RuntimeException | |
| 66 | * when a {@link java.security.NoSuchAlgorithmException} is caught. * | |
| 67 | */ | |
| 68 | public static String apr1Crypt(final byte[] keyBytes) { | |
| 69 | 5 | return apr1Crypt(keyBytes, APR1_PREFIX + B64.getRandomSalt(8)); |
| 70 | } | |
| 71 | ||
| 72 | /** | |
| 73 | * See {@link #apr1Crypt(String, String)} for details. | |
| 74 | * | |
| 75 | * @throws IllegalArgumentException | |
| 76 | * if the salt does not match the allowed pattern | |
| 77 | * @throws RuntimeException | |
| 78 | * when a {@link java.security.NoSuchAlgorithmException} is caught. | |
| 79 | */ | |
| 80 | public static String apr1Crypt(final byte[] keyBytes, String salt) { | |
| 81 | // to make the md5Crypt regex happy | |
| 82 | 21 | if (salt != null && !salt.startsWith(APR1_PREFIX)) { |
| 83 | 4 | salt = APR1_PREFIX + salt; |
| 84 | } | |
| 85 | 21 | return Md5Crypt.md5Crypt(keyBytes, salt, APR1_PREFIX); |
| 86 | } | |
| 87 | ||
| 88 | /** | |
| 89 | * See {@link #apr1Crypt(String, String)} for details. | |
| 90 | * | |
| 91 | * @throws RuntimeException | |
| 92 | * when a {@link java.security.NoSuchAlgorithmException} is caught. | |
| 93 | */ | |
| 94 | public static String apr1Crypt(final String keyBytes) { | |
| 95 | 2 | return apr1Crypt(keyBytes.getBytes(Charsets.UTF_8)); |
| 96 | } | |
| 97 | ||
| 98 | /** | |
| 99 | * Generates an Apache htpasswd compatible "$apr1$" MD5 based hash value. | |
| 100 | * <p> | |
| 101 | * The algorithm is identical to the crypt(3) "$1$" one but produces different outputs due to the different salt | |
| 102 | * prefix. | |
| 103 | * | |
| 104 | * @param keyBytes | |
| 105 | * plaintext string that should be hashed. | |
| 106 | * @param salt | |
| 107 | * salt string including the prefix and optionally garbage at the end. Will be generated randomly if | |
| 108 | * null. | |
| 109 | * @return computed hash value | |
| 110 | * @throws IllegalArgumentException | |
| 111 | * if the salt does not match the allowed pattern | |
| 112 | * @throws RuntimeException | |
| 113 | * when a {@link java.security.NoSuchAlgorithmException} is caught. | |
| 114 | */ | |
| 115 | public static String apr1Crypt(final String keyBytes, final String salt) { | |
| 116 | 11 | return apr1Crypt(keyBytes.getBytes(Charsets.UTF_8), salt); |
| 117 | } | |
| 118 | ||
| 119 | /** | |
| 120 | * Generates a libc6 crypt() compatible "$1$" hash value. | |
| 121 | * <p> | |
| 122 | * See {@link Crypt#crypt(String, String)} for details. | |
| 123 | * | |
| 124 | * @throws RuntimeException | |
| 125 | * when a {@link java.security.NoSuchAlgorithmException} is caught. | |
| 126 | */ | |
| 127 | public static String md5Crypt(final byte[] keyBytes) { | |
| 128 | 2 | return md5Crypt(keyBytes, MD5_PREFIX + B64.getRandomSalt(8)); |
| 129 | } | |
| 130 | ||
| 131 | /** | |
| 132 | * Generates a libc crypt() compatible "$1$" MD5 based hash value. | |
| 133 | * <p> | |
| 134 | * See {@link Crypt#crypt(String, String)} for details. | |
| 135 | * | |
| 136 | * @param keyBytes | |
| 137 | * plaintext string that should be hashed. | |
| 138 | * @param salt | |
| 139 | * salt string including the prefix and optionally garbage at the end. Will be generated randomly if | |
| 140 | * null. | |
| 141 | * @return computed hash value | |
| 142 | * @throws IllegalArgumentException | |
| 143 | * if the salt does not match the allowed pattern | |
| 144 | * @throws RuntimeException | |
| 145 | * when a {@link java.security.NoSuchAlgorithmException} is caught. | |
| 146 | */ | |
| 147 | public static String md5Crypt(final byte[] keyBytes, final String salt) { | |
| 148 | 14 | return md5Crypt(keyBytes, salt, MD5_PREFIX); |
| 149 | } | |
| 150 | ||
| 151 | /** | |
| 152 | * Generates a libc6 crypt() "$1$" or Apache htpasswd "$apr1$" hash value. | |
| 153 | * <p> | |
| 154 | * See {@link Crypt#crypt(String, String)} or {@link #apr1Crypt(String, String)} for details. | |
| 155 | * | |
| 156 | * @throws IllegalArgumentException | |
| 157 | * if the salt does not match the allowed pattern | |
| 158 | * @throws RuntimeException | |
| 159 | * when a {@link java.security.NoSuchAlgorithmException} is caught. | |
| 160 | */ | |
| 161 | public static String md5Crypt(final byte[] keyBytes, final String salt, final String prefix) { | |
| 162 | 35 | final int keyLen = keyBytes.length; |
| 163 | ||
| 164 | // Extract the real salt from the given string which can be a complete hash string. | |
| 165 | String saltString; | |
| 166 | 33 | if (salt == null) { |
| 167 | 2 | saltString = B64.getRandomSalt(8); |
| 168 | } else { | |
| 169 | 31 | final Pattern p = Pattern.compile("^" + prefix.replace("$", "\\$") + "([\\.\\/a-zA-Z0-9]{1,8}).*"); |
| 170 | 31 | final Matcher m = p.matcher(salt); |
| 171 | 31 | if (m == null || !m.find()) { |
| 172 | 3 | throw new IllegalArgumentException("Invalid salt value: " + salt); |
| 173 | } | |
| 174 | 28 | saltString = m.group(1); |
| 175 | } | |
| 176 | 30 | final byte[] saltBytes = saltString.getBytes(Charsets.UTF_8); |
| 177 | ||
| 178 | 30 | final MessageDigest ctx = DigestUtils.getMd5Digest(); |
| 179 | ||
| 180 | /* | |
| 181 | * The password first, since that is what is most unknown | |
| 182 | */ | |
| 183 | 30 | ctx.update(keyBytes); |
| 184 | ||
| 185 | /* | |
| 186 | * Then our magic string | |
| 187 | */ | |
| 188 | 30 | ctx.update(prefix.getBytes(Charsets.UTF_8)); |
| 189 | ||
| 190 | /* | |
| 191 | * Then the raw salt | |
| 192 | */ | |
| 193 | 30 | ctx.update(saltBytes); |
| 194 | ||
| 195 | /* | |
| 196 | * Then just as many characters of the MD5(pw,salt,pw) | |
| 197 | */ | |
| 198 | 30 | MessageDigest ctx1 = DigestUtils.getMd5Digest(); |
| 199 | 30 | ctx1.update(keyBytes); |
| 200 | 30 | ctx1.update(saltBytes); |
| 201 | 30 | ctx1.update(keyBytes); |
| 202 | 30 | byte[] finalb = ctx1.digest(); |
| 203 | 30 | int ii = keyLen; |
| 204 | 57 | while (ii > 0) { |
| 205 | 27 | ctx.update(finalb, 0, ii > 16 ? 16 : ii); |
| 206 | 27 | ii -= 16; |
| 207 | } | |
| 208 | ||
| 209 | /* | |
| 210 | * Don't leave anything around in vm they could use. | |
| 211 | */ | |
| 212 | 30 | Arrays.fill(finalb, (byte) 0); |
| 213 | ||
| 214 | /* | |
| 215 | * Then something really weird... | |
| 216 | */ | |
| 217 | 30 | ii = keyLen; |
| 218 | 30 | final int j = 0; |
| 219 | 110 | while (ii > 0) { |
| 220 | 80 | if ((ii & 1) == 1) { |
| 221 | 48 | ctx.update(finalb[j]); |
| 222 | } else { | |
| 223 | 32 | ctx.update(keyBytes[j]); |
| 224 | } | |
| 225 | 80 | ii >>= 1; |
| 226 | } | |
| 227 | ||
| 228 | /* | |
| 229 | * Now make the output string | |
| 230 | */ | |
| 231 | 30 | final StringBuilder passwd = new StringBuilder(prefix + saltString + "$"); |
| 232 | 30 | finalb = ctx.digest(); |
| 233 | ||
| 234 | /* | |
| 235 | * and now, just to make sure things don't run too fast On a 60 Mhz Pentium this takes 34 msec, so you would | |
| 236 | * need 30 seconds to build a 1000 entry dictionary... | |
| 237 | */ | |
| 238 | 30030 | for (int i = 0; i < ROUNDS; i++) { |
| 239 | 30000 | ctx1 = DigestUtils.getMd5Digest(); |
| 240 | 30000 | if ((i & 1) != 0) { |
| 241 | 15000 | ctx1.update(keyBytes); |
| 242 | } else { | |
| 243 | 15000 | ctx1.update(finalb, 0, BLOCKSIZE); |
| 244 | } | |
| 245 | ||
| 246 | 30000 | if (i % 3 != 0) { |
| 247 | 19980 | ctx1.update(saltBytes); |
| 248 | } | |
| 249 | ||
| 250 | 30000 | if (i % 7 != 0) { |
| 251 | 25710 | ctx1.update(keyBytes); |
| 252 | } | |
| 253 | ||
| 254 | 30000 | if ((i & 1) != 0) { |
| 255 | 15000 | ctx1.update(finalb, 0, BLOCKSIZE); |
| 256 | } else { | |
| 257 | 15000 | ctx1.update(keyBytes); |
| 258 | } | |
| 259 | 30000 | finalb = ctx1.digest(); |
| 260 | } | |
| 261 | ||
| 262 | // The following was nearly identical to the Sha2Crypt code. | |
| 263 | // Again, the buflen is not really needed. | |
| 264 | // int buflen = MD5_PREFIX.length() - 1 + salt_string.length() + 1 + BLOCKSIZE + 1; | |
| 265 | 30 | B64.b64from24bit(finalb[0], finalb[6], finalb[12], 4, passwd); |
| 266 | 30 | B64.b64from24bit(finalb[1], finalb[7], finalb[13], 4, passwd); |
| 267 | 30 | B64.b64from24bit(finalb[2], finalb[8], finalb[14], 4, passwd); |
| 268 | 30 | B64.b64from24bit(finalb[3], finalb[9], finalb[15], 4, passwd); |
| 269 | 30 | B64.b64from24bit(finalb[4], finalb[10], finalb[5], 4, passwd); |
| 270 | 30 | B64.b64from24bit((byte) 0, (byte) 0, finalb[11], 2, passwd); |
| 271 | ||
| 272 | /* | |
| 273 | * Don't leave anything around in vm they could use. | |
| 274 | */ | |
| 275 | // Is there a better way to do this with the JVM? | |
| 276 | 30 | ctx.reset(); |
| 277 | 30 | ctx1.reset(); |
| 278 | 30 | Arrays.fill(keyBytes, (byte) 0); |
| 279 | 30 | Arrays.fill(saltBytes, (byte) 0); |
| 280 | 30 | Arrays.fill(finalb, (byte) 0); |
| 281 | ||
| 282 | 30 | return passwd.toString(); |
| 283 | } | |
| 284 | } |