69 lines
2.5 KiB
Java
69 lines
2.5 KiB
Java
|
package org.bouncycastle.jce.provider;
|
||
|
|
|
||
|
|
import org.bouncycastle.crypto.DataLengthException;
|
||
|
|
import org.bouncycastle.crypto.DerivationFunction;
|
||
|
|
import org.bouncycastle.crypto.DerivationParameters;
|
||
|
|
import org.bouncycastle.crypto.Digest;
|
||
|
|
import org.bouncycastle.crypto.params.KDFParameters;
|
||
|
|
|
||
|
|
/* loaded from: classes6.dex */
|
||
|
|
public class BrokenKDF2BytesGenerator implements DerivationFunction {
|
||
|
|
private Digest digest;
|
||
|
|
private byte[] iv;
|
||
|
|
private byte[] shared;
|
||
|
|
|
||
|
|
@Override // org.bouncycastle.crypto.DerivationFunction
|
||
|
|
public void init(DerivationParameters derivationParameters) {
|
||
|
|
if (!(derivationParameters instanceof KDFParameters)) {
|
||
|
|
throw new IllegalArgumentException("KDF parameters required for generator");
|
||
|
|
}
|
||
|
|
KDFParameters kDFParameters = (KDFParameters) derivationParameters;
|
||
|
|
this.shared = kDFParameters.getSharedSecret();
|
||
|
|
this.iv = kDFParameters.getIV();
|
||
|
|
}
|
||
|
|
|
||
|
|
public Digest getDigest() {
|
||
|
|
return this.digest;
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // org.bouncycastle.crypto.DerivationFunction
|
||
|
|
public int generateBytes(byte[] bArr, int i, int i2) throws DataLengthException, IllegalArgumentException {
|
||
|
|
if (bArr.length - i2 < i) {
|
||
|
|
throw new DataLengthException("output buffer too small");
|
||
|
|
}
|
||
|
|
long j = i2 << 3;
|
||
|
|
if (j > (this.digest.getDigestSize() << 3) * 29) {
|
||
|
|
new IllegalArgumentException("Output length to large");
|
||
|
|
}
|
||
|
|
int digestSize = (int) (j / this.digest.getDigestSize());
|
||
|
|
int digestSize2 = this.digest.getDigestSize();
|
||
|
|
byte[] bArr2 = new byte[digestSize2];
|
||
|
|
for (int i3 = 1; i3 <= digestSize; i3++) {
|
||
|
|
Digest digest = this.digest;
|
||
|
|
byte[] bArr3 = this.shared;
|
||
|
|
digest.update(bArr3, 0, bArr3.length);
|
||
|
|
this.digest.update((byte) i3);
|
||
|
|
this.digest.update((byte) (i3 >> 8));
|
||
|
|
this.digest.update((byte) (i3 >> 16));
|
||
|
|
this.digest.update((byte) (i3 >>> 24));
|
||
|
|
Digest digest2 = this.digest;
|
||
|
|
byte[] bArr4 = this.iv;
|
||
|
|
digest2.update(bArr4, 0, bArr4.length);
|
||
|
|
this.digest.doFinal(bArr2, 0);
|
||
|
|
int i4 = i2 - i;
|
||
|
|
if (i4 > digestSize2) {
|
||
|
|
System.arraycopy(bArr2, 0, bArr, i, digestSize2);
|
||
|
|
i += digestSize2;
|
||
|
|
} else {
|
||
|
|
System.arraycopy(bArr2, 0, bArr, i, i4);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
this.digest.reset();
|
||
|
|
return i2;
|
||
|
|
}
|
||
|
|
|
||
|
|
public BrokenKDF2BytesGenerator(Digest digest) {
|
||
|
|
this.digest = digest;
|
||
|
|
}
|
||
|
|
}
|