Cross Reference: /illumos-gate/usr/src/common/crypto/aes/aes

Lines Matching defs:Nr
92 extern void aes_encrypt_impl(const uint32_t rk[], int Nr, const uint32_t pt[4],
94 extern void aes_decrypt_impl(const uint32_t rk[], int Nr, const uint32_t ct[4],
107 extern void aes_encrypt_amd64(const uint32_t rk[], int Nr,
109 extern void aes_decrypt_amd64(const uint32_t rk[], int Nr,
117 extern void aes_encrypt_intel(const uint32_t rk[], int Nr,
119 extern void aes_decrypt_intel(const uint32_t rk[], int Nr,
868  * (which can be computed from the size of the key), i.e. 4*(Nr + 1).
979  * (which can be computed from the size of the key), i.e. 4*(Nr + 1).
993 	int		i, Nr;
995 	Nr = rijndael_key_setup_enc_raw(rk1, cipherKey, keyBits);
997 	for (i = 0; i < 4 * Nr; i++) {
1004 	rkt = (uint32_t *)(&(rk64[4 * Nr]));
1007 		rkt[i] = rk1[4 * Nr+i];
1010 	return (Nr);
1020  * (which can be computed from the size of the key), i.e. 4*(Nr + 1).
1031 	int		Nr, i;
1035 	Nr = rijndael_key_setup_enc_raw(rk, cipherKey, keyBits);
1039 	for (i = 0; i < 2 * Nr + 2; i++) {
1041 		rk[i] = rk[4 * Nr - i + 3];
1042 		rk[4 * Nr - i + 3] = temp;
1049 	for (i = 1; i < Nr; i++) {
1069 	return (Nr);
1075  * (which can be computed from the size of the key), i.e. 4*(Nr + 1).
1089 	int		i, Nr;
1091 	Nr = rijndael_key_setup_dec_raw(rk1, cipherKey, keyBits);
1092 	for (i = 0; i < 4 * Nr; i++) {
1099 	rkt = (uint32_t *)(&(rk64[4 * Nr]));
1102 		rkt[i] = rk1[4 * Nr + i];
1105 	return (Nr);
1168  * (which can be computed from the size of the key), i.e. 4*(Nr + 1).
1172  * Nr		Number of rounds
1178 rijndael_encrypt(const uint32_t rk[], int Nr, const uint32_t pt[4],
1182 		aes_encrypt_intel(rk, Nr, pt, ct);
1185 		aes_encrypt_amd64(rk, Nr, pt, ct);
1195  * (which can be computed from the size of the key), i.e. 4*(Nr + 1).
1199  * Nr		Number of rounds
1205 rijndael_decrypt(const uint32_t rk[], int Nr, const uint32_t ct[4],
1209 		aes_decrypt_intel(rk, Nr, ct, pt);
1212 		aes_decrypt_amd64(rk, Nr, ct, pt);
1223  *  (which can be computed from the size of the key), i.e. 4*(Nr + 1).
1233 	int	 Nr, i, j;
1237 	Nr = rijndael_key_setup_enc_raw(rk, cipherKey, keyBits);
1240 	for (i = 0, j = 4 * Nr; i < j; i += 4, j -= 4) {
1259 	for (i = 1; i < Nr; i++) {
1279 	return (Nr);
1309  * (which can be computed from the size of the key), i.e. 4*(Nr + 1).
1313  * Nr	Number of rounds
1318 rijndael_encrypt(const uint32_t rk[], int Nr, const uint32_t pt[4],
1335 	 * Nr - 1 full rounds:
1338 	r = Nr >> 1;
1437  * (which can be computed from the size of the key), i.e. 4*(Nr + 1).
1441  * Nr	Number of rounds
1446 rijndael_decrypt(const uint32_t rk[], int Nr, const uint32_t ct[4],
1462 	 * Nr - 1 full rounds:
1465 	r = Nr >> 1;