des.java

The Javatm Telnet Application/Applet 很好用的

/*
 * This file is part of "The Java Telnet Application".
 *
 * (c) Matthias L. Jugel, Marcus Mei遪er 1996-2002. All Rights Reserved.
 *
 * Please visit http://javatelnet.org/ for updates and contact.
 *
 * IMPORTANT NOTICE:
 * The code herein cannot be placed under GPL or any other license and
 * is provided as reference and to support DES encryption for communication
 * with some SSH servers. Please see license notice below for detailled
 * information.
 *
 * ---
 * Copyright (C) 1995-1998 Eric Young ([e-mail])
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young ([e-mail]).
 * The implementation was written so as to conform with Netscapes SSL.
 *
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson ([e-mail]).
 *
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young ([e-mail])"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson ([e-mail])"
 *
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 * ----
 */
package de.mud.ssh;

public final class DES extends Cipher {

  static {
    System.err.println("DES Cipher Copyright Eric Young.");
  }

  protected int[] key_schedule = new int[32];
  protected int IV0 = 0;
  protected int IV1 = 0;

  public synchronized void encrypt(byte[] src, int srcOff, byte[] dest, int destOff, int len) {
    int[] out = new int[2];
    int iv0 = IV0;
    int iv1 = IV1;
    int end = srcOff + len;

    for (int si = srcOff, di = destOff; si < end; si += 8, di += 8) {
      iv0 ^= ((src[si] & 0xff) | ((src[si + 1] & 0xff) << 8) |
        ((src[si + 2] & 0xff) << 16) | ((src[si + 3] & 0xff) << 24));
      iv1 ^= ((src[si + 4] & 0xff) | ((src[si + 5] & 0xff) << 8) |
        ((src[si + 6] & 0xff) << 16) | ((src[si + 7] & 0xff) << 24));
      encrypt(iv0, iv1, out);
      iv0 = out[0];
      iv1 = out[1];
      dest[di] = (byte) (iv0 & 0xff);
      dest[di + 1] = (byte) ((iv0 >>> 8) & 0xff);
      dest[di + 2] = (byte) ((iv0 >>> 16) & 0xff);
      dest[di + 3] = (byte) ((iv0 >>> 24) & 0xff);
      dest[di + 4] = (byte) (iv1 & 0xff);
      dest[di + 5] = (byte) ((iv1 >>> 8) & 0xff);
      dest[di + 6] = (byte) ((iv1 >>> 16) & 0xff);
      dest[di + 7] = (byte) ((iv1 >>> 24) & 0xff);
    }
    IV0 = iv0;
    IV1 = iv1;
  }

  public synchronized void decrypt(byte[] src, int srcOff, byte[] dest, int destOff, int len) {
    int[] out = new int[2];
    int iv0 = IV0;
    int iv1 = IV1;
    int d0;
    int d1;
    int end = srcOff + len;

    for (int si = srcOff, di = destOff; si < end; si += 8, di += 8) {
      d0 = ((src[si] & 0xff) | ((src[si + 1] & 0xff) << 8) |
        ((src[si + 2] & 0xff) << 16) | ((src[si + 3] & 0xff) << 24));
      d1 = ((src[si + 4] & 0xff) | ((src[si + 5] & 0xff) << 8) |
        ((src[si + 6] & 0xff) << 16) | ((src[si + 7] & 0xff) << 24));
      decrypt(d0, d1, out);
      iv0 ^= out[0];
      iv1 ^= out[1];
      dest[di] = (byte) (iv0 & 0xff);
      dest[di + 1] = (byte) ((iv0 >>> 8) & 0xff);
      dest[di + 2] = (byte) ((iv0 >>> 16) & 0xff);
      dest[di + 3] = (byte) ((iv0 >>> 24) & 0xff);
      dest[di + 4] = (byte) (iv1 & 0xff);
      dest[di + 5] = (byte) ((iv1 >>> 8) & 0xff);
      dest[di + 6] = (byte) ((iv1 >>> 16) & 0xff);
      dest[di + 7] = (byte) ((iv1 >>> 24) & 0xff);
      iv0 = d0;
      iv1 = d1;
    }
    IV0 = iv0;
    IV1 = iv1;
  }

  public void setKey(byte[] key) {
    int i, c, d, t, s, shifts;

    c = ((key[0] & 0xff) | ((key[1] & 0xff) << 8) |
      ((key[2] & 0xff) << 16) | ((key[3] & 0xff) << 24));
    d = ((key[4] & 0xff) | ((key[5] & 0xff) << 8) |
      ((key[6] & 0xff) << 16) | ((key[7] & 0xff) << 24));

    t = ((d >>> 4) ^ c) & 0x0f0f0f0f;
    c ^= t;
    d ^= t << 4;
    t = (((c << (16 - (-2))) ^ c) & 0xcccc0000);
    c = c ^ t ^ (t >>> (16 - (-2)));
    t = (((d << (16 - (-2))) ^ d) & 0xcccc0000);
    d = d ^ t ^ (t >>> (16 - (-2)));
    t = ((d >>> 1) ^ c) & 0x55555555;
    c ^= t;
    d ^= t << 1;
    t = ((c >>> 8) ^ d) & 0x00ff00ff;
    d ^= t;
    c ^= t << 8;
    t = ((d >>> 1) ^ c) & 0x55555555;
    c ^= t;
    d ^= t << 1;

    d = ((d & 0xff) << 16) | (d & 0xff00) |
      ((d >>> 16) & 0xff) | ((c >>> 4) & 0xf000000);
    c &= 0x0fffffff;
    shifts = 0x7efc;

    for (i = 0; i < 16; i++) {
      if ((shifts & 1) != 0) {
        c = ((c >>> 2) | (c << 26));
        d = ((d >>> 2) | (d << 26));
      } else {
        c = ((c >>> 1) | (c << 27));
        d = ((d >>> 1) | (d << 27));
      }
      shifts >>>= 1;
      c &= 0x0fffffff;
      d &= 0x0fffffff;

      s = des_skb[0][(c) & 0x3f] |
        des_skb[1][((c >>> 6) & 0x03) | ((c >>> 7) & 0x3c)] |
        des_skb[2][((c >>> 13) & 0x0f) | ((c >>> 14) & 0x30)] |
        des_skb[3][((c >>> 20) & 0x01) | ((c >>> 21) & 0x06) | ((c >>> 22) & 0x38)];

      t = des_skb[4][(d) & 0x3f] |
        des_skb[5][((d >>> 7) & 0x03) | ((d >>> 8) & 0x3c)] |
        des_skb[6][(d >>> 15) & 0x3f] |
        des_skb[7][((d >>> 21) & 0x0f) | ((d >>> 22) & 0x30)];

      key_schedule[i * 2] = ((t << 16) | (s & 0xffff));
      s = ((s >>> 16) | (t & 0xffff0000));
      key_schedule[(i * 2) + 1] = (s << 4) | (s >>> 28);
    }
  }

  public void encrypt(int l, int r, int[] out) {
    int t = 0, u = 0, i;

    t = ((r >>> 4) ^ l) & 0x0f0f0f0f;
    l ^= t;
    r ^= t << 4;
    t = ((l >>> 16) ^ r) & 0x0000ffff;
    r ^= t;
    l ^= t << 16;
    t = ((r >>> 2) ^ l) & 0x33333333;
    l ^= t;
    r ^= t << 2;
    t = ((l >>> 8) ^ r) & 0x00ff00ff;
    r ^= t;
    l ^= t << 8;
    t = ((r >>> 1) ^ l) & 0x55555555;
    l ^= t;
    r ^= t << 1;

    t = (r << 1) | (r >>> 31);
    r = (l << 1) | (l >>> 31);
    l = t;

    for (i = 0; i < 32; i += 4) {
      u = r ^ key_schedule[i];
      t = r ^ key_schedule[i + 1];
      t = ((t >>> 4) + (t << 28));
      l ^=
        (des_SPtrans[1][(t) & 0x3f] | des_SPtrans[3][(t >>> 8) & 0x3f] |
        des_SPtrans[5][(t >>> 16) & 0x3f] | des_SPtrans[7][(t >>> 24) & 0x3f] |
        des_SPtrans[0][(u) & 0x3f] | des_SPtrans[2][(u >>> 8) & 0x3f] |
        des_SPtrans[4][(u >>> 16) & 0x3f] | des_SPtrans[6][(u >>> 24) & 0x3f]);

      u = l ^ key_schedule[i + 2];
      t = l ^ key_schedule[i + 3];
      t = ((t >>> 4) + (t << 28));
      r ^=
        (des_SPtrans[1][(t) & 0x3f] | des_SPtrans[3][(t >>> 8) & 0x3f] |
        des_SPtrans[5][(t >>> 16) & 0x3f] | des_SPtrans[7][(t >>> 24) & 0x3f] |
        des_SPtrans[0][(u) & 0x3f] | des_SPtrans[2][(u >>> 8) & 0x3f] |
        des_SPtrans[4][(u >>> 16) & 0x3f] | des_SPtrans[6][(u >>> 24) & 0x3f]);
    }

    l = (l >>> 1) | (l << 31);
    r = (r >>> 1) | (r << 31);

    t = ((r >>> 1) ^ l) & 0x55555555;
    l ^= t;
    r ^= t << 1;
    t = ((l >>> 8) ^ r) & 0x00ff00ff;
    r ^= t;
    l ^= t << 8;
    t = ((r >>> 2) ^ l) & 0x33333333;
    l ^= t;
    r ^= t << 2;
    t = ((l >>> 16) ^ r) & 0x0000ffff;
    r ^= t;
    l ^= t << 16;
    t = ((r >>> 4) ^ l) & 0x0f0f0f0f;
    l ^= t;
    r ^= t << 4;

    out[0] = l;
    out[1] = r;
  }

  public void decrypt(int l, int r, int[] out) {
    int t, u, i;

    t = ((r >>> 4) ^ l) & 0x0f0f0f0f;
    l ^= t;
    r ^= t << 4;
    t = ((l >>> 16) ^ r) & 0x0000ffff;
    r ^= t;
    l ^= t << 16;
    t = ((r >>> 2) ^ l) & 0x33333333;
    l ^= t;
    r ^= t << 2;
    t = ((l >>> 8) ^ r) & 0x00ff00ff;
    r ^= t;
    l ^= t << 8;
    t = ((r >>> 1) ^ l) & 0x55555555;
    l ^= t;
    r ^= t << 1;

    t = (r << 1) | (r >>> 31);
    r = (l << 1) | (l >>> 31);
    l = t;

    for (i = 30; i > 0; i -= 4) {
      u = r ^ key_schedule[i];
      t = r ^ key_schedule[i + 1];
      t = ((t >>> 4) + (t << 28));
      l ^=
        (des_SPtrans[1][(t) & 0x3f] | des_SPtrans[3][(t >>> 8) & 0x3f] |
        des_SPtrans[5][(t >>> 16) & 0x3f] | des_SPtrans[7][(t >>> 24) & 0x3f] |
        des_SPtrans[0][(u) & 0x3f] | des_SPtrans[2][(u >>> 8) & 0x3f] |
        des_SPtrans[4][(u >>> 16) & 0x3f] | des_SPtrans[6][(u >>> 24) & 0x3f]);

      u = l ^ key_schedule[i - 2];
      t = l ^ key_schedule[i - 1];
      t = ((t >>> 4) + (t << 28));
      r ^=
        (des_SPtrans[1][(t) & 0x3f] | des_SPtrans[3][(t >>> 8) & 0x3f] |
        des_SPtrans[5][(t >>> 16) & 0x3f] | des_SPtrans[7][(t >>> 24) & 0x3f] |
        des_SPtrans[0][(u) & 0x3f] | des_SPtrans[2][(u >>> 8) & 0x3f] |
        des_SPtrans[4][(u >>> 16) & 0x3f] | des_SPtrans[6][(u >>> 24) & 0x3f]);
    }

    l = (l >>> 1) | (l << 31);
    r = (r >>> 1) | (r << 31);

    t = ((r >>> 1) ^ l) & 0x55555555;