Searched refs:ROUNDS (Results 1 - 16 of 16) sorted by relevance

/external/ipsec-tools/src/racoon/missing/crypto/rijndael/
H A Drijndael-alg-fst.h19 int rijndaelKeySched(u_int8_t k[RIJNDAEL_MAXKC][4], u_int8_t rk[RIJNDAEL_MAXROUNDS+1][4][4], int ROUNDS);
21 int rijndaelKeyEncToDec(u_int8_t W[RIJNDAEL_MAXROUNDS+1][4][4], int ROUNDS);
23 int rijndaelEncrypt(u_int8_t a[16], u_int8_t b[16], u_int8_t rk[RIJNDAEL_MAXROUNDS+1][4][4], int ROUNDS);
26 int rijndaelEncryptRound(u_int8_t a[4][4], u_int8_t rk[RIJNDAEL_MAXROUNDS+1][4][4], int ROUNDS, int rounds);
29 int rijndaelDecrypt(u_int8_t a[16], u_int8_t b[16], u_int8_t rk[RIJNDAEL_MAXROUNDS+1][4][4], int ROUNDS);
32 int rijndaelDecryptRound(u_int8_t a[4][4], u_int8_t rk[RIJNDAEL_MAXROUNDS+1][4][4], int ROUNDS, int rounds);
H A Drijndael-alg-fst.c36 int rijndaelKeySched(word8 k[MAXKC][4], word8 W[MAXROUNDS+1][4][4], int ROUNDS) { argument
46 int KC = ROUNDS - 6;
54 for (j = 0; (j < KC) && (r < ROUNDS + 1); ) {
64 while (r < ROUNDS + 1) { /* while not enough round key material calculated */
89 for (j = 0; (j < KC) && (r < ROUNDS + 1); ) {
103 int rijndaelKeyEncToDec(word8 W[MAXROUNDS+1][4][4], int ROUNDS) { argument
107 for (r = 1; r < ROUNDS; r++) {
142 int rijndaelEncrypt(word8 in[16], word8 out[16], word8 rk[MAXROUNDS+1][4][4], int ROUNDS) { argument
178 for (r = 1; r < ROUNDS-1; r++) {
202 *((word32*)temp[0]) = *((word32*)(b )) ^ *((word32*)rk[ROUNDS
240 rijndaelEncryptRound(word8 a[4][4], word8 rk[MAXROUNDS+1][4][4], int ROUNDS, int rounds) argument
307 rijndaelDecrypt(word8 in[16], word8 out[16], word8 rk[MAXROUNDS+1][4][4], int ROUNDS) argument
409 rijndaelDecryptRound(word8 a[4][4], word8 rk[MAXROUNDS+1][4][4], int ROUNDS, int rounds) argument
[all...]
H A Drijndael-api-fst.c64 key->ROUNDS = keyLen/32 + 6;
71 rijndaelKeySched(k, key->keySched, key->ROUNDS);
73 rijndaelKeyEncToDec(key->keySched, key->ROUNDS);
112 rijndaelEncrypt(input, outBuffer, key->keySched, key->ROUNDS);
132 rijndaelEncrypt(block, outBuffer, key->keySched, key->ROUNDS);
149 rijndaelEncrypt(block, outBuffer, key->keySched, key->ROUNDS);
169 rijndaelEncrypt(block, block, key->keySched, key->ROUNDS);
226 rijndaelEncrypt(input, outBuffer, key->keySched, key->ROUNDS);
236 rijndaelEncrypt(block, outBuffer, key->keySched, key->ROUNDS);
246 rijndaelEncrypt(block, outBuffer, key->keySched, key->ROUNDS);
[all...]
H A Drijndael-api-fst.h58 int ROUNDS; /* key-length-dependent number of rounds */ member in struct:__anon8156
/external/icu/android_icu4j/src/main/java/android/icu/math/
H A DMathContext.java302 private static final int ROUNDS[]=new int[]{ROUND_HALF_UP,ROUND_UNNECESSARY,ROUND_CEILING,ROUND_DOWN,ROUND_FLOOR,ROUND_HALF_DOWN,ROUND_HALF_EVEN,ROUND_UP}; field in class:MathContext
305 private static final java.lang.String ROUNDWORDS[]=new java.lang.String[]{"ROUND_HALF_UP","ROUND_UNNECESSARY","ROUND_CEILING","ROUND_DOWN","ROUND_FLOOR","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_UP"}; // matching names of the ROUNDS values
559 {int $1=ROUNDS.length;r=0;r:for(;$1>0;$1--,r++){
560 if (roundingMode==ROUNDS[r])
576 {int $2=ROUNDS.length;for(r=0;$2>0;$2--,r++){
577 if (testround==ROUNDS[r])
/external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base/src/com/ibm/icu/math/
H A DMathContext.java313 private static final int ROUNDS[]=new int[]{ROUND_HALF_UP,ROUND_UNNECESSARY,ROUND_CEILING,ROUND_DOWN,ROUND_FLOOR,ROUND_HALF_DOWN,ROUND_HALF_EVEN,ROUND_UP}; field in class:MathContext
316 private static final java.lang.String ROUNDWORDS[]=new java.lang.String[]{"ROUND_HALF_UP","ROUND_UNNECESSARY","ROUND_CEILING","ROUND_DOWN","ROUND_FLOOR","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_UP"}; // matching names of the ROUNDS values
579 {int $1=ROUNDS.length;r=0;r:for(;$1>0;$1--,r++){
580 if (roundingMode==ROUNDS[r])
596 {int $2=ROUNDS.length;for(r=0;$2>0;$2--,r++){
597 if (testround==ROUNDS[r])
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/math/
H A DMathContext.java313 private static final int ROUNDS[]=new int[]{ROUND_HALF_UP,ROUND_UNNECESSARY,ROUND_CEILING,ROUND_DOWN,ROUND_FLOOR,ROUND_HALF_DOWN,ROUND_HALF_EVEN,ROUND_UP}; field in class:MathContext
316 private static final java.lang.String ROUNDWORDS[]=new java.lang.String[]{"ROUND_HALF_UP","ROUND_UNNECESSARY","ROUND_CEILING","ROUND_DOWN","ROUND_FLOOR","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_UP"}; // matching names of the ROUNDS values
580 {int $1=ROUNDS.length;r=0;r:for(;$1>0;$1--,r++){
581 if (roundingMode==ROUNDS[r])
597 {int $2=ROUNDS.length;for(r=0;$2>0;$2--,r++){
598 if (testround==ROUNDS[r])
/external/libmicrohttpd/src/testcurl/
H A Dperf_get.c64 #define ROUNDS 500 macro
116 double rps = ((double) (ROUNDS * 1000)) / ((double) (now() - start_time));
200 for (i=0;i<ROUNDS;i++)
260 for (i=0;i<ROUNDS;i++)
320 for (i=0;i<ROUNDS;i++)
395 for (i=0;i<ROUNDS;i++)
H A Dtest_concurrent_stop.c43 * test (total number of requests will be ROUNDS * PAR).
45 #define ROUNDS 50000 macro
123 for (i=0;i<ROUNDS;i++)
H A Dperf_get_concurrent.c53 * test (total number of requests will be ROUNDS * PAR).
55 #define ROUNDS 500 macro
112 double rps = ((double) (PAR * ROUNDS * 1000)) / ((double) (now() - start_time));
184 for (i=0;i<ROUNDS;i++)
/external/scrypt/lib/crypto/
H A Dcrypto_scrypt-neon-salsa208.h9 #define ROUNDS 8 macro
73 for (i = ROUNDS;i > 0;i -= 2) {
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
H A DAESEngine.java292 ROUNDS = KC + 6; // This is not always true for the generalized Rijndael that allows larger block sizes
293 int[][] W = new int[ROUNDS+1][4]; // 4 words in a block
402 for (int j = 1; j < ROUNDS; j++)
414 private int ROUNDS; field in class:AESEngine
573 while (r < ROUNDS - 1)
600 int t0 = this.C0 ^ KW[ROUNDS][0];
601 int t1 = this.C1 ^ KW[ROUNDS][1];
602 int t2 = this.C2 ^ KW[ROUNDS][2];
604 int r = ROUNDS - 1, r0, r1, r2, r3 = this.C3 ^ KW[ROUNDS][
[all...]
H A DBlowfishEngine.java299 private static final int ROUNDS = 16; field in class:BlowfishEngine
302 private static final int P_SZ = ROUNDS+2;
415 for (int i = 1; i < ROUNDS; i += 2)
421 xr ^= P[ROUNDS + 1];
522 for (int i = 1; i < ROUNDS; i += 2)
528 xr ^= P[ROUNDS + 1];
548 xl ^= P[ROUNDS + 1];
550 for (int i = ROUNDS; i > 0 ; i -= 2)
H A DAESFastEngine.java621 ROUNDS = KC + 6; // This is not always true for the generalized Rijndael that allows larger block sizes
622 int[][] W = new int[ROUNDS+1][4]; // 4 words in a block
731 for (int j = 1; j < ROUNDS; j++)
743 private int ROUNDS; field in class:AESFastEngine
862 while (r < ROUNDS - 1)
934 int t0 = this.C0 ^ KW[ROUNDS][0];
935 int t1 = this.C1 ^ KW[ROUNDS][1];
936 int t2 = this.C2 ^ KW[ROUNDS][2];
938 int r = ROUNDS - 1, r0, r1, r2, r3 = this.C3 ^ KW[ROUNDS][
[all...]
H A DTwofishEngine.java192 private static final int ROUNDS = 16; field in class:TwofishEngine
458 for (int r = 0; r < ROUNDS; r +=2)
495 int k = ROUND_SUBKEYS + 2 * ROUNDS -1 ;
497 for (int r = 0; r< ROUNDS ; r +=2)
/external/google-tv-pairing-protocol/java/jar/
H A Dbcprov-jdk15-143.jarMETA-INF/MANIFEST.MF META-INF/BCKEY.SF META-INF/BCKEY.DSA META ...

Completed in 4300 milliseconds