HomeSort by: relevance | last modified time | path
    Searched defs:ROUNDS (Results 1 - 11 of 11) sorted by relevancy

  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_stream/salsa20/xmm6int/
salsa20_xmm6int-avx2.c 29 # define ROUNDS 20
salsa20_xmm6int-sse2.c 21 # define ROUNDS 20
  /src/external/mit/libcbor/dist/test/
fuzz_test.c 18 #define ROUNDS 65536ULL
21 #define ROUNDS 256ULL
69 printf("Fuzzing %llu rounds of up to %llu bytes with seed %u\n", ROUNDS,
73 for (size_t i = 0; i < ROUNDS; i++) run_round();
76 (ROUNDS * MAXLEN) / 1024);
  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_core/hsalsa20/ref2/
core_hsalsa20_ref2.c 13 #define ROUNDS 20
50 for (i = ROUNDS; i > 0; i -= 2) {
  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_stream/chacha20/dolbeau/
chacha20_dolbeau-avx2.c 30 # define ROUNDS 20
chacha20_dolbeau-ssse3.c 25 # define ROUNDS 20
  /src/crypto/dist/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);
  /src/crypto/external/apache2/openssl/dist/crypto/whrlpool/
wp_block.c 58 #define ROUNDS 10
224 u8 c[(256 * N + ROUNDS) * sizeof(u64)];
225 u64 q[(256 * N + ROUNDS)];
486 /* rc[ROUNDS] */
515 for (r = 0; r < ROUNDS; r++) {
556 for (r = 0; r < ROUNDS; r++) {
  /src/crypto/external/bsd/openssl/dist/crypto/whrlpool/
wp_block.c 58 #define ROUNDS 10
225 u8 c[(256 * N + ROUNDS) * sizeof(u64)];
226 u64 q[(256 * N + ROUNDS)];
488 /* rc[ROUNDS] */
518 for (r = 0; r < ROUNDS; r++) {
565 for (r = 0; r < ROUNDS; r++) {
  /src/crypto/external/bsd/openssl.old/dist/crypto/whrlpool/
wp_block.c 51 #define ROUNDS 10
219 u8 c[(256 * N + ROUNDS) * sizeof(u64)];
220 u64 q[(256 * N + ROUNDS)];
482 /* rc[ROUNDS] */
512 for (r = 0; r < ROUNDS; r++) {
559 for (r = 0; r < ROUNDS; r++) {
  /src/sys/dev/marvell/
mvxpsec.c 2940 int KC, BC, ROUNDS;
2946 ROUNDS = 10;
2950 ROUNDS = 12;
2954 ROUNDS = 14;
2968 for(j = 0; (j < KC) && (t < (ROUNDS+1)*BC); j++, t++)
2971 while (t < (ROUNDS+1)*BC) { /* while not enough round key material calculated */
2992 for(j = 0; (j < KC) && (t < (ROUNDS+1)*BC); j++, t++)
3005 int i, rounds, KC; local
3025 rounds = 10;
3029 rounds = 12
    [all...]

Completed in 37 milliseconds