/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/ |
H A D | StreamBlockCipher.java | 58 * @param in the byte to be processed. 62 byte in) 64 oneByte[0] = in; 72 * process a block of bytes from in putting the result into out. 74 * @param in the input byte array. 75 * @param inOff the offset into the in array where the data to be processed starts. 82 byte[] in, 91 throw new DataLengthException("output buffer too small in processBytes()"); 96 cipher.processBlock(in, inOff + i, out, outOff + i); 101 * reset the underlying cipher. This leaves it in th 61 returnByte( byte in) argument 81 processBytes( byte[] in, int inOff, int len, byte[] out, int outOff) argument [all...] |
H A D | StreamCipher.java | 30 * @param in the byte to be processed. 33 public byte returnByte(byte in); argument 36 * process a block of bytes from in putting the result into out. 38 * @param in the input byte array. 39 * @param inOff the offset into the in array where the data to be processed starts. 45 public void processBytes(byte[] in, int inOff, int len, byte[] out, int outOff) argument 49 * reset the cipher. This leaves it in the same state
|
H A D | Wrapper.java | 14 public byte[] wrap(byte[] in, int inOff, int inLen); argument 16 public byte[] unwrap(byte[] in, int inOff, int inLen) argument
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/digests/ |
H A D | GeneralDigest.java | 7 * base implementation of MD4 family style digest as outlined in 29 * Copy constructor. We are using copy constructors in place 49 byte in) 51 xBuf[xBufOff++] = in; 63 byte[] in, 72 update(in[inOff]); 83 processWord(in, inOff); 91 // load in the remainder. 95 update(in[inOff]); 137 protected abstract void processWord(byte[] in, in argument 48 update( byte in) argument 62 update( byte[] in, int inOff, int len) argument [all...] |
H A D | LongDigest.java | 38 * Copy constructor. We are using copy constructors in place 71 byte in) 73 xBuf[xBufOff++] = in; 85 byte[] in, 94 update(in[inOff]); 105 processWord(in, inOff); 113 // load in the remainder. 117 update(in[inOff]); 170 byte[] in, 173 W[wOff] = Pack.bigEndianToLong(in, inOf 70 update( byte in) argument 84 update( byte[] in, int inOff, int len) argument 169 processWord( byte[] in, int inOff) argument [all...] |
H A D | MD5Digest.java | 7 * implementation of MD5 as outlined in "Handbook of Applied Cryptography", pages 346 - 347. 62 byte[] in, 65 X[xOff++] = (in[inOff] & 0xff) | ((in[inOff + 1] & 0xff) << 8) 66 | ((in[inOff + 2] & 0xff) << 16) | ((in[inOff + 3] & 0xff) << 24); 61 processWord( byte[] in, int inOff) argument
|
H A D | NullDigest.java | 23 public void update(byte in) argument 25 bOut.write(in); 28 public void update(byte[] in, int inOff, int len) argument 30 bOut.write(in, inOff, len);
|
H A D | OpenSSLDigest.java | 5 * you may not use this file except in compliance with the License. 10 * Unless required by applicable law or agreed to in writing, software 58 public void update(byte in) { argument 59 delegate.update(in); 62 public void update(byte[] in, int inOff, int len) { argument 63 delegate.update(in, inOff, len);
|
H A D | SHA1Digest.java | 7 * implementation of SHA-1 as outlined in "Handbook of Applied Cryptography", pages 346 - 349. 64 byte[] in, 68 // X[xOff] = Pack.bigEndianToInt(in, inOff); 69 int n = in[ inOff] << 24; 70 n |= (in[++inOff] & 0xff) << 16; 71 n |= (in[++inOff] & 0xff) << 8; 72 n |= (in[++inOff] & 0xff); 63 processWord( byte[] in, int inOff) argument
|
H A D | SHA224Digest.java | 9 * SHA-224 as described in RFC 3874 76 byte[] in, 80 // X[xOff] = Pack.bigEndianToInt(in, inOff); 81 int n = in[ inOff] << 24; 82 n |= (in[++inOff] & 0xff) << 16; 83 n |= (in[++inOff] & 0xff) << 8; 84 n |= (in[++inOff] & 0xff); 75 processWord( byte[] in, int inOff) argument
|
H A D | SHA256Digest.java | 76 byte[] in, 80 // X[xOff] = Pack.bigEndianToInt(in, inOff); 81 int n = in[inOff] << 24; 82 n |= (in[++inOff] & 0xff) << 16; 83 n |= (in[++inOff] & 0xff) << 8; 84 n |= (in[++inOff] & 0xff); 75 processWord( byte[] in, int inOff) argument
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/encodings/ |
H A D | OAEPEncoding.java | 124 byte[] in, 131 return encodeBlock(in, inOff, inLen); 135 return decodeBlock(in, inOff, inLen); 140 byte[] in, 148 // copy in the message 150 System.arraycopy(in, inOff, block, block.length - inLen, inLen); 184 // add in the seed 207 byte[] in, 212 byte[] data = engine.processBlock(in, inOff, inLen); 216 // as we may have zeros in ou 123 processBlock( byte[] in, int inOff, int inLen) argument 139 encodeBlock( byte[] in, int inOff, int inLen) argument 206 decodeBlock( byte[] in, int inOff, int inLen) argument [all...] |
H A D | PKCS1Encoding.java | 21 * some providers fail to include the leading zero in PKCS1 encoded blocks. If you need to 125 byte[] in, 132 return encodeBlock(in, inOff, inLen); 136 return decodeBlock(in, inOff, inLen); 141 byte[] in, 182 System.arraycopy(in, inOff, block, block.length - inLen, inLen); 188 * @exception InvalidCipherTextException if the decrypted block is not in PKCS1 format. 191 byte[] in, 196 byte[] block = engine.processBlock(in, inOff, inLen); 254 throw new InvalidCipherTextException("no data in bloc 124 processBlock( byte[] in, int inOff, int inLen) argument 140 encodeBlock( byte[] in, int inOff, int inLen) argument 190 decodeBlock( byte[] in, int inOff, int inLen) argument [all...] |
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
H A D | AESEngine.java | 24 * adding 12 rotate operations per round to compute the values contained in the other tables from 27 * The slowest version uses no static tables at all and computes the values in each round. 107 // vector used in calculating key schedule (powers of x in GF(256)) 228 /* multiply four bytes in GF(2^8) by 'x' {02} in parallel */ 274 int KC = key.length / 4; // key length in words 283 int[][] W = new int[ROUNDS+1][4]; // 4 words in a block 379 byte[] in, 389 if ((inOff + (32 / 2)) > in 378 processBlock( byte[] in, int inOff, byte[] out, int outOff) argument [all...] |
H A D | AESFastEngine.java | 24 * adding 12 rotate operations per round to compute the values contained in the other tables from 27 * The slowest version uses no static tables at all and computes the values in each round 107 // vector used in calculating key schedule (powers of x in GF(256)) 558 /* multiply four bytes in GF(2^8) by 'x' {02} in parallel */ 605 int KC = key.length / 4; // key length in words 614 int[][] W = new int[ROUNDS+1][4]; // 4 words in a block 710 byte[] in, 720 if ((inOff + (32 / 2)) > in 709 processBlock( byte[] in, int inOff, byte[] out, int outOff) argument [all...] |
H A D | BlowfishEngine.java | 350 byte[] in, 360 if ((inOff + BLOCK_SIZE) > in.length) 372 encryptBlock(in, inOff, out, outOff); 376 decryptBlock(in, inOff, out, outOff); 402 * apply the encryption cycle to each value pair in the table. 461 // get the 32 bits of the key, in 4 * 8 bit chunks 481 * the subkeys described in (1) and (2) 495 * and then all four S-boxes in order, with the output of the 508 * the result in the provided buffer starting at the given offset. 536 * the result in th 349 processBlock( byte[] in, int inOff, byte[] out, int outOff) argument 570 Bits32ToBytes(int in, byte[] b, int offset) argument [all...] |
H A D | DESEngine.java | 65 byte[] in, 75 if ((inOff + BLOCK_SIZE) > in.length) 85 desFunc(workingKey, in, inOff, out, outOff); 123 * Use the key schedule specified in the Standard (ANSI X3.92-1981). 403 byte[] in, 410 left = (in[inOff + 0] & 0xff) << 24; 411 left |= (in[inOff + 1] & 0xff) << 16; 412 left |= (in[inOff + 2] & 0xff) << 8; 413 left |= (in[inOff + 3] & 0xff); 415 right = (in[inOf 64 processBlock( byte[] in, int inOff, byte[] out, int outOff) argument 401 desFunc( int[] wKey, byte[] in, int inOff, byte[] out, int outOff) argument [all...] |
H A D | DESedeEngine.java | 86 byte[] in, 96 if ((inOff + BLOCK_SIZE) > in.length) 110 desFunc(workingKey1, in, inOff, temp, 0); 116 desFunc(workingKey3, in, inOff, temp, 0); 85 processBlock( byte[] in, int inOff, byte[] out, int outOff) argument
|
H A D | DESedeWrapEngine.java | 135 * @param in 140 public byte[] wrap(byte[] in, int inOff, int inLen) argument 149 System.arraycopy(in, inOff, keyToBeWrapped, 0, inLen); 160 // Encrypt WKCKS in CBC mode using KEK as the key and IV as the 185 // Reverse the order of the octets in TEMP2 and call the result TEMP3. 188 // Encrypt TEMP3 in CBC mode using the KEK and an initialization vector 206 * @param in 212 public byte[] unwrap(byte[] in, int inOff, int inLen) argument 220 if (in == null) 247 // Decrypt the cipher text with TRIPLedeS in CB [all...] |
H A D | RC2Engine.java | 11 * an implementation of RC2 as described in RFC 2268 101 // Phase 3 - copy to newKey in little-endian order 161 byte[] in, 171 if ((inOff + BLOCK_SIZE) > in.length) 183 encryptBlock(in, inOff, out, outOff); 187 decryptBlock(in, inOff, out, outOff); 194 * return the result rotating the 16 bit number in x left by y 205 byte[] in, 212 x76 = ((in[inOff + 7] & 0xff) << 8) + (in[inOf 160 processBlock( byte[] in, int inOff, byte[] out, int outOff) argument 204 encryptBlock( byte[] in, int inOff, byte[] out, int outOff) argument 261 decryptBlock( byte[] in, int inOff, byte[] out, int outOff) argument [all...] |
H A D | RC4Engine.java | 57 public byte returnByte(byte in) argument 68 return (byte)(in ^ engineState[(engineState[x] + engineState[y]) & 0xff]); 72 byte[] in, 78 if ((inOff + len) > in.length) 99 out[i+outOff] = (byte)(in[i + inOff] 71 processBytes( byte[] in, int inOff, int len, byte[] out, int outOff) argument
|
H A D | RFC3394WrapEngine.java | 15 * Specification as described in RFC 3394. 68 byte[] in, 88 System.arraycopy(in, inOff, block, iv.length, inLen); 119 byte[] in, 140 System.arraycopy(in, inOff, a, 0, iv.length); 141 System.arraycopy(in, inOff + iv.length, block, 0, inLen - iv.length); 67 wrap( byte[] in, int inOff, int inLen) argument 118 unwrap( byte[] in, int inOff, int inLen) argument
|
H A D | RSABlindedEngine.java | 79 * @param in the input array. 86 byte[] in, 95 BigInteger input = core.convertInput(in, inOff, inLen); 85 processBlock( byte[] in, int inOff, int inLen) argument
|
H A D | RSACoreEngine.java | 86 byte[] in, 101 if (inOff != 0 || inLen != in.length) 105 System.arraycopy(in, inOff, block, 0, inLen); 109 block = in; 189 h = h.mod(p); // mod (in Java) returns the positive residual 85 convertInput( byte[] in, int inOff, int inLen) argument
|
H A D | TwofishEngine.java | 153 * Define the fixed p0/p1 permutations used in keyed S-box lookup. 155 * automatically get changed in the Twofish engine. 215 * gSubKeys[] and gSBox[] are eventually used in the 290 byte[] in, 300 if ((inOff + BLOCK_SIZE) > in.length) 312 encryptBlock(in, inOff, out, outOff); 316 decryptBlock(in, inOff, out, outOff); 359 * that are in the input key. The input key is a 439 * the result in the provided buffer starting at the given offset. 481 * the result in th 289 processBlock( byte[] in, int inOff, byte[] out, int outOff) argument 673 Bits32ToBytes(int in, byte[] b, int offset) argument [all...] |