Skip to content
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
56 changes: 31 additions & 25 deletions src/java.base/share/classes/com/sun/crypto/provider/AES_Crypt.java
Original file line number Diff line number Diff line change
Expand Up @@ -941,8 +941,9 @@ void init(boolean decrypting, String algorithm, byte[] key)
* Generate the cipher's round keys as outlined in section 5.2 of the spec.
*
* @param key [in] the symmetric key byte array.
* @param rounds [in] the number of rounds for generating the round keys.
*
* @return w the cipher round keys.
* @return the cipher round keys.
*/
private static int[] genRoundKeys(byte[] key, int rounds) {
int wLen = WB * (rounds + 1);
Expand Down Expand Up @@ -970,53 +971,58 @@ private static int[] genRoundKeys(byte[] key, int rounds) {
/**
* Generate the inverse cipher round keys.
*
* @return w1 the inverse cipher round keys.
* @param w [in] the targeted word for substitution.
* @param rounds [in] the number of rounds for generating the round keys.
*
* @return the inverse cipher round keys.
*/
private static int[] genInvRoundKeys(int[] w, int rounds) {
int kLen = w.length;;
int[] temp = new int[WB];
int[] dw = new int[kLen];
int[] dw = new int[w.length];

// Intrinsics requires the inverse key expansion to be reverse order
// except for the first and last round key as the first two round keys
// are without a mix column transform.
for (int i = 1; i < rounds; i++) {
System.arraycopy(w, i * WB, temp, 0, WB);
temp[0] = TMI0[temp[0] >>> 24] ^ TMI1[(temp[0] >> 16) & 0xFF]
^ TMI2[(temp[0] >> 8) & 0xFF] ^ TMI3[temp[0] & 0xFF];
temp[1] = TMI0[temp[1] >>> 24] ^ TMI1[(temp[1] >> 16) & 0xFF]
^ TMI2[(temp[1] >> 8) & 0xFF] ^ TMI3[temp[1] & 0xFF];
temp[2] = TMI0[temp[2] >>> 24] ^ TMI1[(temp[2] >> 16) & 0xFF]
^ TMI2[(temp[2] >> 8) & 0xFF] ^ TMI3[temp[2] & 0xFF];
temp[3] = TMI0[temp[3] >>> 24] ^ TMI1[(temp[3] >> 16) & 0xFF]
^ TMI2[(temp[3] >> 8) & 0xFF] ^ TMI3[temp[3] & 0xFF];
System.arraycopy(temp, 0, dw, kLen - (i * WB), WB);
int widx = i * WB;
int idx = w.length - widx;

dw[idx] = TMI0[w[widx] >>> 24] ^ TMI1[(w[widx] >> 16) & 0xFF]
^ TMI2[(w[widx] >> 8) & 0xFF] ^ TMI3[w[widx] & 0xFF];
dw[idx + 1] = TMI0[w[widx + 1] >>> 24]
^ TMI1[(w[widx + 1] >> 16) & 0xFF]
^ TMI2[(w[widx + 1] >> 8) & 0xFF]
^ TMI3[w[widx + 1] & 0xFF];
dw[idx + 2] = TMI0[w[widx + 2] >>> 24]
^ TMI1[(w[widx + 2] >> 16) & 0xFF]
^ TMI2[(w[widx + 2] >> 8) & 0xFF]
^ TMI3[w[widx + 2] & 0xFF];
dw[idx + 3] = TMI0[w[widx + 3] >>> 24]
^ TMI1[(w[widx + 3] >> 16) & 0xFF]
^ TMI2[(w[widx + 3] >> 8) & 0xFF]
^ TMI3[w[widx + 3] & 0xFF];
}
System.arraycopy(w, kLen - WB, dw, WB, WB);
System.arraycopy(w, w.length - WB, dw, WB, WB);
System.arraycopy(w, 0, dw, 0, WB);
Arrays.fill(temp, 0);

return dw;
}

/**
* Subtitute the word as a step of key expansion.
* Substitute the word as a step of key expansion.
*
* @param state [in] the targeted word for substituion.
* @param sub [in] the substitute table for cipher and inverse cipher.
* @param word [in] the targeted word for substitution.
*
* @return the substituted word.
*/
private static int subWord(int word) {
byte b0 = (byte) (word >>> 24);
byte b1 = (byte) ((word >> 16) & 0xFF);
byte b2 = (byte) ((word >> 8) & 0xFF);
byte b3 = (byte) (word & 0xFF);
byte b0 = (byte) (word >> 24);
byte b1 = (byte) (word >> 16);
byte b2 = (byte) (word >> 8);

return ((SBOX[(b0 & 0xF0) >> 4][b0 & 0x0F] & 0xFF) << 24)
| ((SBOX[(b1 & 0xF0) >> 4][b1 & 0x0F] & 0xFF) << 16)
| ((SBOX[(b2 & 0xF0) >> 4][b2 & 0x0F] & 0xFF) << 8)
| (SBOX[(b3 & 0xF0) >> 4][b3 & 0x0F] & 0xFF);
| (SBOX[(word & 0xF0) >> 4][word & 0x0F] & 0xFF);
}

/**
Expand Down