Add mpi_safe_cond_assign()
This commit is contained in:
parent
44aab79022
commit
71c2c21601
4 changed files with 73 additions and 0 deletions
|
@ -231,6 +231,25 @@ int mpi_copy( mpi *X, const mpi *Y );
|
||||||
*/
|
*/
|
||||||
void mpi_swap( mpi *X, mpi *Y );
|
void mpi_swap( mpi *X, mpi *Y );
|
||||||
|
|
||||||
|
/**
|
||||||
|
* \brief Safe conditional assignement X = Y if assign is 1
|
||||||
|
*
|
||||||
|
* \param X MPI to conditionally assign to
|
||||||
|
* \param Y Value to be assigned
|
||||||
|
* \param assign 1: perform the assignment, 0: leave X untouched
|
||||||
|
*
|
||||||
|
* \return 0 if successful,
|
||||||
|
* POLARSSL_ERR_MPI_MALLOC_FAILED if memory allocation failed,
|
||||||
|
* POLARSSL_ERR_MPI_BAD_INPUT_DATA if assing is not 0 or 1
|
||||||
|
*
|
||||||
|
* \note This function is equivalent to
|
||||||
|
* if( assign ) mpi_copy( X, Y );
|
||||||
|
* except that it avoids leaking any information about whether
|
||||||
|
* the assignment was done or not (the above code may leak
|
||||||
|
* information through branch prediction analysis).
|
||||||
|
*/
|
||||||
|
int mpi_safe_cond_assign( mpi *X, mpi *Y, unsigned char assign );
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* \brief Set value from integer
|
* \brief Set value from integer
|
||||||
*
|
*
|
||||||
|
|
|
@ -204,6 +204,31 @@ void mpi_swap( mpi *X, mpi *Y )
|
||||||
memcpy( Y, &T, sizeof( mpi ) );
|
memcpy( Y, &T, sizeof( mpi ) );
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Conditionally assign X = Y, without leaking information
|
||||||
|
*/
|
||||||
|
int mpi_safe_cond_assign( mpi *X, mpi *Y, unsigned char assign )
|
||||||
|
{
|
||||||
|
int ret = 0;
|
||||||
|
size_t i;
|
||||||
|
|
||||||
|
if( assign * ( 1 - assign ) != 0 )
|
||||||
|
return( POLARSSL_ERR_MPI_BAD_INPUT_DATA );
|
||||||
|
|
||||||
|
/* Make sure both MPIs have the same size */
|
||||||
|
if( X->n > Y->n )
|
||||||
|
MPI_CHK( mpi_grow( Y, X->n ) );
|
||||||
|
if( Y->n > X->n )
|
||||||
|
MPI_CHK( mpi_grow( X, Y->n ) );
|
||||||
|
|
||||||
|
/* Do the conditional assign safely */
|
||||||
|
for( i = 0; i < X->n; i++ )
|
||||||
|
X->p[i] = X->p[i] * (1 - assign) + Y->p[i] * assign;
|
||||||
|
|
||||||
|
cleanup:
|
||||||
|
return( ret );
|
||||||
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* Set value from integer
|
* Set value from integer
|
||||||
*/
|
*/
|
||||||
|
|
|
@ -205,6 +205,15 @@ mpi_shrink:4:1:0:1
|
||||||
Test mpi_shrink #8
|
Test mpi_shrink #8
|
||||||
mpi_shrink:4:0:0:1
|
mpi_shrink:4:0:0:1
|
||||||
|
|
||||||
|
Test mpi_safe_cond_assign #1
|
||||||
|
mpi_safe_cond_assign:"01":"02"
|
||||||
|
|
||||||
|
Test mpi_safe_cond_assign #2
|
||||||
|
mpi_safe_cond_assign:"FF000000000000000001":"02"
|
||||||
|
|
||||||
|
Test mpi_safe_cond_assign #3
|
||||||
|
mpi_safe_cond_assign:"01":"FF000000000000000002"
|
||||||
|
|
||||||
Base test mpi_add_abs #1
|
Base test mpi_add_abs #1
|
||||||
mpi_add_abs:10:"12345678":10:"642531":10:"12988209"
|
mpi_add_abs:10:"12345678":10:"642531":10:"12988209"
|
||||||
|
|
||||||
|
|
|
@ -308,6 +308,26 @@ void mpi_shrink( int before, int used, int min, int after )
|
||||||
}
|
}
|
||||||
/* END_CASE */
|
/* END_CASE */
|
||||||
|
|
||||||
|
/* BEGIN_CASE */
|
||||||
|
void mpi_safe_cond_assign( char *x_str, char *y_str )
|
||||||
|
{
|
||||||
|
mpi X, Y, XX;
|
||||||
|
mpi_init( &X ); mpi_init( &Y ); mpi_init( &XX );
|
||||||
|
|
||||||
|
TEST_ASSERT( mpi_read_string( &X, 16, x_str ) == 0 );
|
||||||
|
TEST_ASSERT( mpi_read_string( &Y, 16, y_str ) == 0 );
|
||||||
|
TEST_ASSERT( mpi_copy( &XX, &X ) == 0 );
|
||||||
|
|
||||||
|
TEST_ASSERT( mpi_safe_cond_assign( &X, &Y, 0 ) == 0 );
|
||||||
|
TEST_ASSERT( mpi_cmp_mpi( &X, &XX ) == 0 );
|
||||||
|
|
||||||
|
TEST_ASSERT( mpi_safe_cond_assign( &X, &Y, 1 ) == 0 );
|
||||||
|
TEST_ASSERT( mpi_cmp_mpi( &X, &Y ) == 0 );
|
||||||
|
|
||||||
|
mpi_free( &X ); mpi_free( &Y ); mpi_free( &XX );
|
||||||
|
}
|
||||||
|
/* END_CASE */
|
||||||
|
|
||||||
/* BEGIN_CASE */
|
/* BEGIN_CASE */
|
||||||
void mpi_swap( int input_X, int input_Y )
|
void mpi_swap( int input_X, int input_Y )
|
||||||
{
|
{
|
||||||
|
|
Loading…
Reference in a new issue