archive/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2025-08-26 22:34:27 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

8344766: AES/CTR slow at big payloads

Browse source 
Reviewed-by: ascarpino, jbhateja
This commit is contained in:
Volodymyr Paprotski 2024-11-27 16:05:43 +00:00 • committed by Jatin Bhateja
parent 35bd2f354e
commit 75f3ec77e4
1 changed files with 17 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

19
src/java.base/share/classes/com/sun/crypto/provider/CounterMode.java
View file

@ -1,5 +1,5 @@
/* /*
* Copyright (c) 2002, 2020, Oracle and/or its affiliates. All rights reserved. * Copyright (c) 2002, 2024, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
* *
* This code is free software; you can redistribute it and/or modify it * This code is free software; you can redistribute it and/or modify it
@ -53,6 +53,10 @@ class CounterMode extends FeedbackCipher {
// number of bytes in encryptedCounter already used up // number of bytes in encryptedCounter already used up
private int used; private int used;
// chunkSize is a multiple of block size and used to divide up
// input data to trigger the intrinsic.
private final int chunkSize;
// variables for save/restore calls // variables for save/restore calls
private byte[] counterSave = null; private byte[] counterSave = null;
private byte[] encryptedCounterSave = null; private byte[] encryptedCounterSave = null;
@ -62,6 +66,7 @@ class CounterMode extends FeedbackCipher {
super(embeddedCipher); super(embeddedCipher);
counter = new byte[blockSize]; counter = new byte[blockSize];
encryptedCounter = new byte[blockSize]; encryptedCounter = new byte[blockSize];
chunkSize = blockSize * 6400;
} }
/** /**
@ -178,7 +183,17 @@ class CounterMode extends FeedbackCipher {
ArrayUtil.nullAndBoundsCheck(in, inOff, len); ArrayUtil.nullAndBoundsCheck(in, inOff, len);
ArrayUtil.nullAndBoundsCheck(out, outOff, len); ArrayUtil.nullAndBoundsCheck(out, outOff, len);
return implCrypt(in, inOff, len, out, outOff);
int processed = 0;
for (; len > chunkSize; inOff += chunkSize, outOff += chunkSize,
len -= chunkSize) {
processed += implCrypt(in, inOff, chunkSize, out, outOff);
}
// note: above loop always leaves some data to process (more than zero,
// less than or equal to chunkSize) so this last call can be
// unconditional
processed += implCrypt(in, inOff, len, out, outOff);
return processed;
} }
// Implementation of crpyt() method. Possibly replaced with a compiler intrinsic. // Implementation of crpyt() method. Possibly replaced with a compiler intrinsic.