2362N/A * Copyright (c) 2003, 2007, Oracle and/or its affiliates. All rights reserved. 0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 0N/A * This code is free software; you can redistribute it and/or modify it 0N/A * under the terms of the GNU General Public License version 2 only, as 2362N/A * published by the Free Software Foundation. Oracle designates this 0N/A * particular file as subject to the "Classpath" exception as provided 2362N/A * by Oracle in the LICENSE file that accompanied this code. 0N/A * This code is distributed in the hope that it will be useful, but WITHOUT 0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 0N/A * version 2 for more details (a copy is included in the LICENSE file that 0N/A * accompanied this code). 0N/A * You should have received a copy of the GNU General Public License version 0N/A * 2 along with this work; if not, write to the Free Software Foundation, 0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 2362N/A * or visit www.oracle.com if you need additional information or have any 0N/A * Implementation of the RC2(tm) algorithm as described in RFC 2268. 0N/A * RC2 is a 16-bit based algorithm and not particularly fast on 32/64 bit 0N/A * architectures. Also, note that although the JVM has a 16-bit integer 0N/A * type (short), all expressions are evaluated either in 32 or 64 bit 0N/A * (int or long). Expression such as "s1 = s2 + s3" are implemented by 0N/A * first promoting s2 and s3 to int, performing an int addition, and 0N/A * then demoting the result back to short to store in s1. To avoid this 0N/A * fairly slow process, we use the int type throughout and manually insert 0N/A * "& 0xffff" where necessary. 0N/A * @author Andreas Sterbenz 0N/A // PITABLE from the RFC, used in key setup 0N/A 0xd9,
0x78,
0xf9,
0xc4,
0x19,
0xdd,
0xb5,
0xed,
0N/A 0x28,
0xe9,
0xfd,
0x79,
0x4a,
0xa0,
0xd8,
0x9d,
0N/A 0xc6,
0x7e,
0x37,
0x83,
0x2b,
0x76,
0x53,
0x8e,
0N/A 0x62,
0x4c,
0x64,
0x88,
0x44,
0x8b,
0xfb,
0xa2,
0N/A 0x17,
0x9a,
0x59,
0xf5,
0x87,
0xb3,
0x4f,
0x13,
0N/A 0x61,
0x45,
0x6d,
0x8d,
0x09,
0x81,
0x7d,
0x32,
0N/A 0xbd,
0x8f,
0x40,
0xeb,
0x86,
0xb7,
0x7b,
0x0b,
0N/A 0xf0,
0x95,
0x21,
0x22,
0x5c,
0x6b,
0x4e,
0x82,
0N/A 0x54,
0xd6,
0x65,
0x93,
0xce,
0x60,
0xb2,
0x1c,
0N/A 0x73,
0x56,
0xc0,
0x14,
0xa7,
0x8c,
0xf1,
0xdc,
0N/A 0x12,
0x75,
0xca,
0x1f,
0x3b,
0xbe,
0xe4,
0xd1,
0N/A 0x42,
0x3d,
0xd4,
0x30,
0xa3,
0x3c,
0xb6,
0x26,
0N/A 0x6f,
0xbf,
0x0e,
0xda,
0x46,
0x69,
0x07,
0x57,
0N/A 0x27,
0xf2,
0x1d,
0x9b,
0xbc,
0x94,
0x43,
0x03,
0N/A 0xf8,
0x11,
0xc7,
0xf6,
0x90,
0xef,
0x3e,
0xe7,
0N/A 0x06,
0xc3,
0xd5,
0x2f,
0xc8,
0x66,
0x1e,
0xd7,
0N/A 0x08,
0xe8,
0xea,
0xde,
0x80,
0x52,
0xee,
0xf7,
0N/A 0x84,
0xaa,
0x72,
0xac,
0x35,
0x4d,
0x6a,
0x2a,
0N/A 0x96,
0x1a,
0xd2,
0x71,
0x5a,
0x15,
0x49,
0x74,
0N/A 0x4b,
0x9f,
0xd0,
0x5e,
0x04,
0x18,
0xa4,
0xec,
0N/A 0xc2,
0xe0,
0x41,
0x6e,
0x0f,
0x51,
0xcb,
0xcc,
0N/A 0x24,
0x91,
0xaf,
0x50,
0xa1,
0xf4,
0x70,
0x39,
0N/A 0x99,
0x7c,
0x3a,
0x85,
0x23,
0xb8,
0xb4,
0x7a,
0N/A 0xfc,
0x02,
0x36,
0x5b,
0x25,
0x55,
0x97,
0x31,
0N/A 0x2d,
0x5d,
0xfa,
0x98,
0xe3,
0x8a,
0x92,
0xae,
0N/A 0x05,
0xdf,
0x29,
0x10,
0x67,
0x6c,
0xba,
0xc9,
0N/A 0xd3,
0x00,
0xe6,
0xcf,
0xe1,
0x9e,
0xa8,
0x2c,
0N/A 0x63,
0x16,
0x01,
0x3f,
0x58,
0xe2,
0x89,
0xa9,
0N/A 0x0d,
0x38,
0x34,
0x1b,
0xab,
0x33,
0xff,
0xb0,
0N/A 0xbb,
0x48,
0x0c,
0x5f,
0xb9,
0xb1,
0xcd,
0x2e,
0N/A 0xc5,
0xf3,
0xdb,
0x47,
0xe5,
0xa5,
0x9c,
0x77,
0N/A 0x0a,
0xa6,
0x20,
0x68,
0xfe,
0x7f,
0xc1,
0xad,
0N/A // expanded key, 64 times 16-bit words 0N/A // effective key bits 0N/A * Initializes the effective key bit size. This method is a hook to 0N/A * allow RC2Cipher to initialize the effective key size. 0N/A (
"RC2 key length must be between 40 and 1024 bit");
0N/A // key buffer, the L[] byte array from the spec 0N/A // place key into key buffer 0N/A // second loop, reduce search space to effective key bits 0N/A for (
int i =
127 -
t8; i >=
0; i--) {
0N/A // byte to short conversion, little endian (copy into K[]) 0N/A for (
int i =
0, j =
0; i <
64; i++, j +=
2) {
0N/A * Encrypt a single block. Note that in a few places we omit a "& 0xffff" 0N/A * and allow variables to become larger than 16 bit. This still works 0N/A * because there is never a 32 bit overflow. 0N/A for (
int i =
0; i <
20; i +=
4) {
0N/A for (
int i =
20; i <
44; i +=
4) {
0N/A for (
int i =
44; i <
64; i +=
4) {
0N/A // 5 r-mixing rounds 0N/A for(
int i =
64; i >
44; i -=
4) {
0N/A // 1 r-mashing round 0N/A // 6 r-mixing rounds 0N/A for(
int i =
44; i >
20; i -=
4) {
0N/A // 1 r-mashing round 0N/A // 5 r-mixing rounds 0N/A for(
int i =
20; i >
0; i -=
4) {