📄 khazad.java
字号:
/* Khazad.java -- Copyright (C) 2001, 2002, 2003, 2006 Free Software Foundation, Inc.This file is a part of GNU Classpath.GNU Classpath is free software; you can redistribute it and/or modifyit under the terms of the GNU General Public License as published bythe Free Software Foundation; either version 2 of the License, or (atyour option) any later version.GNU Classpath is distributed in the hope that it will be useful, butWITHOUT ANY WARRANTY; without even the implied warranty ofMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNUGeneral Public License for more details.You should have received a copy of the GNU General Public Licensealong with GNU Classpath; if not, write to the Free SoftwareFoundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301USALinking this library statically or dynamically with other modules ismaking a combined work based on this library. Thus, the terms andconditions of the GNU General Public License cover the wholecombination.As a special exception, the copyright holders of this library give youpermission to link this library with independent modules to produce anexecutable, regardless of the license terms of these independentmodules, and to copy and distribute the resulting executable underterms of your choice, provided that you also meet, for each linkedindependent module, the terms and conditions of the license of thatmodule. An independent module is a module which is not derived fromor based on this library. If you modify this library, you may extendthis exception to your version of the library, but you are notobligated to do so. If you do not wish to do so, delete thisexception statement from your version. */package gnu.javax.crypto.cipher;import gnu.java.security.Registry;import gnu.java.security.util.Util;//import java.io.PrintWriter;import java.security.InvalidKeyException;import java.util.ArrayList;import java.util.Collections;import java.util.Iterator;/** * <p>Khazad is a 64-bit (legacy-level) block cipher that accepts a 128-bit key. * The cipher is a uniform substitution-permutation network whose inverse only * differs from the forward operation in the key schedule. The overall cipher * design follows the Wide Trail strategy, favours component reuse, and permits * a wide variety of implementation trade-offs.</p> * * <p>References:</p> * * <ol> * <li><a href="http://planeta.terra.com.br/informatica/paulobarreto/KhazadPage.html">The * Khazad Block Cipher</a>.<br> * <a href="mailto:paulo.barreto@terra.com.br">Paulo S.L.M. Barreto</a> and * <a href="mailto:vincent.rijmen@esat.kuleuven.ac.be">Vincent Rijmen</a>.</li> * </ol> */public final class Khazad extends BaseCipher{ // Debugging methods and variables // ------------------------------------------------------------------------- // private static final String NAME = "khazad"; private static final boolean DEBUG = false; private static final int debuglevel = 9; // private static final PrintWriter err = new PrintWriter(System.out, true); // private static void debug(String s) { // err.println(">>> "+NAME+": "+s); // } // Constants and variables // ------------------------------------------------------------------------- private static final int DEFAULT_BLOCK_SIZE = 8; // in bytes private static final int DEFAULT_KEY_SIZE = 16; // in bytes private static final int R = 8; // standard number of rounds; para. 3.7 private static final String Sd = // p. 20 [KHAZAD] "\uBA54\u2F74\u53D3\uD24D\u50AC\u8DBF\u7052\u9A4C" + "\uEAD5\u97D1\u3351\u5BA6\uDE48\uA899\uDB32\uB7FC" + "\uE39E\u919B\uE2BB\u416E\uA5CB\u6B95\uA1F3\uB102" + "\uCCC4\u1D14\uC363\uDA5D\u5FDC\u7DCD\u7F5A\u6C5C" + "\uF726\uFFED\uE89D\u6F8E\u19A0\uF089\u0F07\uAFFB" + "\u0815\u0D04\u0164\uDF76\u79DD\u3D16\u3F37\u6D38" + "\uB973\uE935\u5571\u7B8C\u7288\uF62A\u3E5E\u2746" + "\u0C65\u6861\u03C1\u57D6\uD958\uD866\uD73A\uC83C" + "\uFA96\uA798\uECB8\uC7AE\u694B\uABA9\u670A\u47F2" + "\uB522\uE5EE\uBE2B\u8112\u831B\u0E23\uF545\u21CE" + "\u492C\uF9E6\uB628\u1782\u1A8B\uFE8A\u09C9\u874E" + "\uE12E\uE4E0\uEB90\uA41E\u8560\u0025\uF4F1\u940B" + "\uE775\uEF34\u31D4\uD086\u7EAD\uFD29\u303B\u9FF8" + "\uC613\u0605\uC511\u777C\u7A78\u361C\u3959\u1856" + "\uB3B0\u2420\uB292\uA3C0\u4462\u10B4\u8443\u93C2" + "\u4ABD\u8F2D\uBC9C\u6A40\uCFA2\u804F\u1FCA\uAA42"; private static final byte[] S = new byte[256]; private static final int[] T0 = new int[256]; private static final int[] T1 = new int[256]; private static final int[] T2 = new int[256]; private static final int[] T3 = new int[256]; private static final int[] T4 = new int[256]; private static final int[] T5 = new int[256]; private static final int[] T6 = new int[256]; private static final int[] T7 = new int[256]; private static final int[][] rc = new int[R + 1][2]; // round constants /** * KAT vector (from ecb_vk): * I=120 * KEY=00000000000000000000000000000100 * CT=A0C86A1BBE2CBF4C */ private static final byte[] KAT_KEY = Util.toBytesFromString("00000000000000000000000000000100"); private static final byte[] KAT_CT = Util.toBytesFromString("A0C86A1BBE2CBF4C"); /** caches the result of the correctness test, once executed. */ private static Boolean valid; // Static code - to intialise lookup tables -------------------------------- static { long time = System.currentTimeMillis(); long ROOT = 0x11d; // para. 2.1 [KHAZAD] int i, j; int s, s2, s3, s4, s5, s6, s7, s8, sb; char c; for (i = 0; i < 256; i++) { c = Sd.charAt(i >>> 1); s = ((i & 1) == 0 ? c >>> 8 : c) & 0xFF; S[i] = (byte) s; s2 = s << 1; if (s2 > 0xFF) s2 ^= ROOT; s3 = s2 ^ s; s4 = s2 << 1; if (s4 > 0xFF) s4 ^= ROOT; s5 = s4 ^ s; s6 = s4 ^ s2; s7 = s6 ^ s; s8 = s4 << 1; if (s8 > 0xFF) s8 ^= ROOT; sb = s8 ^ s2 ^ s; T0[i] = s << 24 | s3 << 16 | s4 << 8 | s5; T1[i] = s3 << 24 | s << 16 | s5 << 8 | s4; T2[i] = s4 << 24 | s5 << 16 | s << 8 | s3; T3[i] = s5 << 24 | s4 << 16 | s3 << 8 | s; T4[i] = s6 << 24 | s8 << 16 | sb << 8 | s7; T5[i] = s8 << 24 | s6 << 16 | s7 << 8 | sb; T6[i] = sb << 24 | s7 << 16 | s6 << 8 | s8; T7[i] = s7 << 24 | sb << 16 | s8 << 8 | s6; } for (i = 0, j = 0; i < R + 1; i++) { // compute round constant rc[i][0] = S[j++] << 24 | (S[j++] & 0xFF) << 16 | (S[j++] & 0xFF) << 8 | (S[j++] & 0xFF); rc[i][1] = S[j++] << 24 | (S[j++] & 0xFF) << 16 | (S[j++] & 0xFF) << 8 | (S[j++] & 0xFF); } time = System.currentTimeMillis() - time; if (DEBUG && debuglevel > 8) { System.out.println("=========="); System.out.println(); System.out.println("Static data"); System.out.println(); System.out.println(); System.out.println("T0[]:"); for (i = 0; i < 64; i++) { for (j = 0; j < 4; j++) System.out.print("0x" + Util.toString(T0[i * 4 + j]) + ", "); System.out.println(); } System.out.println(); System.out.println("T1[]:"); for (i = 0; i < 64; i++) { for (j = 0; j < 4; j++) System.out.print("0x" + Util.toString(T1[i * 4 + j]) + ", "); System.out.println(); } System.out.println(); System.out.println("T2[]:"); for (i = 0; i < 64; i++) { for (j = 0; j < 4; j++) System.out.print("0x" + Util.toString(T2[i * 4 + j]) + ", "); System.out.println(); } System.out.println(); System.out.println("T3[]:"); for (i = 0; i < 64; i++) { for (j = 0; j < 4; j++) System.out.print("0x" + Util.toString(T3[i * 4 + j]) + ", "); System.out.println(); } System.out.println(); System.out.println("T4[]:"); for (i = 0; i < 64; i++) { for (j = 0; j < 4; j++) System.out.print("0x" + Util.toString(T4[i * 4 + j]) + ", "); System.out.println(); } System.out.println(); System.out.println("T5[]:"); for (i = 0; i < 64; i++) { for (j = 0; j < 4; j++) System.out.print("0x" + Util.toString(T5[i * 4 + j]) + ", "); System.out.println(); } System.out.println(); System.out.println("T6[]:"); for (i = 0; i < 64; i++) { for (j = 0; j < 4; j++) System.out.print("0x" + Util.toString(T6[i * 4 + j]) + ", "); System.out.println(); } System.out.println(); System.out.println("T7[]:");
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -