aesni_gcm_mult() now returns void

This commit is contained in:
Manuel Pégourié-Gonnard 2013-12-30 13:54:23 +01:00
parent bfa3c9a85f
commit d4588cfb6a
3 changed files with 7 additions and 9 deletions

View File

@ -74,12 +74,10 @@ int aesni_crypt_ecb( aes_context *ctx,
*
* \note Both operands and result are bit strings interpreted as
* elements of GF(2^128) as per the GCM spec.
*
* \return 0 on success (cannot fail)
*/
int aesni_gcm_mult( unsigned char c[16],
const unsigned char a[16],
const unsigned char b[16] );
void aesni_gcm_mult( unsigned char c[16],
const unsigned char a[16],
const unsigned char b[16] );
/**
* \brief Compute decryption round keys from encryption round keys

View File

@ -107,9 +107,9 @@ int aesni_crypt_ecb( aes_context *ctx,
* GCM multiplication: c = a times b in GF(2^128)
* Based on [CLMUL-WP] algorithms 1 (with equation 27) and 5.
*/
int aesni_gcm_mult( unsigned char c[16],
const unsigned char a[16],
const unsigned char b[16] )
void aesni_gcm_mult( unsigned char c[16],
const unsigned char a[16],
const unsigned char b[16] )
{
unsigned char aa[16], bb[16], cc[16];
size_t i;

View File

@ -198,7 +198,7 @@ static void gcm_mult( gcm_context *ctx, const unsigned char x[16],
PUT_UINT32_BE( ctx->HL[8] >> 32, h, 8 );
PUT_UINT32_BE( ctx->HL[8], h, 12 );
(void) aesni_gcm_mult( output, x, h );
aesni_gcm_mult( output, x, h );
return;
}
#endif