OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:ROUNDS
(Results
1 - 6
of
6
) sorted by null
/frameworks/base/tools/obbtool/
pbkdf2gen.cpp
33
#define
ROUNDS
1024
62
ROUNDS
, KEY_BITS, rawKey) != 1) {
/external/ipsec-tools/src/racoon/missing/crypto/rijndael/
rijndael-api-fst.h
58
int
ROUNDS
; /* key-length-dependent number of
rounds
*/
102
u_int8_t *input, int inputLen, u_int8_t *outBuffer, int
Rounds
);
/external/bouncycastle/src/main/java/org/bouncycastle/crypto/engines/
AESEngine.java
111
// precomputation tables of calculations for
rounds
283
ROUNDS
= KC + 6; // This is not always true for the generalized Rijndael that allows larger block sizes
284
int[][] W = new int[
ROUNDS
+1][4]; // 4 words in a block
303
int k = (
ROUNDS
+ 1) << 2;
321
for (int j = 1; j <
ROUNDS
; j++)
333
private int
ROUNDS
;
486
while (r <
ROUNDS
- 1)
516
C0 ^= KW[
ROUNDS
][0];
517
C1 ^= KW[
ROUNDS
][1];
518
C2 ^= KW[
ROUNDS
][2]
[
all
...]
AESFastEngine.java
111
// precomputation tables of calculations for
rounds
[
all
...]
BlowfishEngine.java
298
private static final int
ROUNDS
= 16;
301
private static final int P_SZ =
ROUNDS
+2;
414
for (int i = 1; i <
ROUNDS
; i += 2)
420
xr ^= P[
ROUNDS
+ 1];
521
for (int i = 1; i <
ROUNDS
; i += 2)
527
xr ^= P[
ROUNDS
+ 1];
547
xl ^= P[
ROUNDS
+ 1];
549
for (int i =
ROUNDS
; i > 0 ; i -= 2)
TwofishEngine.java
191
private static final int
ROUNDS
= 16;
455
for (int r = 0; r <
ROUNDS
; r +=2)
492
int k = ROUND_SUBKEYS + 2 *
ROUNDS
-1 ;
494
for (int r = 0; r<
ROUNDS
; r +=2)
Completed in 152 milliseconds