1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380
|
/* MessageDigest.java --- The message digest interface.
Copyright (C) 1999, 2002, 2003, 2006 Free Software Foundation, Inc.
This file is part of GNU Classpath.
GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
GNU Classpath is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING. If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.
Linking this library statically or dynamically with other modules is
making a combined work based on this library. Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.
As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module. An independent module is a module which is not derived from
or based on this library. If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so. If you do not wish to do so, delete this
exception statement from your version. */
package java.security;
import gnu.java.security.Engine;
import java.nio.ByteBuffer;
import java.lang.reflect.InvocationTargetException;
/**
* Message digests are secure one-way hash functions that take arbitrary-sized
* data and output a fixed-length hash value.
*
* @see MessageDigestSpi
* @since JDK 1.1
*/
public abstract class MessageDigest extends MessageDigestSpi
{
/** The service name for message digests. */
private static final String MESSAGE_DIGEST = "MessageDigest";
private String algorithm;
Provider provider;
private byte[] lastDigest;
/**
* Constructs a new instance of <code>MessageDigest</code> representing the
* specified algorithm.
*
* @param algorithm
* the name of the digest algorithm to use.
*/
protected MessageDigest(String algorithm)
{
this.algorithm = algorithm;
provider = null;
}
/**
* Returns a new instance of <code>MessageDigest</code> representing the
* specified algorithm.
*
* @param algorithm the name of the digest algorithm to use.
* @return a new instance representing the desired algorithm.
* @throws NoSuchAlgorithmException if the algorithm is not implemented by any
* provider.
* @throws IllegalArgumentException if <code>algorithm</code> is
* <code>null</code> or is an empty string.
*/
public static MessageDigest getInstance(String algorithm)
throws NoSuchAlgorithmException
{
Provider[] p = Security.getProviders();
NoSuchAlgorithmException lastException = null;
for (int i = 0; i < p.length; i++)
try
{
return getInstance(algorithm, p[i]);
}
catch (NoSuchAlgorithmException x)
{
lastException = x;
}
if (lastException != null)
throw lastException;
throw new NoSuchAlgorithmException(algorithm);
}
/**
* Returns a new instance of <code>MessageDigest</code> representing the
* specified algorithm from a named provider.
*
* @param algorithm the name of the digest algorithm to use.
* @param provider the name of the provider to use.
* @return a new instance representing the desired algorithm.
* @throws NoSuchAlgorithmException if the algorithm is not implemented by the
* named provider.
* @throws NoSuchProviderException if the named provider was not found.
* @throws IllegalArgumentException if either <code>algorithm</code> or
* <code>provider</code> is <code>null</code> or empty.
*/
public static MessageDigest getInstance(String algorithm, String provider)
throws NoSuchAlgorithmException, NoSuchProviderException
{
if (provider == null)
throw new IllegalArgumentException("provider MUST NOT be null");
provider = provider.trim();
if (provider.length() == 0)
throw new IllegalArgumentException("provider MUST NOT be empty");
Provider p = Security.getProvider(provider);
if (p == null)
throw new NoSuchProviderException(provider);
return getInstance(algorithm, p);
}
/**
* Returns a new instance of <code>MessageDigest</code> representing the
* specified algorithm from a designated {@link Provider}.
*
* @param algorithm the name of the digest algorithm to use.
* @param provider the {@link Provider} to use.
* @return a new instance representing the desired algorithm.
* @throws NoSuchAlgorithmException if the algorithm is not implemented by
* {@link Provider}.
* @throws IllegalArgumentException if either <code>algorithm</code> or
* <code>provider</code> is <code>null</code>, or if
* <code>algorithm</code> is an empty string.
* @since 1.4
* @see Provider
*/
public static MessageDigest getInstance(String algorithm, Provider provider)
throws NoSuchAlgorithmException
{
StringBuilder sb = new StringBuilder("MessageDigest for algorithm [")
.append(algorithm).append("] from provider[")
.append(provider).append("] ");
Object o;
try
{
o = Engine.getInstance(MESSAGE_DIGEST, algorithm, provider);
}
catch (InvocationTargetException x)
{
Throwable cause = x.getCause();
if (cause instanceof NoSuchAlgorithmException)
throw (NoSuchAlgorithmException) cause;
if (cause == null)
cause = x;
sb.append("could not be created");
NoSuchAlgorithmException y = new NoSuchAlgorithmException(sb.toString());
y.initCause(cause);
throw y;
}
MessageDigest result;
if (o instanceof MessageDigestSpi)
result = new DummyMessageDigest((MessageDigestSpi) o, algorithm);
else if (o instanceof MessageDigest)
{
result = (MessageDigest) o;
result.algorithm = algorithm;
}
else
{
sb.append("is of an unexpected Type: ").append(o.getClass().getName());
throw new NoSuchAlgorithmException(sb.toString());
}
result.provider = provider;
return result;
}
/**
* Returns the {@link Provider} of this instance.
*
* @return the {@link Provider} of this instance.
*/
public final Provider getProvider()
{
return provider;
}
/**
* Updates the digest with the byte.
*
* @param input byte to update the digest with.
*/
public void update(byte input)
{
engineUpdate(input);
}
/**
* Updates the digest with the bytes from the array starting from the
* specified offset and using the specified length of bytes.
*
* @param input
* bytes to update the digest with.
* @param offset
* the offset to start at.
* @param len
* length of the data to update with.
*/
public void update(byte[] input, int offset, int len)
{
engineUpdate(input, offset, len);
}
/**
* Updates the digest with the bytes of an array.
*
* @param input bytes to update the digest with.
*/
public void update(byte[] input)
{
engineUpdate(input, 0, input.length);
}
/**
* Updates the digest with the remaining bytes of a buffer.
*
* @param input The input byte buffer.
* @since 1.5
*/
public void update (ByteBuffer input)
{
engineUpdate (input);
}
/**
* Computes the final digest of the stored data.
*
* @return a byte array representing the message digest.
*/
public byte[] digest()
{
return lastDigest = engineDigest();
}
/**
* Computes the final digest of the stored bytes and returns the result.
*
* @param buf
* an array of bytes to store the result in.
* @param offset
* an offset to start storing the result at.
* @param len
* the length of the buffer.
* @return Returns the length of the buffer.
*/
public int digest(byte[] buf, int offset, int len) throws DigestException
{
return engineDigest(buf, offset, len);
}
/**
* Computes a final update using the input array of bytes, then computes a
* final digest and returns it. It calls {@link #update(byte[])} and then
* {@link #digest(byte[])}.
*
* @param input
* an array of bytes to perform final update with.
* @return a byte array representing the message digest.
*/
public byte[] digest(byte[] input)
{
update(input);
return digest();
}
/**
* Returns a string representation of this instance.
*
* @return a string representation of this instance.
*/
public String toString()
{
return (getClass()).getName() + " Message Digest <" + digestToString() + ">";
}
/**
* Does a simple byte comparison of the two digests.
*
* @param digesta
* first digest to compare.
* @param digestb
* second digest to compare.
* @return <code>true</code> if both are equal, <code>false</code>
* otherwise.
*/
public static boolean isEqual(byte[] digesta, byte[] digestb)
{
if (digesta.length != digestb.length)
return false;
for (int i = digesta.length - 1; i >= 0; --i)
if (digesta[i] != digestb[i])
return false;
return true;
}
/** Resets this instance. */
public void reset()
{
engineReset();
}
/**
* Returns the name of message digest algorithm.
*
* @return the name of message digest algorithm.
*/
public final String getAlgorithm()
{
return algorithm;
}
/**
* Returns the length of the message digest. The default is zero which means
* that the concrete implementation does not implement this method.
*
* @return length of the message digest.
* @since 1.2
*/
public final int getDigestLength()
{
return engineGetDigestLength();
}
/**
* Returns a clone of this instance if cloning is supported. If it does not
* then a {@link CloneNotSupportedException} is thrown. Cloning depends on
* whether the subclass {@link MessageDigestSpi} implements {@link Cloneable}
* which contains the actual implementation of the appropriate algorithm.
*
* @return a clone of this instance.
* @throws CloneNotSupportedException
* the implementation does not support cloning.
*/
public Object clone() throws CloneNotSupportedException
{
return super.clone();
}
private String digestToString()
{
byte[] digest = lastDigest;
if (digest == null)
return "incomplete";
StringBuffer buf = new StringBuffer();
int len = digest.length;
for (int i = 0; i < len; ++i)
{
byte b = digest[i];
byte high = (byte) ((b & 0xff) >>> 4);
byte low = (byte) (b & 0xf);
buf.append(high > 9 ? ('a' - 10) + high : '0' + high);
buf.append(low > 9 ? ('a' - 10) + low : '0' + low);
}
return buf.toString();
}
}
|