blob: e4d7b41bc84a98bf8a2c8c60eda2ee6473353aa4 [file] [log] [blame]
Werner Lewis0c6ea122022-09-30 13:02:16 +01001/* BEGIN_HEADER */
2#include "mbedtls/bignum.h"
3#include "mbedtls/entropy.h"
4#include "bignum_mod.h"
5#include "constant_time_internal.h"
6#include "test/constant_flow.h"
Werner Lewis0c6ea122022-09-30 13:02:16 +01007/* END_HEADER */
8
9/* BEGIN_DEPENDENCIES
10 * depends_on:MBEDTLS_BIGNUM_C
11 * END_DEPENDENCIES
12 */
13
14/* BEGIN_CASE */
15void mpi_mod_setup( int ext_rep, int int_rep, int iret )
16{
17 #define MLIMBS 8
18 mbedtls_mpi_uint mp[MLIMBS];
19 mbedtls_mpi_mod_modulus m;
20 int ret;
21
Minos Galanakis4d4c98b2022-10-27 15:58:02 +010022 memset( mp, 0xFF, sizeof(mp) );
Werner Lewis0c6ea122022-09-30 13:02:16 +010023
24 mbedtls_mpi_mod_modulus_init( &m );
25 ret = mbedtls_mpi_mod_modulus_setup( &m, mp, MLIMBS, ext_rep, int_rep );
26 TEST_EQUAL( ret, iret );
27
Minos Galanakisdd365a52022-10-19 01:48:32 +010028 /* Only test if the constants have been set-up */
29 if ( ret == 0 && int_rep == MBEDTLS_MPI_MOD_REP_MONTGOMERY )
30 {
31 /* Test that the consts have been calculated */
32 TEST_ASSERT( m.rep.mont.rr != NULL );
33 TEST_ASSERT( m.rep.mont.mm != 0 );
34
Minos Galanakisdd365a52022-10-19 01:48:32 +010035 }
36
Werner Lewis0c6ea122022-09-30 13:02:16 +010037 /* Address sanitiser should catch if we try to free mp */
38 mbedtls_mpi_mod_modulus_free( &m );
39
40 /* Make sure that the modulus doesn't have reference to mp anymore */
41 TEST_ASSERT( m.p != mp );
42
Minos Galanakisdd365a52022-10-19 01:48:32 +010043 /* Only test if the constants have been set-up */
44 if ( ret == 0 && int_rep == MBEDTLS_MPI_MOD_REP_MONTGOMERY )
45 {
Minos Galanakisdd365a52022-10-19 01:48:32 +010046 /* Verify the data and pointers allocated have been properly wiped */
47 TEST_ASSERT( m.rep.mont.rr == NULL );
48 TEST_ASSERT( m.rep.mont.mm == 0 );
Minos Galanakisdd365a52022-10-19 01:48:32 +010049 }
Werner Lewis0c6ea122022-09-30 13:02:16 +010050exit:
51 /* It should be safe to call an mbedtls free several times */
52 mbedtls_mpi_mod_modulus_free( &m );
53
54 #undef MLIMBS
55}
56/* END_CASE */
Janos Follath5933f692022-11-02 14:35:17 +000057
58/* BEGIN MERGE SLOT 1 */
59
60/* END MERGE SLOT 1 */
61
62/* BEGIN MERGE SLOT 2 */
63
64/* END MERGE SLOT 2 */
65
66/* BEGIN MERGE SLOT 3 */
67
68/* END MERGE SLOT 3 */
69
70/* BEGIN MERGE SLOT 4 */
71
72/* END MERGE SLOT 4 */
73
74/* BEGIN MERGE SLOT 5 */
75
76/* END MERGE SLOT 5 */
77
78/* BEGIN MERGE SLOT 6 */
79
80/* END MERGE SLOT 6 */
81
82/* BEGIN MERGE SLOT 7 */
Minos Galanakis8f242702022-11-10 16:56:02 +000083/* BEGIN_CASE */
Minos Galanakisaed832a2022-11-24 09:09:47 +000084void mpi_residue_setup( char * input_X, char * input_Y, int ret )
Minos Galanakisa17ad482022-11-16 16:29:15 +000085{
Minos Galanakisa17ad482022-11-16 16:29:15 +000086 mbedtls_mpi_uint *N = NULL;
87 mbedtls_mpi_uint *R = NULL;
Minos Galanakisaed832a2022-11-24 09:09:47 +000088 size_t n_limbs, r_limbs;
Minos Galanakisa17ad482022-11-16 16:29:15 +000089 mbedtls_mpi_mod_modulus m;
90 mbedtls_mpi_mod_residue r;
91
Minos Galanakisa17ad482022-11-16 16:29:15 +000092 mbedtls_mpi_mod_modulus_init( &m );
93
Minos Galanakisaed832a2022-11-24 09:09:47 +000094 /* Allocate the memory for intermediate data structures */
95 TEST_EQUAL( 0, mbedtls_test_read_mpi_core( &N, &n_limbs, input_X ) );
96 TEST_EQUAL( 0, mbedtls_test_read_mpi_core( &R, &r_limbs, input_Y ) );
97
Minos Galanakisa17ad482022-11-16 16:29:15 +000098 TEST_EQUAL( 0, mbedtls_mpi_mod_modulus_setup( &m, N, n_limbs,
99 MBEDTLS_MPI_MOD_EXT_REP_LE, MBEDTLS_MPI_MOD_REP_MONTGOMERY ) );
100
Minos Galanakisaed832a2022-11-24 09:09:47 +0000101 TEST_EQUAL( ret, mbedtls_mpi_mod_residue_setup( &r, &m, R , r_limbs ) );
Minos Galanakisa17ad482022-11-16 16:29:15 +0000102
103exit:
104 mbedtls_mpi_mod_modulus_free( &m );
105 mbedtls_free( N );
106 mbedtls_free( R );
Minos Galanakisa17ad482022-11-16 16:29:15 +0000107}
108/* END_CASE */
Minos Galanakisaed832a2022-11-24 09:09:47 +0000109
Minos Galanakisa17ad482022-11-16 16:29:15 +0000110/* BEGIN_CASE */
Minos Galanakis8f242702022-11-10 16:56:02 +0000111void mpi_mod_io_neg( )
112{
113 #define IO_ZERO 0
114 #define IO_ONE 1
115 #define IO_MIN1 2
116 #define IO_MAX 3
117 #define IO_2LIMBS_MIN1 4
118 #define IO_2LIMBS 5
Janos Follath5933f692022-11-02 14:35:17 +0000119
Minos Galanakis8f242702022-11-10 16:56:02 +0000120 mbedtls_mpi_uint *N = NULL;
121 mbedtls_mpi_uint *R = NULL;
122 mbedtls_mpi_uint *N2 = NULL;
123 mbedtls_mpi_uint *R2 = NULL;
124 unsigned char *r_buff = NULL;
125
126 size_t n_limbs, r_limbs, n2_limbs, r2_limbs;
127
128 mbedtls_mpi_mod_modulus m;
129 mbedtls_mpi_mod_residue r;
130 mbedtls_mpi_mod_modulus m2;
131 mbedtls_mpi_mod_residue rn = { NULL, 0 };
132
133 const char * s_data[ 6 ] = { "00", "01", "fe", "ff",
134 "7ffffffffffffffff0" ,"7ffffffffffffffff1" };
135 const size_t buff_bytes = 1024;
136
137 /* Allocate the memory for intermediate data structures */
138 TEST_EQUAL( 0, mbedtls_test_read_mpi_core( &N, &n_limbs, s_data[ IO_MIN1 ] ) );
139 TEST_EQUAL( 0, mbedtls_test_read_mpi_core( &R, &r_limbs, s_data[ IO_ONE ] ) );
140 TEST_EQUAL( 0, mbedtls_test_read_mpi_core( &N2, &n2_limbs, s_data[ IO_2LIMBS ] ) );
141 TEST_EQUAL( 0, mbedtls_test_read_mpi_core( &R2, &r2_limbs, s_data[ IO_2LIMBS_MIN1 ] ) );
142
143 mbedtls_mpi_mod_modulus_init( &m );
144 mbedtls_mpi_mod_modulus_init( &m2 );
145
146 /* Allocate more than required space on buffer so we can test for input_r > mpi */
147 ASSERT_ALLOC( r_buff, buff_bytes );
148 memset( r_buff, 0x1, 1 );
149
150 TEST_EQUAL( 0, mbedtls_mpi_mod_modulus_setup( &m, N, n_limbs,
151 MBEDTLS_MPI_MOD_EXT_REP_LE, MBEDTLS_MPI_MOD_REP_MONTGOMERY ) );
152
153 TEST_EQUAL( 0, mbedtls_mpi_mod_residue_setup( &r, &m, R , n_limbs ) );
154
155 /* Pass for input_r < modulo */
156 TEST_EQUAL( 0, mbedtls_mpi_mod_read( &r, &m, r_buff, 1 ) );
157
158 /* input_r == modulo -1 */
159 memset( r_buff, 0xfd, buff_bytes );
160 TEST_EQUAL( 0, mbedtls_mpi_mod_read( &r, &m, r_buff, 1 ) );
161
162 /* modulo->p == NULL || residue->p == NULL ( m2 has not been set-up ) */
163 TEST_EQUAL(MBEDTLS_ERR_MPI_BAD_INPUT_DATA, mbedtls_mpi_mod_read( &r, &m2, r_buff, 1 ) );
164 TEST_EQUAL(MBEDTLS_ERR_MPI_BAD_INPUT_DATA, mbedtls_mpi_mod_read( &rn, &m, r_buff, 1 ) );
165 TEST_EQUAL(MBEDTLS_ERR_MPI_BAD_INPUT_DATA, mbedtls_mpi_mod_write( &r, &m2, r_buff, 1 ) );
166 TEST_EQUAL(MBEDTLS_ERR_MPI_BAD_INPUT_DATA, mbedtls_mpi_mod_write( &rn, &m, r_buff, 1 ) );
167
168 /* Fail for r_limbs < m->limbs */
169 r.limbs = m.limbs - 1;
170 TEST_EQUAL(MBEDTLS_ERR_MPI_BAD_INPUT_DATA, mbedtls_mpi_mod_read( &r, &m, r_buff, 1 ) );
171 TEST_EQUAL(MBEDTLS_ERR_MPI_BAD_INPUT_DATA, mbedtls_mpi_mod_write( &rn, &m, r_buff, 1 ) );
172 r.limbs = r_limbs;
173
174 /* Fail if input_r >= modulo m */
175 /* input_r = modulo */
176 memset( r_buff, 0xfe, buff_bytes );
177 TEST_EQUAL(MBEDTLS_ERR_MPI_BAD_INPUT_DATA, mbedtls_mpi_mod_read( &r, &m, r_buff, 1 ) );
178
179 /* input_r > modulo */
180 memset( r_buff, 0xff, buff_bytes );
181 TEST_EQUAL(MBEDTLS_ERR_MPI_BAD_INPUT_DATA, mbedtls_mpi_mod_read( &r, &m, r_buff, 1 ) );
182
183 /* Data too large to fit */
184 TEST_EQUAL(MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL, mbedtls_mpi_mod_read( &r, &m, r_buff, buff_bytes ) );
185
186 /* Read the two limbs input data into a larger modulus and residue */
187 TEST_EQUAL( 0, mbedtls_mpi_mod_modulus_setup( &m2, N2, n2_limbs,
188 MBEDTLS_MPI_MOD_EXT_REP_LE, MBEDTLS_MPI_MOD_REP_MONTGOMERY ) );
189 rn.p = R2;
190 rn.limbs = r2_limbs;
191 TEST_EQUAL(MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL, mbedtls_mpi_mod_write( &rn, &m2, r_buff, 1 ) );
192
193exit:
194 mbedtls_mpi_mod_modulus_free( &m );
195 mbedtls_mpi_mod_modulus_free( &m2 );
196 mbedtls_free( N );
197 mbedtls_free( R );
198 mbedtls_free( N2 );
199 mbedtls_free( R2 );
200 mbedtls_free( r_buff );
201
202 #undef IO_ZERO
203 #undef IO_ONE
204 #undef IO_MIN1
205 #undef IO_MAX
206 #undef IO_2LIMBS_MIN1
207 #undef IO_2LIMBS
208}
209/* END_CASE */
210
211/* BEGIN_CASE */
212void mpi_mod_io( char * input_N, data_t * input_A, int iendian )
213{
214 mbedtls_mpi_uint *N = NULL;
215 mbedtls_mpi_uint *R = NULL;
216 unsigned char *r_buff = NULL;
217 mbedtls_mpi_mod_modulus m;
218 mbedtls_mpi_mod_residue r;
219 size_t n_limbs, n_bytes, a_bytes;
220
221 /* Read inputs */
222 TEST_EQUAL( 0, mbedtls_test_read_mpi_core( &N, &n_limbs, input_N ) );
223 n_bytes = n_limbs * sizeof( mbedtls_mpi_uint );
224 a_bytes = input_A->len * sizeof( char );
225
226 /* Allocate the memory for intermediate data structures */
227 ASSERT_ALLOC( R, n_bytes );
228 ASSERT_ALLOC( r_buff, a_bytes );
229
230 /* Test that input's size is not greater to modulo's */
231 TEST_LE_U(a_bytes, n_bytes );
232
233 /* Init Structures */
234 mbedtls_mpi_mod_modulus_init( &m );
235 TEST_EQUAL( 0, mbedtls_mpi_mod_modulus_setup( &m, N, n_limbs, iendian,
236 MBEDTLS_MPI_MOD_REP_MONTGOMERY ) );
237
238 /* Enforcing p_limbs >= m->limbs */
239 TEST_EQUAL( 0, mbedtls_mpi_mod_residue_setup( &r, &m, R , n_limbs ) );
240
241 TEST_EQUAL( 0, mbedtls_mpi_mod_read( &r, &m, input_A->x, input_A->len ) );
242
243 TEST_EQUAL( 0,mbedtls_mpi_mod_write( &r, &m, r_buff, a_bytes ) );
244
245 ASSERT_COMPARE( r_buff, a_bytes, input_A->x, a_bytes );
246exit:
247 mbedtls_mpi_mod_modulus_free( &m );
248 mbedtls_free( N );
249 mbedtls_free( R );
250 mbedtls_free( r_buff );
251}
252/* END_CASE */
Janos Follath5933f692022-11-02 14:35:17 +0000253/* END MERGE SLOT 7 */
254
255/* BEGIN MERGE SLOT 8 */
256
257/* END MERGE SLOT 8 */
258
259/* BEGIN MERGE SLOT 9 */
260
261/* END MERGE SLOT 9 */
262
263/* BEGIN MERGE SLOT 10 */
264
265/* END MERGE SLOT 10 */