File: TestCopySafe.java

package info (click to toggle)
openjdk-11 11.0.4%2B11-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 757,028 kB
  • sloc: java: 5,016,041; xml: 1,191,974; cpp: 934,731; ansic: 555,697; sh: 24,299; objc: 12,703; python: 3,602; asm: 3,415; makefile: 2,772; awk: 351; sed: 172; perl: 114; jsp: 24; csh: 3
file content (183 lines) | stat: -rw-r--r-- 6,688 bytes parent folder | download | duplicates (9)
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
/*
 * Copyright (c) 2013, 2014, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code 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
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

/*
 * @test
 * @bug 8026943 8027575
 * @summary Verify that same buffer can be used as input and output when
 * using Cipher objects.
 * @author Valerie Peng
 */
import java.security.*;
import java.security.spec.*;

import java.util.Arrays;

import javax.crypto.*;
import javax.crypto.spec.*;

public class TestCopySafe {

    private static boolean DEBUG = false;
    private static int INPUT_LENGTH = 160; // must be multiple of block size
    private static byte[] PT = new byte[INPUT_LENGTH];
    private static SecretKey KEY = new SecretKeySpec(new byte[16], "AES");
    private static byte[] IV = new byte[16];

    private static int[] OFFSETS = { 1, 8, 9, 16, 17, 32, 33 };

    private static final String[] MODES = {
        "ECB", "CBC", "PCBC", "CTR", "CTS",
        "CFB", "CFB8", "CFB16", "CFB24", "CFB32", "CFB40",
        "CFB48", "CFB56", "CFB64",
        "OFB", "OFB8", "OFB16", "OFB24", "OFB32", "OFB40",
        "OFB48", "OFB56", "OFB64",
        "GCM"
    };

    public static void main(String[] argv) throws Exception {

        Provider p = Security.getProvider("SunJCE");

        AlgorithmParameterSpec params = null;
        boolean result = true;
        for (String mode : MODES) {
            String transformation = "AES/" + mode + "/NoPadding";
            boolean isGCM = (mode == "GCM");
            if (isGCM) {
                params = new GCMParameterSpec(128, IV);
            } else if (mode != "ECB") {
                params = new IvParameterSpec(IV);
            }
            Cipher c = Cipher.getInstance(transformation, p);
            System.out.println("Testing " + transformation + ":");
            for (int offset : OFFSETS) {
                System.out.print("=> offset " + offset + ": ");
                try {
                    test(c, params, offset, isGCM);
                    System.out.println("Passed");
                } catch(Exception ex) {
                    ex.printStackTrace();
                    result = false;
                    continue;
                }
            }
        }
        if (!result) {
            throw new Exception("One or more test failed");
        }
    }

    private static void test(Cipher c, AlgorithmParameterSpec params,
        int offset, boolean isGCM) throws Exception {

        // Test encryption first
        if (isGCM) {
            // re-init with only key value first to bypass the
            // Key+IV-uniqueness check for GCM encryption
            c.init(Cipher.ENCRYPT_MODE, KEY);
        }
        c.init(Cipher.ENCRYPT_MODE, KEY, params);
        byte[] answer = c.doFinal(PT);
        byte[] pt2 = Arrays.copyOf(PT, answer.length + offset);

        // #1: outOfs = inOfs = 0
        if (isGCM) {
            c.init(Cipher.ENCRYPT_MODE, KEY);
            c.init(Cipher.ENCRYPT_MODE, KEY, params);
        }
        c.doFinal(pt2, 0, PT.length, pt2, 0);
        if (!isTwoArraysEqual(pt2, 0, answer, 0, answer.length)) {
            throw new Exception("Enc#1 diff check failed!");
        } else if (DEBUG) {
            System.out.println("Enc#1 diff check passed");
        }

        // #2: inOfs = 0, outOfs = offset
        System.arraycopy(PT, 0, pt2, 0, PT.length);
        if (isGCM) {
            c.init(Cipher.ENCRYPT_MODE, KEY);
            c.init(Cipher.ENCRYPT_MODE, KEY, params);
        }
        c.doFinal(pt2, 0, PT.length, pt2, offset);
        if (!isTwoArraysEqual(pt2, offset, answer, 0, answer.length)) {
            throw new Exception("Enc#2 diff check failed");
        } else if (DEBUG) {
            System.out.println("Enc#2 diff check passed");
        }

        // #3: inOfs = offset, outOfs = 0
        System.arraycopy(PT, 0, pt2, offset, PT.length);
        if (isGCM) {
            c.init(Cipher.ENCRYPT_MODE, KEY);
            c.init(Cipher.ENCRYPT_MODE, KEY, params);
        }
        c.doFinal(pt2, offset, PT.length, pt2, 0);
        if (!isTwoArraysEqual(pt2, 0, answer, 0, answer.length)) {
            throw new Exception("Enc#3 diff check failed");
        } else if (DEBUG) {
            System.out.println("Enc#3 diff check passed");
        }

       // Test decryption now, we should get back PT as a result
        c.init(Cipher.DECRYPT_MODE, KEY, params);
        pt2 = Arrays.copyOf(answer, answer.length + offset);

        // #1: outOfs = inOfs = 0
        c.doFinal(pt2, 0, answer.length, pt2, 0);
        if (!isTwoArraysEqual(pt2, 0, PT, 0, PT.length)) {
            throw new Exception("Dec#1 diff check failed!");
        } else if (DEBUG) {
            System.out.println("Dec#1 diff check passed");
        }

        // #2: inOfs = 0, outOfs = offset
        System.arraycopy(answer, 0, pt2, 0, answer.length);
        c.doFinal(pt2, 0, answer.length, pt2, offset);
        if (!isTwoArraysEqual(pt2, offset, PT, 0, PT.length)) {
            throw new Exception("Dec#2 diff check failed");
        } else if (DEBUG) {
            System.out.println("Dec#2 diff check passed");
        }

        // #3: inOfs = offset, outOfs = 0
        System.arraycopy(answer, 0, pt2, offset, answer.length);
        c.doFinal(pt2, offset, answer.length, pt2, 0);
        if (!isTwoArraysEqual(pt2, 0, PT, 0, PT.length)) {
            throw new Exception("Dec#3 diff check failed");
        } else if (DEBUG) {
            System.out.println("Dec#3 diff check passed");
        }
    }

    private static boolean isTwoArraysEqual(byte[] a, int aOff, byte[] b, int bOff,
        int len) {
        for (int i = 0; i < len; i++) {
            if (a[aOff + i] != b[bOff + i]) {
                return false;
            }
        }
        return true;
    }
}