C++ (Cpp) u8_to_u32_be Examples

Example #1

File: blake256_core.c Project: fsasm/asm-hash

static void process_state(const uint8_t block[64], uint32_t state[16]) {
	for (uint_fast8_t round = 0; round < 14; round++) {
		uint_fast8_t r = round % 10;
		
		const unsigned int* permutation = permutations[r];
		
		for (uint_fast8_t i = 0; i < 4; i++) {
			unsigned int index0 = permutation[2 * i];
			unsigned int index1 = permutation[2 * i + 1];
			
			uint32_t mc1 = table[index1] ^ u8_to_u32_be(&block[index0 * 4]);
			uint32_t mc2 = table[index0] ^ u8_to_u32_be(&block[index1 * 4]);
			
			compress(&state[i], &state[4 + i], &state[8 + i], &state[12 + i], mc1 , mc2);
		}
		
		for (uint_fast8_t i = 0; i < 4; i++) {
			unsigned int index0 = permutation[2 * i + 8];
			unsigned int index1 = permutation[2 * i + 9];
			
			uint32_t mc1 = table[index1] ^ u8_to_u32_be(&block[index0 * 4]);
			uint32_t mc2 = table[index0] ^ u8_to_u32_be(&block[index1 * 4]);
			
			compress(&state[i], &state[4 + (i + 1) % 4], &state[8 + (i + 2) % 4], &state[12 + (i + 3) % 4], mc1, mc2);
		}
	}
}

Example #2

File: sha1.c Project: gruve-p/asm-hash

void sha1_process_blocks (const uint8_t block[], uint32_t hash[5], unsigned int n) {
	for (unsigned int j = 0; j < n; j++) {
		const uint8_t* block1 = &block[j * 64];
		
		uint32_t a = hash[0];
		uint32_t b = hash[1];
		uint32_t c = hash[2];
		uint32_t d = hash[3];
		uint32_t e = hash[4];
		
		uint32_t temp;
		uint32_t k;
		uint32_t f;
		uint32_t W[80];
		
		k = UINT32_C (0x5A827999);
		for (uint_fast8_t i = 0; i < 16; i++) {
			W[i] = u8_to_u32_be (&block1[i * 4]);
			
			f = (b & c) | ((~b) & d);
			temp = W[i] + f + k + rotate_left_32 (a, 5) + e;
			
			e = d;
			d = c;
			c = rotate_left_32 (b, 30);
			b = a;
			a = temp;
		}
		for (uint_fast8_t i = 16; i < 20; i++) {
			W[i] = rotate_left_32 (W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);
			
			f = (b & c) | ((~b) & d);
			temp = W[i] + f + k + rotate_left_32 (a, 5) + e;
			
			e = d;
			d = c;
			c = rotate_left_32 (b, 30);
			b = a;
			a = temp;
		}
		
		k = UINT32_C (0x6ED9EBA1);
		for (uint_fast8_t i = 20; i < 40; i++) {
			W[i] = rotate_left_32 (W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);
			
			f = b ^ c ^ d; 
			temp = W[i] + f + k + rotate_left_32 (a, 5) + e;
			
			e = d;
			d = c;
			c = rotate_left_32 (b, 30);
			b = a;
			a = temp;
		}
		
		k = UINT32_C (0x8F1BBCDC);
		for (uint_fast8_t i = 40; i < 60; i++) {
			W[i] = rotate_left_32 (W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);
			
			f = (b & c) | (b & d) | (c & d);
			temp = W[i] + f + k + rotate_left_32 (a, 5) + e;
			
			e = d;
			d = c;
			c = rotate_left_32 (b, 30);
			b = a;
			a = temp;
		}
		
		k = UINT32_C (0xCA62C1D6);
		for (uint_fast8_t i = 60; i < 80; i++) {
			W[i] = rotate_left_32 (W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);
			
			f = b ^ c ^ d; 
			temp = W[i] + f + k + rotate_left_32 (a, 5) + e;
			
			e = d;
			d = c;
			c = rotate_left_32 (b, 30);
			b = a;
			a = temp;
		}
		
		hash[0] += a;
		hash[1] += b;
		hash[2] += c;
		hash[3] += d;
		hash[4] += e;
	}
}