libjava/classpath/gnu/java/security/hash/Sha384.java

   1 /* Sha384.java --
   2    Copyright (C) 2003, 2006 Free Software Foundation, Inc.
   3
   4 This file is a part of GNU Classpath.
   5
   6 GNU Classpath is free software; you can redistribute it and/or modify
   7 it under the terms of the GNU General Public License as published by
   8 the Free Software Foundation; either version 2 of the License, or (at
   9 your option) any later version.
  10
  11 GNU Classpath is distributed in the hope that it will be useful, but
  12 WITHOUT ANY WARRANTY; without even the implied warranty of
  13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14 General Public License for more details.
  15
  16 You should have received a copy of the GNU General Public License
  17 along with GNU Classpath; if not, write to the Free Software
  18 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
  19 USA
  20
  21 Linking this library statically or dynamically with other modules is
  22 making a combined work based on this library.  Thus, the terms and
  23 conditions of the GNU General Public License cover the whole
  24 combination.
  25
  26 As a special exception, the copyright holders of this library give you
  27 permission to link this library with independent modules to produce an
  28 executable, regardless of the license terms of these independent
  29 modules, and to copy and distribute the resulting executable under
  30 terms of your choice, provided that you also meet, for each linked
  31 independent module, the terms and conditions of the license of that
  32 module.  An independent module is a module which is not derived from
  33 or based on this library.  If you modify this library, you may extend
  34 this exception to your version of the library, but you are not
  35 obligated to do so.  If you do not wish to do so, delete this
  36 exception statement from your version.  */
  37
  38
  39 package gnu.java.security.hash;
  40
  41 import gnu.java.security.Registry;
  42 import gnu.java.security.util.Util;
  43
  44 /**
  45  * <p>Implementation of SHA2-2 [SHA-384] per the IETF Draft Specification.</p>
  46  *
  47  * <p>References:</p>
  48  * <ol>
  49  *    <li><a href="http://ftp.ipv4.heanet.ie/pub/ietf/internet-drafts/draft-ietf-ipsec-ciph-aes-cbc-03.txt">
  50  *    Descriptions of SHA-256, SHA-384, and SHA-512</a>,</li>
  51  *    <li>http://csrc.nist.gov/cryptval/shs/sha256-384-512.pdf</li>
  52  * </ol>
  53  */
  54 public class Sha384 extends BaseHash
  55 {
  56
  57   // Constants and variables
  58   // -------------------------------------------------------------------------
  59
  60   private static final long[] k = { 0x428a2f98d728ae22L, 0x7137449123ef65cdL,
  61                                    0xb5c0fbcfec4d3b2fL, 0xe9b5dba58189dbbcL,
  62                                    0x3956c25bf348b538L, 0x59f111f1b605d019L,
  63                                    0x923f82a4af194f9bL, 0xab1c5ed5da6d8118L,
  64                                    0xd807aa98a3030242L, 0x12835b0145706fbeL,
  65                                    0x243185be4ee4b28cL, 0x550c7dc3d5ffb4e2L,
  66                                    0x72be5d74f27b896fL, 0x80deb1fe3b1696b1L,
  67                                    0x9bdc06a725c71235L, 0xc19bf174cf692694L,
  68                                    0xe49b69c19ef14ad2L, 0xefbe4786384f25e3L,
  69                                    0x0fc19dc68b8cd5b5L, 0x240ca1cc77ac9c65L,
  70                                    0x2de92c6f592b0275L, 0x4a7484aa6ea6e483L,
  71                                    0x5cb0a9dcbd41fbd4L, 0x76f988da831153b5L,
  72                                    0x983e5152ee66dfabL, 0xa831c66d2db43210L,
  73                                    0xb00327c898fb213fL, 0xbf597fc7beef0ee4L,
  74                                    0xc6e00bf33da88fc2L, 0xd5a79147930aa725L,
  75                                    0x06ca6351e003826fL, 0x142929670a0e6e70L,
  76                                    0x27b70a8546d22ffcL, 0x2e1b21385c26c926L,
  77                                    0x4d2c6dfc5ac42aedL, 0x53380d139d95b3dfL,
  78                                    0x650a73548baf63deL, 0x766a0abb3c77b2a8L,
  79                                    0x81c2c92e47edaee6L, 0x92722c851482353bL,
  80                                    0xa2bfe8a14cf10364L, 0xa81a664bbc423001L,
  81                                    0xc24b8b70d0f89791L, 0xc76c51a30654be30L,
  82                                    0xd192e819d6ef5218L, 0xd69906245565a910L,
  83                                    0xf40e35855771202aL, 0x106aa07032bbd1b8L,
  84                                    0x19a4c116b8d2d0c8L, 0x1e376c085141ab53L,
  85                                    0x2748774cdf8eeb99L, 0x34b0bcb5e19b48a8L,
  86                                    0x391c0cb3c5c95a63L, 0x4ed8aa4ae3418acbL,
  87                                    0x5b9cca4f7763e373L, 0x682e6ff3d6b2b8a3L,
  88                                    0x748f82ee5defb2fcL, 0x78a5636f43172f60L,
  89                                    0x84c87814a1f0ab72L, 0x8cc702081a6439ecL,
  90                                    0x90befffa23631e28L, 0xa4506cebde82bde9L,
  91                                    0xbef9a3f7b2c67915L, 0xc67178f2e372532bL,
  92                                    0xca273eceea26619cL, 0xd186b8c721c0c207L,
  93                                    0xeada7dd6cde0eb1eL, 0xf57d4f7fee6ed178L,
  94                                    0x06f067aa72176fbaL, 0x0a637dc5a2c898a6L,
  95                                    0x113f9804bef90daeL, 0x1b710b35131c471bL,
  96                                    0x28db77f523047d84L, 0x32caab7b40c72493L,
  97                                    0x3c9ebe0a15c9bebcL, 0x431d67c49c100d4cL,
  98                                    0x4cc5d4becb3e42b6L, 0x597f299cfc657e2aL,
  99                                    0x5fcb6fab3ad6faecL, 0x6c44198c4a475817L };
 100
 101   private static final int BLOCK_SIZE = 128; // inner block size in bytes
 102
 103   private static final String DIGEST0 = "CB00753F45A35E8BB5A03D699AC65007272C32AB0EDED1631A8B605A43FF5BED"
 104                                         + "8086072BA1E7CC2358BAECA134C825A7";
 105
 106   private static final long[] w = new long[80];
 107
 108   /** caches the result of the correctness test, once executed. */
 109   private static Boolean valid;
 110
 111   /** 512-bit interim result. */
 112   private long h0, h1, h2, h3, h4, h5, h6, h7;
 113
 114   // Constructor(s)
 115   // -------------------------------------------------------------------------
 116
 117   /** Trivial 0-arguments constructor. */
 118   public Sha384()
 119   {
 120     super(Registry.SHA384_HASH, 48, BLOCK_SIZE);
 121   }
 122
 123   /**
 124    * <p>Private constructor for cloning purposes.</p>
 125    *
 126    * @param md the instance to clone.
 127    */
 128   private Sha384(Sha384 md)
 129   {
 130     this();
 131
 132     this.h0 = md.h0;
 133     this.h1 = md.h1;
 134     this.h2 = md.h2;
 135     this.h3 = md.h3;
 136     this.h4 = md.h4;
 137     this.h5 = md.h5;
 138     this.h6 = md.h6;
 139     this.h7 = md.h7;
 140     this.count = md.count;
 141     this.buffer = (byte[]) md.buffer.clone();
 142   }
 143
 144   // Class methods
 145   // -------------------------------------------------------------------------
 146
 147   public static final long[] G(long hh0, long hh1, long hh2, long hh3,
 148                                long hh4, long hh5, long hh6, long hh7,
 149                                byte[] in, int offset)
 150   {
 151     return sha(hh0, hh1, hh2, hh3, hh4, hh5, hh6, hh7, in, offset);
 152   }
 153
 154   // Instance methods
 155   // -------------------------------------------------------------------------
 156
 157   // java.lang.Cloneable interface implementation ----------------------------
 158
 159   public Object clone()
 160   {
 161     return new Sha384(this);
 162   }
 163
 164   // Implementation of concrete methods in BaseHash --------------------------
 165
 166   protected void transform(byte[] in, int offset)
 167   {
 168     long[] result = sha(h0, h1, h2, h3, h4, h5, h6, h7, in, offset);
 169
 170     h0 = result[0];
 171     h1 = result[1];
 172     h2 = result[2];
 173     h3 = result[3];
 174     h4 = result[4];
 175     h5 = result[5];
 176     h6 = result[6];
 177     h7 = result[7];
 178   }
 179
 180   protected byte[] padBuffer()
 181   {
 182     int n = (int) (count % BLOCK_SIZE);
 183     int padding = (n < 112) ? (112 - n) : (240 - n);
 184     byte[] result = new byte[padding + 16];
 185
 186     // padding is always binary 1 followed by binary 0s
 187     result[0] = (byte) 0x80;
 188
 189     // save number of bits, casting the long to an array of 8 bytes
 190     // TODO: FIX Only ~35 bits of 128 bit counter usable this way
 191     long bits = count << 3;
 192     padding += 8;
 193     result[padding++] = (byte) (bits >>> 56);
 194     result[padding++] = (byte) (bits >>> 48);
 195     result[padding++] = (byte) (bits >>> 40);
 196     result[padding++] = (byte) (bits >>> 32);
 197     result[padding++] = (byte) (bits >>> 24);
 198     result[padding++] = (byte) (bits >>> 16);
 199     result[padding++] = (byte) (bits >>> 8);
 200     result[padding] = (byte) bits;
 201
 202     return result;
 203   }
 204
 205   protected byte[] getResult()
 206   {
 207     return new byte[] { (byte) (h0 >>> 56), (byte) (h0 >>> 48),
 208                        (byte) (h0 >>> 40), (byte) (h0 >>> 32),
 209                        (byte) (h0 >>> 24), (byte) (h0 >>> 16),
 210                        (byte) (h0 >>> 8), (byte) h0, (byte) (h1 >>> 56),
 211                        (byte) (h1 >>> 48), (byte) (h1 >>> 40),
 212                        (byte) (h1 >>> 32), (byte) (h1 >>> 24),
 213                        (byte) (h1 >>> 16), (byte) (h1 >>> 8), (byte) h1,
 214                        (byte) (h2 >>> 56), (byte) (h2 >>> 48),
 215                        (byte) (h2 >>> 40), (byte) (h2 >>> 32),
 216                        (byte) (h2 >>> 24), (byte) (h2 >>> 16),
 217                        (byte) (h2 >>> 8), (byte) h2, (byte) (h3 >>> 56),
 218                        (byte) (h3 >>> 48), (byte) (h3 >>> 40),
 219                        (byte) (h3 >>> 32), (byte) (h3 >>> 24),
 220                        (byte) (h3 >>> 16), (byte) (h3 >>> 8), (byte) h3,
 221                        (byte) (h4 >>> 56), (byte) (h4 >>> 48),
 222                        (byte) (h4 >>> 40), (byte) (h4 >>> 32),
 223                        (byte) (h4 >>> 24), (byte) (h4 >>> 16),
 224                        (byte) (h4 >>> 8), (byte) h4, (byte) (h5 >>> 56),
 225                        (byte) (h5 >>> 48), (byte) (h5 >>> 40),
 226                        (byte) (h5 >>> 32), (byte) (h5 >>> 24),
 227                        (byte) (h5 >>> 16), (byte) (h5 >>> 8), (byte) h5
 228     //         (byte)(h6 >>> 56), (byte)(h6 >>> 48), (byte)(h6 >>> 40), (byte)(h6 >>> 32),
 229     //         (byte)(h6 >>> 24), (byte)(h6 >>> 16), (byte)(h6 >>>  8), (byte) h6,
 230     //         (byte)(h7 >>> 56), (byte)(h7 >>> 48), (byte)(h7 >>> 40), (byte)(h7 >>> 32),
 231     //         (byte)(h7 >>> 24), (byte)(h7 >>> 16), (byte)(h7 >>>  8), (byte) h7
 232     };
 233   }
 234
 235   protected void resetContext()
 236   {
 237     // magic SHA-384 initialisation constants
 238     h0 = 0xcbbb9d5dc1059ed8L;
 239     h1 = 0x629a292a367cd507L;
 240     h2 = 0x9159015a3070dd17L;
 241     h3 = 0x152fecd8f70e5939L;
 242     h4 = 0x67332667ffc00b31L;
 243     h5 = 0x8eb44a8768581511L;
 244     h6 = 0xdb0c2e0d64f98fa7L;
 245     h7 = 0x47b5481dbefa4fa4L;
 246   }
 247
 248   public boolean selfTest()
 249   {
 250     if (valid == null)
 251       {
 252         Sha384 md = new Sha384();
 253         md.update((byte) 0x61); // a
 254         md.update((byte) 0x62); // b
 255         md.update((byte) 0x63); // c
 256         String result = Util.toString(md.digest());
 257         valid = Boolean.valueOf(DIGEST0.equals(result));
 258       }
 259     return valid.booleanValue();
 260   }
 261
 262   // SHA specific methods ----------------------------------------------------
 263
 264   private static final synchronized long[] sha(long hh0, long hh1, long hh2,
 265                                                long hh3, long hh4, long hh5,
 266                                                long hh6, long hh7, byte[] in,
 267                                                int offset)
 268   {
 269     long A = hh0;
 270     long B = hh1;
 271     long C = hh2;
 272     long D = hh3;
 273     long E = hh4;
 274     long F = hh5;
 275     long G = hh6;
 276     long H = hh7;
 277     long T, T2;
 278     int r;
 279
 280     for (r = 0; r < 16; r++)
 281       {
 282         w[r] = (long) in[offset++] << 56 | ((long) in[offset++] & 0xFF) << 48
 283                | ((long) in[offset++] & 0xFF) << 40
 284                | ((long) in[offset++] & 0xFF) << 32
 285                | ((long) in[offset++] & 0xFF) << 24
 286                | ((long) in[offset++] & 0xFF) << 16
 287                | ((long) in[offset++] & 0xFF) << 8
 288                | ((long) in[offset++] & 0xFF);
 289       }
 290     for (r = 16; r < 80; r++)
 291       {
 292         T = w[r - 2];
 293         T2 = w[r - 15];
 294         w[r] = (((T >>> 19) | (T << 45)) ^ ((T >>> 61) | (T << 3)) ^ (T >>> 6))
 295                + w[r - 7]
 296                + (((T2 >>> 1) | (T2 << 63)) ^ ((T2 >>> 8) | (T2 << 56)) ^ (T2 >>> 7))
 297                + w[r - 16];
 298       }
 299
 300     for (r = 0; r < 80; r++)
 301       {
 302
 303         T = H
 304             + (((E >>> 14) | (E << 50)) ^ ((E >>> 18) | (E << 46)) ^ ((E >>> 41) | (E << 23)))
 305             + ((E & F) ^ ((~E) & G)) + k[r] + w[r];
 306         // T IS INCORRECT SOMEHOW
 307         T2 = (((A >>> 28) | (A << 36)) ^ ((A >>> 34) | (A << 30)) ^ ((A >>> 39) | (A << 25)))
 308              + ((A & B) ^ (A & C) ^ (B & C));
 309         H = G;
 310         G = F;
 311         F = E;
 312         E = D + T;
 313         D = C;
 314         C = B;
 315         B = A;
 316         A = T + T2;
 317       }
 318
 319     return new long[] { hh0 + A, hh1 + B, hh2 + C, hh3 + D, hh4 + E, hh5 + F,
 320                        hh6 + G, hh7 + H };
 321   }
 322 }