Kev Mann / mbed-dev-OS5_10_4

Important changes to repositories hosted on mbed.com

Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.

To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.

It is also possible to export all your personal repositories from the account settings page.

features/mbedtls/src/bignum.c@0:38ceb79fef03, 2018-11-28 (annotated)

Committer:
kevman
Date:
Wed Nov 28 15:10:15 2018 +0000
Revision:
0:38ceb79fef03
RTC modified

Who changed what in which revision?

UserRevisionLine numberNew contents of line
kevman 0:38ceb79fef03 1 /*
kevman 0:38ceb79fef03 2 * Multi-precision integer library
kevman 0:38ceb79fef03 3 *
kevman 0:38ceb79fef03 4 * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved
kevman 0:38ceb79fef03 5 * SPDX-License-Identifier: Apache-2.0
kevman 0:38ceb79fef03 6 *
kevman 0:38ceb79fef03 7 * Licensed under the Apache License, Version 2.0 (the "License"); you may
kevman 0:38ceb79fef03 8 * not use this file except in compliance with the License.
kevman 0:38ceb79fef03 9 * You may obtain a copy of the License at
kevman 0:38ceb79fef03 10 *
kevman 0:38ceb79fef03 11 * http://www.apache.org/licenses/LICENSE-2.0
kevman 0:38ceb79fef03 12 *
kevman 0:38ceb79fef03 13 * Unless required by applicable law or agreed to in writing, software
kevman 0:38ceb79fef03 14 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
kevman 0:38ceb79fef03 15 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
kevman 0:38ceb79fef03 16 * See the License for the specific language governing permissions and
kevman 0:38ceb79fef03 17 * limitations under the License.
kevman 0:38ceb79fef03 18 *
kevman 0:38ceb79fef03 19 * This file is part of mbed TLS (https://tls.mbed.org)
kevman 0:38ceb79fef03 20 */
kevman 0:38ceb79fef03 21
kevman 0:38ceb79fef03 22 /*
kevman 0:38ceb79fef03 23 * The following sources were referenced in the design of this Multi-precision
kevman 0:38ceb79fef03 24 * Integer library:
kevman 0:38ceb79fef03 25 *
kevman 0:38ceb79fef03 26 * [1] Handbook of Applied Cryptography - 1997
kevman 0:38ceb79fef03 27 * Menezes, van Oorschot and Vanstone
kevman 0:38ceb79fef03 28 *
kevman 0:38ceb79fef03 29 * [2] Multi-Precision Math
kevman 0:38ceb79fef03 30 * Tom St Denis
kevman 0:38ceb79fef03 31 * https://github.com/libtom/libtommath/blob/develop/tommath.pdf
kevman 0:38ceb79fef03 32 *
kevman 0:38ceb79fef03 33 * [3] GNU Multi-Precision Arithmetic Library
kevman 0:38ceb79fef03 34 * https://gmplib.org/manual/index.html
kevman 0:38ceb79fef03 35 *
kevman 0:38ceb79fef03 36 */
kevman 0:38ceb79fef03 37
kevman 0:38ceb79fef03 38 #if !defined(MBEDTLS_CONFIG_FILE)
kevman 0:38ceb79fef03 39 #include "mbedtls/config.h"
kevman 0:38ceb79fef03 40 #else
kevman 0:38ceb79fef03 41 #include MBEDTLS_CONFIG_FILE
kevman 0:38ceb79fef03 42 #endif
kevman 0:38ceb79fef03 43
kevman 0:38ceb79fef03 44 #if defined(MBEDTLS_BIGNUM_C)
kevman 0:38ceb79fef03 45
kevman 0:38ceb79fef03 46 #include "mbedtls/bignum.h"
kevman 0:38ceb79fef03 47 #include "mbedtls/bn_mul.h"
kevman 0:38ceb79fef03 48 #include "mbedtls/platform_util.h"
kevman 0:38ceb79fef03 49
kevman 0:38ceb79fef03 50 #include <string.h>
kevman 0:38ceb79fef03 51
kevman 0:38ceb79fef03 52 #if defined(MBEDTLS_PLATFORM_C)
kevman 0:38ceb79fef03 53 #include "mbedtls/platform.h"
kevman 0:38ceb79fef03 54 #else
kevman 0:38ceb79fef03 55 #include <stdio.h>
kevman 0:38ceb79fef03 56 #include <stdlib.h>
kevman 0:38ceb79fef03 57 #define mbedtls_printf printf
kevman 0:38ceb79fef03 58 #define mbedtls_calloc calloc
kevman 0:38ceb79fef03 59 #define mbedtls_free free
kevman 0:38ceb79fef03 60 #endif
kevman 0:38ceb79fef03 61
kevman 0:38ceb79fef03 62 #define ciL (sizeof(mbedtls_mpi_uint)) /* chars in limb */
kevman 0:38ceb79fef03 63 #define biL (ciL << 3) /* bits in limb */
kevman 0:38ceb79fef03 64 #define biH (ciL << 2) /* half limb size */
kevman 0:38ceb79fef03 65
kevman 0:38ceb79fef03 66 #define MPI_SIZE_T_MAX ( (size_t) -1 ) /* SIZE_T_MAX is not standard */
kevman 0:38ceb79fef03 67
kevman 0:38ceb79fef03 68 /*
kevman 0:38ceb79fef03 69 * Convert between bits/chars and number of limbs
kevman 0:38ceb79fef03 70 * Divide first in order to avoid potential overflows
kevman 0:38ceb79fef03 71 */
kevman 0:38ceb79fef03 72 #define BITS_TO_LIMBS(i) ( (i) / biL + ( (i) % biL != 0 ) )
kevman 0:38ceb79fef03 73 #define CHARS_TO_LIMBS(i) ( (i) / ciL + ( (i) % ciL != 0 ) )
kevman 0:38ceb79fef03 74
kevman 0:38ceb79fef03 75 /* Implementation that should never be optimized out by the compiler */
kevman 0:38ceb79fef03 76 static void mbedtls_mpi_zeroize( mbedtls_mpi_uint *v, size_t n )
kevman 0:38ceb79fef03 77 {
kevman 0:38ceb79fef03 78 mbedtls_platform_zeroize( v, ciL * n );
kevman 0:38ceb79fef03 79 }
kevman 0:38ceb79fef03 80
kevman 0:38ceb79fef03 81 /*
kevman 0:38ceb79fef03 82 * Initialize one MPI
kevman 0:38ceb79fef03 83 */
kevman 0:38ceb79fef03 84 void mbedtls_mpi_init( mbedtls_mpi *X )
kevman 0:38ceb79fef03 85 {
kevman 0:38ceb79fef03 86 if( X == NULL )
kevman 0:38ceb79fef03 87 return;
kevman 0:38ceb79fef03 88
kevman 0:38ceb79fef03 89 X->s = 1;
kevman 0:38ceb79fef03 90 X->n = 0;
kevman 0:38ceb79fef03 91 X->p = NULL;
kevman 0:38ceb79fef03 92 }
kevman 0:38ceb79fef03 93
kevman 0:38ceb79fef03 94 /*
kevman 0:38ceb79fef03 95 * Unallocate one MPI
kevman 0:38ceb79fef03 96 */
kevman 0:38ceb79fef03 97 void mbedtls_mpi_free( mbedtls_mpi *X )
kevman 0:38ceb79fef03 98 {
kevman 0:38ceb79fef03 99 if( X == NULL )
kevman 0:38ceb79fef03 100 return;
kevman 0:38ceb79fef03 101
kevman 0:38ceb79fef03 102 if( X->p != NULL )
kevman 0:38ceb79fef03 103 {
kevman 0:38ceb79fef03 104 mbedtls_mpi_zeroize( X->p, X->n );
kevman 0:38ceb79fef03 105 mbedtls_free( X->p );
kevman 0:38ceb79fef03 106 }
kevman 0:38ceb79fef03 107
kevman 0:38ceb79fef03 108 X->s = 1;
kevman 0:38ceb79fef03 109 X->n = 0;
kevman 0:38ceb79fef03 110 X->p = NULL;
kevman 0:38ceb79fef03 111 }
kevman 0:38ceb79fef03 112
kevman 0:38ceb79fef03 113 /*
kevman 0:38ceb79fef03 114 * Enlarge to the specified number of limbs
kevman 0:38ceb79fef03 115 */
kevman 0:38ceb79fef03 116 int mbedtls_mpi_grow( mbedtls_mpi *X, size_t nblimbs )
kevman 0:38ceb79fef03 117 {
kevman 0:38ceb79fef03 118 mbedtls_mpi_uint *p;
kevman 0:38ceb79fef03 119
kevman 0:38ceb79fef03 120 if( nblimbs > MBEDTLS_MPI_MAX_LIMBS )
kevman 0:38ceb79fef03 121 return( MBEDTLS_ERR_MPI_ALLOC_FAILED );
kevman 0:38ceb79fef03 122
kevman 0:38ceb79fef03 123 if( X->n < nblimbs )
kevman 0:38ceb79fef03 124 {
kevman 0:38ceb79fef03 125 if( ( p = (mbedtls_mpi_uint*)mbedtls_calloc( nblimbs, ciL ) ) == NULL )
kevman 0:38ceb79fef03 126 return( MBEDTLS_ERR_MPI_ALLOC_FAILED );
kevman 0:38ceb79fef03 127
kevman 0:38ceb79fef03 128 if( X->p != NULL )
kevman 0:38ceb79fef03 129 {
kevman 0:38ceb79fef03 130 memcpy( p, X->p, X->n * ciL );
kevman 0:38ceb79fef03 131 mbedtls_mpi_zeroize( X->p, X->n );
kevman 0:38ceb79fef03 132 mbedtls_free( X->p );
kevman 0:38ceb79fef03 133 }
kevman 0:38ceb79fef03 134
kevman 0:38ceb79fef03 135 X->n = nblimbs;
kevman 0:38ceb79fef03 136 X->p = p;
kevman 0:38ceb79fef03 137 }
kevman 0:38ceb79fef03 138
kevman 0:38ceb79fef03 139 return( 0 );
kevman 0:38ceb79fef03 140 }
kevman 0:38ceb79fef03 141
kevman 0:38ceb79fef03 142 /*
kevman 0:38ceb79fef03 143 * Resize down as much as possible,
kevman 0:38ceb79fef03 144 * while keeping at least the specified number of limbs
kevman 0:38ceb79fef03 145 */
kevman 0:38ceb79fef03 146 int mbedtls_mpi_shrink( mbedtls_mpi *X, size_t nblimbs )
kevman 0:38ceb79fef03 147 {
kevman 0:38ceb79fef03 148 mbedtls_mpi_uint *p;
kevman 0:38ceb79fef03 149 size_t i;
kevman 0:38ceb79fef03 150
kevman 0:38ceb79fef03 151 /* Actually resize up in this case */
kevman 0:38ceb79fef03 152 if( X->n <= nblimbs )
kevman 0:38ceb79fef03 153 return( mbedtls_mpi_grow( X, nblimbs ) );
kevman 0:38ceb79fef03 154
kevman 0:38ceb79fef03 155 for( i = X->n - 1; i > 0; i-- )
kevman 0:38ceb79fef03 156 if( X->p[i] != 0 )
kevman 0:38ceb79fef03 157 break;
kevman 0:38ceb79fef03 158 i++;
kevman 0:38ceb79fef03 159
kevman 0:38ceb79fef03 160 if( i < nblimbs )
kevman 0:38ceb79fef03 161 i = nblimbs;
kevman 0:38ceb79fef03 162
kevman 0:38ceb79fef03 163 if( ( p = (mbedtls_mpi_uint*)mbedtls_calloc( i, ciL ) ) == NULL )
kevman 0:38ceb79fef03 164 return( MBEDTLS_ERR_MPI_ALLOC_FAILED );
kevman 0:38ceb79fef03 165
kevman 0:38ceb79fef03 166 if( X->p != NULL )
kevman 0:38ceb79fef03 167 {
kevman 0:38ceb79fef03 168 memcpy( p, X->p, i * ciL );
kevman 0:38ceb79fef03 169 mbedtls_mpi_zeroize( X->p, X->n );
kevman 0:38ceb79fef03 170 mbedtls_free( X->p );
kevman 0:38ceb79fef03 171 }
kevman 0:38ceb79fef03 172
kevman 0:38ceb79fef03 173 X->n = i;
kevman 0:38ceb79fef03 174 X->p = p;
kevman 0:38ceb79fef03 175
kevman 0:38ceb79fef03 176 return( 0 );
kevman 0:38ceb79fef03 177 }
kevman 0:38ceb79fef03 178
kevman 0:38ceb79fef03 179 /*
kevman 0:38ceb79fef03 180 * Copy the contents of Y into X
kevman 0:38ceb79fef03 181 */
kevman 0:38ceb79fef03 182 int mbedtls_mpi_copy( mbedtls_mpi *X, const mbedtls_mpi *Y )
kevman 0:38ceb79fef03 183 {
kevman 0:38ceb79fef03 184 int ret = 0;
kevman 0:38ceb79fef03 185 size_t i;
kevman 0:38ceb79fef03 186
kevman 0:38ceb79fef03 187 if( X == Y )
kevman 0:38ceb79fef03 188 return( 0 );
kevman 0:38ceb79fef03 189
kevman 0:38ceb79fef03 190 if( Y->p == NULL )
kevman 0:38ceb79fef03 191 {
kevman 0:38ceb79fef03 192 mbedtls_mpi_free( X );
kevman 0:38ceb79fef03 193 return( 0 );
kevman 0:38ceb79fef03 194 }
kevman 0:38ceb79fef03 195
kevman 0:38ceb79fef03 196 for( i = Y->n - 1; i > 0; i-- )
kevman 0:38ceb79fef03 197 if( Y->p[i] != 0 )
kevman 0:38ceb79fef03 198 break;
kevman 0:38ceb79fef03 199 i++;
kevman 0:38ceb79fef03 200
kevman 0:38ceb79fef03 201 X->s = Y->s;
kevman 0:38ceb79fef03 202
kevman 0:38ceb79fef03 203 if( X->n < i )
kevman 0:38ceb79fef03 204 {
kevman 0:38ceb79fef03 205 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, i ) );
kevman 0:38ceb79fef03 206 }
kevman 0:38ceb79fef03 207 else
kevman 0:38ceb79fef03 208 {
kevman 0:38ceb79fef03 209 memset( X->p + i, 0, ( X->n - i ) * ciL );
kevman 0:38ceb79fef03 210 }
kevman 0:38ceb79fef03 211
kevman 0:38ceb79fef03 212 memcpy( X->p, Y->p, i * ciL );
kevman 0:38ceb79fef03 213
kevman 0:38ceb79fef03 214 cleanup:
kevman 0:38ceb79fef03 215
kevman 0:38ceb79fef03 216 return( ret );
kevman 0:38ceb79fef03 217 }
kevman 0:38ceb79fef03 218
kevman 0:38ceb79fef03 219 /*
kevman 0:38ceb79fef03 220 * Swap the contents of X and Y
kevman 0:38ceb79fef03 221 */
kevman 0:38ceb79fef03 222 void mbedtls_mpi_swap( mbedtls_mpi *X, mbedtls_mpi *Y )
kevman 0:38ceb79fef03 223 {
kevman 0:38ceb79fef03 224 mbedtls_mpi T;
kevman 0:38ceb79fef03 225
kevman 0:38ceb79fef03 226 memcpy( &T, X, sizeof( mbedtls_mpi ) );
kevman 0:38ceb79fef03 227 memcpy( X, Y, sizeof( mbedtls_mpi ) );
kevman 0:38ceb79fef03 228 memcpy( Y, &T, sizeof( mbedtls_mpi ) );
kevman 0:38ceb79fef03 229 }
kevman 0:38ceb79fef03 230
kevman 0:38ceb79fef03 231 /*
kevman 0:38ceb79fef03 232 * Conditionally assign X = Y, without leaking information
kevman 0:38ceb79fef03 233 * about whether the assignment was made or not.
kevman 0:38ceb79fef03 234 * (Leaking information about the respective sizes of X and Y is ok however.)
kevman 0:38ceb79fef03 235 */
kevman 0:38ceb79fef03 236 int mbedtls_mpi_safe_cond_assign( mbedtls_mpi *X, const mbedtls_mpi *Y, unsigned char assign )
kevman 0:38ceb79fef03 237 {
kevman 0:38ceb79fef03 238 int ret = 0;
kevman 0:38ceb79fef03 239 size_t i;
kevman 0:38ceb79fef03 240
kevman 0:38ceb79fef03 241 /* make sure assign is 0 or 1 in a time-constant manner */
kevman 0:38ceb79fef03 242 assign = (assign | (unsigned char)-assign) >> 7;
kevman 0:38ceb79fef03 243
kevman 0:38ceb79fef03 244 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, Y->n ) );
kevman 0:38ceb79fef03 245
kevman 0:38ceb79fef03 246 X->s = X->s * ( 1 - assign ) + Y->s * assign;
kevman 0:38ceb79fef03 247
kevman 0:38ceb79fef03 248 for( i = 0; i < Y->n; i++ )
kevman 0:38ceb79fef03 249 X->p[i] = X->p[i] * ( 1 - assign ) + Y->p[i] * assign;
kevman 0:38ceb79fef03 250
kevman 0:38ceb79fef03 251 for( ; i < X->n; i++ )
kevman 0:38ceb79fef03 252 X->p[i] *= ( 1 - assign );
kevman 0:38ceb79fef03 253
kevman 0:38ceb79fef03 254 cleanup:
kevman 0:38ceb79fef03 255 return( ret );
kevman 0:38ceb79fef03 256 }
kevman 0:38ceb79fef03 257
kevman 0:38ceb79fef03 258 /*
kevman 0:38ceb79fef03 259 * Conditionally swap X and Y, without leaking information
kevman 0:38ceb79fef03 260 * about whether the swap was made or not.
kevman 0:38ceb79fef03 261 * Here it is not ok to simply swap the pointers, which whould lead to
kevman 0:38ceb79fef03 262 * different memory access patterns when X and Y are used afterwards.
kevman 0:38ceb79fef03 263 */
kevman 0:38ceb79fef03 264 int mbedtls_mpi_safe_cond_swap( mbedtls_mpi *X, mbedtls_mpi *Y, unsigned char swap )
kevman 0:38ceb79fef03 265 {
kevman 0:38ceb79fef03 266 int ret, s;
kevman 0:38ceb79fef03 267 size_t i;
kevman 0:38ceb79fef03 268 mbedtls_mpi_uint tmp;
kevman 0:38ceb79fef03 269
kevman 0:38ceb79fef03 270 if( X == Y )
kevman 0:38ceb79fef03 271 return( 0 );
kevman 0:38ceb79fef03 272
kevman 0:38ceb79fef03 273 /* make sure swap is 0 or 1 in a time-constant manner */
kevman 0:38ceb79fef03 274 swap = (swap | (unsigned char)-swap) >> 7;
kevman 0:38ceb79fef03 275
kevman 0:38ceb79fef03 276 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, Y->n ) );
kevman 0:38ceb79fef03 277 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( Y, X->n ) );
kevman 0:38ceb79fef03 278
kevman 0:38ceb79fef03 279 s = X->s;
kevman 0:38ceb79fef03 280 X->s = X->s * ( 1 - swap ) + Y->s * swap;
kevman 0:38ceb79fef03 281 Y->s = Y->s * ( 1 - swap ) + s * swap;
kevman 0:38ceb79fef03 282
kevman 0:38ceb79fef03 283
kevman 0:38ceb79fef03 284 for( i = 0; i < X->n; i++ )
kevman 0:38ceb79fef03 285 {
kevman 0:38ceb79fef03 286 tmp = X->p[i];
kevman 0:38ceb79fef03 287 X->p[i] = X->p[i] * ( 1 - swap ) + Y->p[i] * swap;
kevman 0:38ceb79fef03 288 Y->p[i] = Y->p[i] * ( 1 - swap ) + tmp * swap;
kevman 0:38ceb79fef03 289 }
kevman 0:38ceb79fef03 290
kevman 0:38ceb79fef03 291 cleanup:
kevman 0:38ceb79fef03 292 return( ret );
kevman 0:38ceb79fef03 293 }
kevman 0:38ceb79fef03 294
kevman 0:38ceb79fef03 295 /*
kevman 0:38ceb79fef03 296 * Set value from integer
kevman 0:38ceb79fef03 297 */
kevman 0:38ceb79fef03 298 int mbedtls_mpi_lset( mbedtls_mpi *X, mbedtls_mpi_sint z )
kevman 0:38ceb79fef03 299 {
kevman 0:38ceb79fef03 300 int ret;
kevman 0:38ceb79fef03 301
kevman 0:38ceb79fef03 302 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, 1 ) );
kevman 0:38ceb79fef03 303 memset( X->p, 0, X->n * ciL );
kevman 0:38ceb79fef03 304
kevman 0:38ceb79fef03 305 X->p[0] = ( z < 0 ) ? -z : z;
kevman 0:38ceb79fef03 306 X->s = ( z < 0 ) ? -1 : 1;
kevman 0:38ceb79fef03 307
kevman 0:38ceb79fef03 308 cleanup:
kevman 0:38ceb79fef03 309
kevman 0:38ceb79fef03 310 return( ret );
kevman 0:38ceb79fef03 311 }
kevman 0:38ceb79fef03 312
kevman 0:38ceb79fef03 313 /*
kevman 0:38ceb79fef03 314 * Get a specific bit
kevman 0:38ceb79fef03 315 */
kevman 0:38ceb79fef03 316 int mbedtls_mpi_get_bit( const mbedtls_mpi *X, size_t pos )
kevman 0:38ceb79fef03 317 {
kevman 0:38ceb79fef03 318 if( X->n * biL <= pos )
kevman 0:38ceb79fef03 319 return( 0 );
kevman 0:38ceb79fef03 320
kevman 0:38ceb79fef03 321 return( ( X->p[pos / biL] >> ( pos % biL ) ) & 0x01 );
kevman 0:38ceb79fef03 322 }
kevman 0:38ceb79fef03 323
kevman 0:38ceb79fef03 324 /*
kevman 0:38ceb79fef03 325 * Set a bit to a specific value of 0 or 1
kevman 0:38ceb79fef03 326 */
kevman 0:38ceb79fef03 327 int mbedtls_mpi_set_bit( mbedtls_mpi *X, size_t pos, unsigned char val )
kevman 0:38ceb79fef03 328 {
kevman 0:38ceb79fef03 329 int ret = 0;
kevman 0:38ceb79fef03 330 size_t off = pos / biL;
kevman 0:38ceb79fef03 331 size_t idx = pos % biL;
kevman 0:38ceb79fef03 332
kevman 0:38ceb79fef03 333 if( val != 0 && val != 1 )
kevman 0:38ceb79fef03 334 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 335
kevman 0:38ceb79fef03 336 if( X->n * biL <= pos )
kevman 0:38ceb79fef03 337 {
kevman 0:38ceb79fef03 338 if( val == 0 )
kevman 0:38ceb79fef03 339 return( 0 );
kevman 0:38ceb79fef03 340
kevman 0:38ceb79fef03 341 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, off + 1 ) );
kevman 0:38ceb79fef03 342 }
kevman 0:38ceb79fef03 343
kevman 0:38ceb79fef03 344 X->p[off] &= ~( (mbedtls_mpi_uint) 0x01 << idx );
kevman 0:38ceb79fef03 345 X->p[off] |= (mbedtls_mpi_uint) val << idx;
kevman 0:38ceb79fef03 346
kevman 0:38ceb79fef03 347 cleanup:
kevman 0:38ceb79fef03 348
kevman 0:38ceb79fef03 349 return( ret );
kevman 0:38ceb79fef03 350 }
kevman 0:38ceb79fef03 351
kevman 0:38ceb79fef03 352 /*
kevman 0:38ceb79fef03 353 * Return the number of less significant zero-bits
kevman 0:38ceb79fef03 354 */
kevman 0:38ceb79fef03 355 size_t mbedtls_mpi_lsb( const mbedtls_mpi *X )
kevman 0:38ceb79fef03 356 {
kevman 0:38ceb79fef03 357 size_t i, j, count = 0;
kevman 0:38ceb79fef03 358
kevman 0:38ceb79fef03 359 for( i = 0; i < X->n; i++ )
kevman 0:38ceb79fef03 360 for( j = 0; j < biL; j++, count++ )
kevman 0:38ceb79fef03 361 if( ( ( X->p[i] >> j ) & 1 ) != 0 )
kevman 0:38ceb79fef03 362 return( count );
kevman 0:38ceb79fef03 363
kevman 0:38ceb79fef03 364 return( 0 );
kevman 0:38ceb79fef03 365 }
kevman 0:38ceb79fef03 366
kevman 0:38ceb79fef03 367 /*
kevman 0:38ceb79fef03 368 * Count leading zero bits in a given integer
kevman 0:38ceb79fef03 369 */
kevman 0:38ceb79fef03 370 static size_t mbedtls_clz( const mbedtls_mpi_uint x )
kevman 0:38ceb79fef03 371 {
kevman 0:38ceb79fef03 372 size_t j;
kevman 0:38ceb79fef03 373 mbedtls_mpi_uint mask = (mbedtls_mpi_uint) 1 << (biL - 1);
kevman 0:38ceb79fef03 374
kevman 0:38ceb79fef03 375 for( j = 0; j < biL; j++ )
kevman 0:38ceb79fef03 376 {
kevman 0:38ceb79fef03 377 if( x & mask ) break;
kevman 0:38ceb79fef03 378
kevman 0:38ceb79fef03 379 mask >>= 1;
kevman 0:38ceb79fef03 380 }
kevman 0:38ceb79fef03 381
kevman 0:38ceb79fef03 382 return j;
kevman 0:38ceb79fef03 383 }
kevman 0:38ceb79fef03 384
kevman 0:38ceb79fef03 385 /*
kevman 0:38ceb79fef03 386 * Return the number of bits
kevman 0:38ceb79fef03 387 */
kevman 0:38ceb79fef03 388 size_t mbedtls_mpi_bitlen( const mbedtls_mpi *X )
kevman 0:38ceb79fef03 389 {
kevman 0:38ceb79fef03 390 size_t i, j;
kevman 0:38ceb79fef03 391
kevman 0:38ceb79fef03 392 if( X->n == 0 )
kevman 0:38ceb79fef03 393 return( 0 );
kevman 0:38ceb79fef03 394
kevman 0:38ceb79fef03 395 for( i = X->n - 1; i > 0; i-- )
kevman 0:38ceb79fef03 396 if( X->p[i] != 0 )
kevman 0:38ceb79fef03 397 break;
kevman 0:38ceb79fef03 398
kevman 0:38ceb79fef03 399 j = biL - mbedtls_clz( X->p[i] );
kevman 0:38ceb79fef03 400
kevman 0:38ceb79fef03 401 return( ( i * biL ) + j );
kevman 0:38ceb79fef03 402 }
kevman 0:38ceb79fef03 403
kevman 0:38ceb79fef03 404 /*
kevman 0:38ceb79fef03 405 * Return the total size in bytes
kevman 0:38ceb79fef03 406 */
kevman 0:38ceb79fef03 407 size_t mbedtls_mpi_size( const mbedtls_mpi *X )
kevman 0:38ceb79fef03 408 {
kevman 0:38ceb79fef03 409 return( ( mbedtls_mpi_bitlen( X ) + 7 ) >> 3 );
kevman 0:38ceb79fef03 410 }
kevman 0:38ceb79fef03 411
kevman 0:38ceb79fef03 412 /*
kevman 0:38ceb79fef03 413 * Convert an ASCII character to digit value
kevman 0:38ceb79fef03 414 */
kevman 0:38ceb79fef03 415 static int mpi_get_digit( mbedtls_mpi_uint *d, int radix, char c )
kevman 0:38ceb79fef03 416 {
kevman 0:38ceb79fef03 417 *d = 255;
kevman 0:38ceb79fef03 418
kevman 0:38ceb79fef03 419 if( c >= 0x30 && c <= 0x39 ) *d = c - 0x30;
kevman 0:38ceb79fef03 420 if( c >= 0x41 && c <= 0x46 ) *d = c - 0x37;
kevman 0:38ceb79fef03 421 if( c >= 0x61 && c <= 0x66 ) *d = c - 0x57;
kevman 0:38ceb79fef03 422
kevman 0:38ceb79fef03 423 if( *d >= (mbedtls_mpi_uint) radix )
kevman 0:38ceb79fef03 424 return( MBEDTLS_ERR_MPI_INVALID_CHARACTER );
kevman 0:38ceb79fef03 425
kevman 0:38ceb79fef03 426 return( 0 );
kevman 0:38ceb79fef03 427 }
kevman 0:38ceb79fef03 428
kevman 0:38ceb79fef03 429 /*
kevman 0:38ceb79fef03 430 * Import from an ASCII string
kevman 0:38ceb79fef03 431 */
kevman 0:38ceb79fef03 432 int mbedtls_mpi_read_string( mbedtls_mpi *X, int radix, const char *s )
kevman 0:38ceb79fef03 433 {
kevman 0:38ceb79fef03 434 int ret;
kevman 0:38ceb79fef03 435 size_t i, j, slen, n;
kevman 0:38ceb79fef03 436 mbedtls_mpi_uint d;
kevman 0:38ceb79fef03 437 mbedtls_mpi T;
kevman 0:38ceb79fef03 438
kevman 0:38ceb79fef03 439 if( radix < 2 || radix > 16 )
kevman 0:38ceb79fef03 440 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 441
kevman 0:38ceb79fef03 442 mbedtls_mpi_init( &T );
kevman 0:38ceb79fef03 443
kevman 0:38ceb79fef03 444 slen = strlen( s );
kevman 0:38ceb79fef03 445
kevman 0:38ceb79fef03 446 if( radix == 16 )
kevman 0:38ceb79fef03 447 {
kevman 0:38ceb79fef03 448 if( slen > MPI_SIZE_T_MAX >> 2 )
kevman 0:38ceb79fef03 449 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 450
kevman 0:38ceb79fef03 451 n = BITS_TO_LIMBS( slen << 2 );
kevman 0:38ceb79fef03 452
kevman 0:38ceb79fef03 453 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, n ) );
kevman 0:38ceb79fef03 454 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( X, 0 ) );
kevman 0:38ceb79fef03 455
kevman 0:38ceb79fef03 456 for( i = slen, j = 0; i > 0; i--, j++ )
kevman 0:38ceb79fef03 457 {
kevman 0:38ceb79fef03 458 if( i == 1 && s[i - 1] == '-' )
kevman 0:38ceb79fef03 459 {
kevman 0:38ceb79fef03 460 X->s = -1;
kevman 0:38ceb79fef03 461 break;
kevman 0:38ceb79fef03 462 }
kevman 0:38ceb79fef03 463
kevman 0:38ceb79fef03 464 MBEDTLS_MPI_CHK( mpi_get_digit( &d, radix, s[i - 1] ) );
kevman 0:38ceb79fef03 465 X->p[j / ( 2 * ciL )] |= d << ( ( j % ( 2 * ciL ) ) << 2 );
kevman 0:38ceb79fef03 466 }
kevman 0:38ceb79fef03 467 }
kevman 0:38ceb79fef03 468 else
kevman 0:38ceb79fef03 469 {
kevman 0:38ceb79fef03 470 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( X, 0 ) );
kevman 0:38ceb79fef03 471
kevman 0:38ceb79fef03 472 for( i = 0; i < slen; i++ )
kevman 0:38ceb79fef03 473 {
kevman 0:38ceb79fef03 474 if( i == 0 && s[i] == '-' )
kevman 0:38ceb79fef03 475 {
kevman 0:38ceb79fef03 476 X->s = -1;
kevman 0:38ceb79fef03 477 continue;
kevman 0:38ceb79fef03 478 }
kevman 0:38ceb79fef03 479
kevman 0:38ceb79fef03 480 MBEDTLS_MPI_CHK( mpi_get_digit( &d, radix, s[i] ) );
kevman 0:38ceb79fef03 481 MBEDTLS_MPI_CHK( mbedtls_mpi_mul_int( &T, X, radix ) );
kevman 0:38ceb79fef03 482
kevman 0:38ceb79fef03 483 if( X->s == 1 )
kevman 0:38ceb79fef03 484 {
kevman 0:38ceb79fef03 485 MBEDTLS_MPI_CHK( mbedtls_mpi_add_int( X, &T, d ) );
kevman 0:38ceb79fef03 486 }
kevman 0:38ceb79fef03 487 else
kevman 0:38ceb79fef03 488 {
kevman 0:38ceb79fef03 489 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_int( X, &T, d ) );
kevman 0:38ceb79fef03 490 }
kevman 0:38ceb79fef03 491 }
kevman 0:38ceb79fef03 492 }
kevman 0:38ceb79fef03 493
kevman 0:38ceb79fef03 494 cleanup:
kevman 0:38ceb79fef03 495
kevman 0:38ceb79fef03 496 mbedtls_mpi_free( &T );
kevman 0:38ceb79fef03 497
kevman 0:38ceb79fef03 498 return( ret );
kevman 0:38ceb79fef03 499 }
kevman 0:38ceb79fef03 500
kevman 0:38ceb79fef03 501 /*
kevman 0:38ceb79fef03 502 * Helper to write the digits high-order first
kevman 0:38ceb79fef03 503 */
kevman 0:38ceb79fef03 504 static int mpi_write_hlp( mbedtls_mpi *X, int radix, char **p )
kevman 0:38ceb79fef03 505 {
kevman 0:38ceb79fef03 506 int ret;
kevman 0:38ceb79fef03 507 mbedtls_mpi_uint r;
kevman 0:38ceb79fef03 508
kevman 0:38ceb79fef03 509 if( radix < 2 || radix > 16 )
kevman 0:38ceb79fef03 510 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 511
kevman 0:38ceb79fef03 512 MBEDTLS_MPI_CHK( mbedtls_mpi_mod_int( &r, X, radix ) );
kevman 0:38ceb79fef03 513 MBEDTLS_MPI_CHK( mbedtls_mpi_div_int( X, NULL, X, radix ) );
kevman 0:38ceb79fef03 514
kevman 0:38ceb79fef03 515 if( mbedtls_mpi_cmp_int( X, 0 ) != 0 )
kevman 0:38ceb79fef03 516 MBEDTLS_MPI_CHK( mpi_write_hlp( X, radix, p ) );
kevman 0:38ceb79fef03 517
kevman 0:38ceb79fef03 518 if( r < 10 )
kevman 0:38ceb79fef03 519 *(*p)++ = (char)( r + 0x30 );
kevman 0:38ceb79fef03 520 else
kevman 0:38ceb79fef03 521 *(*p)++ = (char)( r + 0x37 );
kevman 0:38ceb79fef03 522
kevman 0:38ceb79fef03 523 cleanup:
kevman 0:38ceb79fef03 524
kevman 0:38ceb79fef03 525 return( ret );
kevman 0:38ceb79fef03 526 }
kevman 0:38ceb79fef03 527
kevman 0:38ceb79fef03 528 /*
kevman 0:38ceb79fef03 529 * Export into an ASCII string
kevman 0:38ceb79fef03 530 */
kevman 0:38ceb79fef03 531 int mbedtls_mpi_write_string( const mbedtls_mpi *X, int radix,
kevman 0:38ceb79fef03 532 char *buf, size_t buflen, size_t *olen )
kevman 0:38ceb79fef03 533 {
kevman 0:38ceb79fef03 534 int ret = 0;
kevman 0:38ceb79fef03 535 size_t n;
kevman 0:38ceb79fef03 536 char *p;
kevman 0:38ceb79fef03 537 mbedtls_mpi T;
kevman 0:38ceb79fef03 538
kevman 0:38ceb79fef03 539 if( radix < 2 || radix > 16 )
kevman 0:38ceb79fef03 540 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 541
kevman 0:38ceb79fef03 542 n = mbedtls_mpi_bitlen( X );
kevman 0:38ceb79fef03 543 if( radix >= 4 ) n >>= 1;
kevman 0:38ceb79fef03 544 if( radix >= 16 ) n >>= 1;
kevman 0:38ceb79fef03 545 /*
kevman 0:38ceb79fef03 546 * Round up the buffer length to an even value to ensure that there is
kevman 0:38ceb79fef03 547 * enough room for hexadecimal values that can be represented in an odd
kevman 0:38ceb79fef03 548 * number of digits.
kevman 0:38ceb79fef03 549 */
kevman 0:38ceb79fef03 550 n += 3 + ( ( n + 1 ) & 1 );
kevman 0:38ceb79fef03 551
kevman 0:38ceb79fef03 552 if( buflen < n )
kevman 0:38ceb79fef03 553 {
kevman 0:38ceb79fef03 554 *olen = n;
kevman 0:38ceb79fef03 555 return( MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL );
kevman 0:38ceb79fef03 556 }
kevman 0:38ceb79fef03 557
kevman 0:38ceb79fef03 558 p = buf;
kevman 0:38ceb79fef03 559 mbedtls_mpi_init( &T );
kevman 0:38ceb79fef03 560
kevman 0:38ceb79fef03 561 if( X->s == -1 )
kevman 0:38ceb79fef03 562 *p++ = '-';
kevman 0:38ceb79fef03 563
kevman 0:38ceb79fef03 564 if( radix == 16 )
kevman 0:38ceb79fef03 565 {
kevman 0:38ceb79fef03 566 int c;
kevman 0:38ceb79fef03 567 size_t i, j, k;
kevman 0:38ceb79fef03 568
kevman 0:38ceb79fef03 569 for( i = X->n, k = 0; i > 0; i-- )
kevman 0:38ceb79fef03 570 {
kevman 0:38ceb79fef03 571 for( j = ciL; j > 0; j-- )
kevman 0:38ceb79fef03 572 {
kevman 0:38ceb79fef03 573 c = ( X->p[i - 1] >> ( ( j - 1 ) << 3) ) & 0xFF;
kevman 0:38ceb79fef03 574
kevman 0:38ceb79fef03 575 if( c == 0 && k == 0 && ( i + j ) != 2 )
kevman 0:38ceb79fef03 576 continue;
kevman 0:38ceb79fef03 577
kevman 0:38ceb79fef03 578 *(p++) = "0123456789ABCDEF" [c / 16];
kevman 0:38ceb79fef03 579 *(p++) = "0123456789ABCDEF" [c % 16];
kevman 0:38ceb79fef03 580 k = 1;
kevman 0:38ceb79fef03 581 }
kevman 0:38ceb79fef03 582 }
kevman 0:38ceb79fef03 583 }
kevman 0:38ceb79fef03 584 else
kevman 0:38ceb79fef03 585 {
kevman 0:38ceb79fef03 586 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &T, X ) );
kevman 0:38ceb79fef03 587
kevman 0:38ceb79fef03 588 if( T.s == -1 )
kevman 0:38ceb79fef03 589 T.s = 1;
kevman 0:38ceb79fef03 590
kevman 0:38ceb79fef03 591 MBEDTLS_MPI_CHK( mpi_write_hlp( &T, radix, &p ) );
kevman 0:38ceb79fef03 592 }
kevman 0:38ceb79fef03 593
kevman 0:38ceb79fef03 594 *p++ = '\0';
kevman 0:38ceb79fef03 595 *olen = p - buf;
kevman 0:38ceb79fef03 596
kevman 0:38ceb79fef03 597 cleanup:
kevman 0:38ceb79fef03 598
kevman 0:38ceb79fef03 599 mbedtls_mpi_free( &T );
kevman 0:38ceb79fef03 600
kevman 0:38ceb79fef03 601 return( ret );
kevman 0:38ceb79fef03 602 }
kevman 0:38ceb79fef03 603
kevman 0:38ceb79fef03 604 #if defined(MBEDTLS_FS_IO)
kevman 0:38ceb79fef03 605 /*
kevman 0:38ceb79fef03 606 * Read X from an opened file
kevman 0:38ceb79fef03 607 */
kevman 0:38ceb79fef03 608 int mbedtls_mpi_read_file( mbedtls_mpi *X, int radix, FILE *fin )
kevman 0:38ceb79fef03 609 {
kevman 0:38ceb79fef03 610 mbedtls_mpi_uint d;
kevman 0:38ceb79fef03 611 size_t slen;
kevman 0:38ceb79fef03 612 char *p;
kevman 0:38ceb79fef03 613 /*
kevman 0:38ceb79fef03 614 * Buffer should have space for (short) label and decimal formatted MPI,
kevman 0:38ceb79fef03 615 * newline characters and '\0'
kevman 0:38ceb79fef03 616 */
kevman 0:38ceb79fef03 617 char s[ MBEDTLS_MPI_RW_BUFFER_SIZE ];
kevman 0:38ceb79fef03 618
kevman 0:38ceb79fef03 619 memset( s, 0, sizeof( s ) );
kevman 0:38ceb79fef03 620 if( fgets( s, sizeof( s ) - 1, fin ) == NULL )
kevman 0:38ceb79fef03 621 return( MBEDTLS_ERR_MPI_FILE_IO_ERROR );
kevman 0:38ceb79fef03 622
kevman 0:38ceb79fef03 623 slen = strlen( s );
kevman 0:38ceb79fef03 624 if( slen == sizeof( s ) - 2 )
kevman 0:38ceb79fef03 625 return( MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL );
kevman 0:38ceb79fef03 626
kevman 0:38ceb79fef03 627 if( slen > 0 && s[slen - 1] == '\n' ) { slen--; s[slen] = '\0'; }
kevman 0:38ceb79fef03 628 if( slen > 0 && s[slen - 1] == '\r' ) { slen--; s[slen] = '\0'; }
kevman 0:38ceb79fef03 629
kevman 0:38ceb79fef03 630 p = s + slen;
kevman 0:38ceb79fef03 631 while( p-- > s )
kevman 0:38ceb79fef03 632 if( mpi_get_digit( &d, radix, *p ) != 0 )
kevman 0:38ceb79fef03 633 break;
kevman 0:38ceb79fef03 634
kevman 0:38ceb79fef03 635 return( mbedtls_mpi_read_string( X, radix, p + 1 ) );
kevman 0:38ceb79fef03 636 }
kevman 0:38ceb79fef03 637
kevman 0:38ceb79fef03 638 /*
kevman 0:38ceb79fef03 639 * Write X into an opened file (or stdout if fout == NULL)
kevman 0:38ceb79fef03 640 */
kevman 0:38ceb79fef03 641 int mbedtls_mpi_write_file( const char *p, const mbedtls_mpi *X, int radix, FILE *fout )
kevman 0:38ceb79fef03 642 {
kevman 0:38ceb79fef03 643 int ret;
kevman 0:38ceb79fef03 644 size_t n, slen, plen;
kevman 0:38ceb79fef03 645 /*
kevman 0:38ceb79fef03 646 * Buffer should have space for (short) label and decimal formatted MPI,
kevman 0:38ceb79fef03 647 * newline characters and '\0'
kevman 0:38ceb79fef03 648 */
kevman 0:38ceb79fef03 649 char s[ MBEDTLS_MPI_RW_BUFFER_SIZE ];
kevman 0:38ceb79fef03 650
kevman 0:38ceb79fef03 651 memset( s, 0, sizeof( s ) );
kevman 0:38ceb79fef03 652
kevman 0:38ceb79fef03 653 MBEDTLS_MPI_CHK( mbedtls_mpi_write_string( X, radix, s, sizeof( s ) - 2, &n ) );
kevman 0:38ceb79fef03 654
kevman 0:38ceb79fef03 655 if( p == NULL ) p = "";
kevman 0:38ceb79fef03 656
kevman 0:38ceb79fef03 657 plen = strlen( p );
kevman 0:38ceb79fef03 658 slen = strlen( s );
kevman 0:38ceb79fef03 659 s[slen++] = '\r';
kevman 0:38ceb79fef03 660 s[slen++] = '\n';
kevman 0:38ceb79fef03 661
kevman 0:38ceb79fef03 662 if( fout != NULL )
kevman 0:38ceb79fef03 663 {
kevman 0:38ceb79fef03 664 if( fwrite( p, 1, plen, fout ) != plen ||
kevman 0:38ceb79fef03 665 fwrite( s, 1, slen, fout ) != slen )
kevman 0:38ceb79fef03 666 return( MBEDTLS_ERR_MPI_FILE_IO_ERROR );
kevman 0:38ceb79fef03 667 }
kevman 0:38ceb79fef03 668 else
kevman 0:38ceb79fef03 669 mbedtls_printf( "%s%s", p, s );
kevman 0:38ceb79fef03 670
kevman 0:38ceb79fef03 671 cleanup:
kevman 0:38ceb79fef03 672
kevman 0:38ceb79fef03 673 return( ret );
kevman 0:38ceb79fef03 674 }
kevman 0:38ceb79fef03 675 #endif /* MBEDTLS_FS_IO */
kevman 0:38ceb79fef03 676
kevman 0:38ceb79fef03 677 /*
kevman 0:38ceb79fef03 678 * Import X from unsigned binary data, big endian
kevman 0:38ceb79fef03 679 */
kevman 0:38ceb79fef03 680 int mbedtls_mpi_read_binary( mbedtls_mpi *X, const unsigned char *buf, size_t buflen )
kevman 0:38ceb79fef03 681 {
kevman 0:38ceb79fef03 682 int ret;
kevman 0:38ceb79fef03 683 size_t i, j;
kevman 0:38ceb79fef03 684 size_t const limbs = CHARS_TO_LIMBS( buflen );
kevman 0:38ceb79fef03 685
kevman 0:38ceb79fef03 686 /* Ensure that target MPI has exactly the necessary number of limbs */
kevman 0:38ceb79fef03 687 if( X->n != limbs )
kevman 0:38ceb79fef03 688 {
kevman 0:38ceb79fef03 689 mbedtls_mpi_free( X );
kevman 0:38ceb79fef03 690 mbedtls_mpi_init( X );
kevman 0:38ceb79fef03 691 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, limbs ) );
kevman 0:38ceb79fef03 692 }
kevman 0:38ceb79fef03 693
kevman 0:38ceb79fef03 694 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( X, 0 ) );
kevman 0:38ceb79fef03 695
kevman 0:38ceb79fef03 696 for( i = buflen, j = 0; i > 0; i--, j++ )
kevman 0:38ceb79fef03 697 X->p[j / ciL] |= ((mbedtls_mpi_uint) buf[i - 1]) << ((j % ciL) << 3);
kevman 0:38ceb79fef03 698
kevman 0:38ceb79fef03 699 cleanup:
kevman 0:38ceb79fef03 700
kevman 0:38ceb79fef03 701 return( ret );
kevman 0:38ceb79fef03 702 }
kevman 0:38ceb79fef03 703
kevman 0:38ceb79fef03 704 /*
kevman 0:38ceb79fef03 705 * Export X into unsigned binary data, big endian
kevman 0:38ceb79fef03 706 */
kevman 0:38ceb79fef03 707 int mbedtls_mpi_write_binary( const mbedtls_mpi *X, unsigned char *buf, size_t buflen )
kevman 0:38ceb79fef03 708 {
kevman 0:38ceb79fef03 709 size_t i, j, n;
kevman 0:38ceb79fef03 710
kevman 0:38ceb79fef03 711 n = mbedtls_mpi_size( X );
kevman 0:38ceb79fef03 712
kevman 0:38ceb79fef03 713 if( buflen < n )
kevman 0:38ceb79fef03 714 return( MBEDTLS_ERR_MPI_BUFFER_TOO_SMALL );
kevman 0:38ceb79fef03 715
kevman 0:38ceb79fef03 716 memset( buf, 0, buflen );
kevman 0:38ceb79fef03 717
kevman 0:38ceb79fef03 718 for( i = buflen - 1, j = 0; n > 0; i--, j++, n-- )
kevman 0:38ceb79fef03 719 buf[i] = (unsigned char)( X->p[j / ciL] >> ((j % ciL) << 3) );
kevman 0:38ceb79fef03 720
kevman 0:38ceb79fef03 721 return( 0 );
kevman 0:38ceb79fef03 722 }
kevman 0:38ceb79fef03 723
kevman 0:38ceb79fef03 724 /*
kevman 0:38ceb79fef03 725 * Left-shift: X <<= count
kevman 0:38ceb79fef03 726 */
kevman 0:38ceb79fef03 727 int mbedtls_mpi_shift_l( mbedtls_mpi *X, size_t count )
kevman 0:38ceb79fef03 728 {
kevman 0:38ceb79fef03 729 int ret;
kevman 0:38ceb79fef03 730 size_t i, v0, t1;
kevman 0:38ceb79fef03 731 mbedtls_mpi_uint r0 = 0, r1;
kevman 0:38ceb79fef03 732
kevman 0:38ceb79fef03 733 v0 = count / (biL );
kevman 0:38ceb79fef03 734 t1 = count & (biL - 1);
kevman 0:38ceb79fef03 735
kevman 0:38ceb79fef03 736 i = mbedtls_mpi_bitlen( X ) + count;
kevman 0:38ceb79fef03 737
kevman 0:38ceb79fef03 738 if( X->n * biL < i )
kevman 0:38ceb79fef03 739 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, BITS_TO_LIMBS( i ) ) );
kevman 0:38ceb79fef03 740
kevman 0:38ceb79fef03 741 ret = 0;
kevman 0:38ceb79fef03 742
kevman 0:38ceb79fef03 743 /*
kevman 0:38ceb79fef03 744 * shift by count / limb_size
kevman 0:38ceb79fef03 745 */
kevman 0:38ceb79fef03 746 if( v0 > 0 )
kevman 0:38ceb79fef03 747 {
kevman 0:38ceb79fef03 748 for( i = X->n; i > v0; i-- )
kevman 0:38ceb79fef03 749 X->p[i - 1] = X->p[i - v0 - 1];
kevman 0:38ceb79fef03 750
kevman 0:38ceb79fef03 751 for( ; i > 0; i-- )
kevman 0:38ceb79fef03 752 X->p[i - 1] = 0;
kevman 0:38ceb79fef03 753 }
kevman 0:38ceb79fef03 754
kevman 0:38ceb79fef03 755 /*
kevman 0:38ceb79fef03 756 * shift by count % limb_size
kevman 0:38ceb79fef03 757 */
kevman 0:38ceb79fef03 758 if( t1 > 0 )
kevman 0:38ceb79fef03 759 {
kevman 0:38ceb79fef03 760 for( i = v0; i < X->n; i++ )
kevman 0:38ceb79fef03 761 {
kevman 0:38ceb79fef03 762 r1 = X->p[i] >> (biL - t1);
kevman 0:38ceb79fef03 763 X->p[i] <<= t1;
kevman 0:38ceb79fef03 764 X->p[i] |= r0;
kevman 0:38ceb79fef03 765 r0 = r1;
kevman 0:38ceb79fef03 766 }
kevman 0:38ceb79fef03 767 }
kevman 0:38ceb79fef03 768
kevman 0:38ceb79fef03 769 cleanup:
kevman 0:38ceb79fef03 770
kevman 0:38ceb79fef03 771 return( ret );
kevman 0:38ceb79fef03 772 }
kevman 0:38ceb79fef03 773
kevman 0:38ceb79fef03 774 /*
kevman 0:38ceb79fef03 775 * Right-shift: X >>= count
kevman 0:38ceb79fef03 776 */
kevman 0:38ceb79fef03 777 int mbedtls_mpi_shift_r( mbedtls_mpi *X, size_t count )
kevman 0:38ceb79fef03 778 {
kevman 0:38ceb79fef03 779 size_t i, v0, v1;
kevman 0:38ceb79fef03 780 mbedtls_mpi_uint r0 = 0, r1;
kevman 0:38ceb79fef03 781
kevman 0:38ceb79fef03 782 v0 = count / biL;
kevman 0:38ceb79fef03 783 v1 = count & (biL - 1);
kevman 0:38ceb79fef03 784
kevman 0:38ceb79fef03 785 if( v0 > X->n || ( v0 == X->n && v1 > 0 ) )
kevman 0:38ceb79fef03 786 return mbedtls_mpi_lset( X, 0 );
kevman 0:38ceb79fef03 787
kevman 0:38ceb79fef03 788 /*
kevman 0:38ceb79fef03 789 * shift by count / limb_size
kevman 0:38ceb79fef03 790 */
kevman 0:38ceb79fef03 791 if( v0 > 0 )
kevman 0:38ceb79fef03 792 {
kevman 0:38ceb79fef03 793 for( i = 0; i < X->n - v0; i++ )
kevman 0:38ceb79fef03 794 X->p[i] = X->p[i + v0];
kevman 0:38ceb79fef03 795
kevman 0:38ceb79fef03 796 for( ; i < X->n; i++ )
kevman 0:38ceb79fef03 797 X->p[i] = 0;
kevman 0:38ceb79fef03 798 }
kevman 0:38ceb79fef03 799
kevman 0:38ceb79fef03 800 /*
kevman 0:38ceb79fef03 801 * shift by count % limb_size
kevman 0:38ceb79fef03 802 */
kevman 0:38ceb79fef03 803 if( v1 > 0 )
kevman 0:38ceb79fef03 804 {
kevman 0:38ceb79fef03 805 for( i = X->n; i > 0; i-- )
kevman 0:38ceb79fef03 806 {
kevman 0:38ceb79fef03 807 r1 = X->p[i - 1] << (biL - v1);
kevman 0:38ceb79fef03 808 X->p[i - 1] >>= v1;
kevman 0:38ceb79fef03 809 X->p[i - 1] |= r0;
kevman 0:38ceb79fef03 810 r0 = r1;
kevman 0:38ceb79fef03 811 }
kevman 0:38ceb79fef03 812 }
kevman 0:38ceb79fef03 813
kevman 0:38ceb79fef03 814 return( 0 );
kevman 0:38ceb79fef03 815 }
kevman 0:38ceb79fef03 816
kevman 0:38ceb79fef03 817 /*
kevman 0:38ceb79fef03 818 * Compare unsigned values
kevman 0:38ceb79fef03 819 */
kevman 0:38ceb79fef03 820 int mbedtls_mpi_cmp_abs( const mbedtls_mpi *X, const mbedtls_mpi *Y )
kevman 0:38ceb79fef03 821 {
kevman 0:38ceb79fef03 822 size_t i, j;
kevman 0:38ceb79fef03 823
kevman 0:38ceb79fef03 824 for( i = X->n; i > 0; i-- )
kevman 0:38ceb79fef03 825 if( X->p[i - 1] != 0 )
kevman 0:38ceb79fef03 826 break;
kevman 0:38ceb79fef03 827
kevman 0:38ceb79fef03 828 for( j = Y->n; j > 0; j-- )
kevman 0:38ceb79fef03 829 if( Y->p[j - 1] != 0 )
kevman 0:38ceb79fef03 830 break;
kevman 0:38ceb79fef03 831
kevman 0:38ceb79fef03 832 if( i == 0 && j == 0 )
kevman 0:38ceb79fef03 833 return( 0 );
kevman 0:38ceb79fef03 834
kevman 0:38ceb79fef03 835 if( i > j ) return( 1 );
kevman 0:38ceb79fef03 836 if( j > i ) return( -1 );
kevman 0:38ceb79fef03 837
kevman 0:38ceb79fef03 838 for( ; i > 0; i-- )
kevman 0:38ceb79fef03 839 {
kevman 0:38ceb79fef03 840 if( X->p[i - 1] > Y->p[i - 1] ) return( 1 );
kevman 0:38ceb79fef03 841 if( X->p[i - 1] < Y->p[i - 1] ) return( -1 );
kevman 0:38ceb79fef03 842 }
kevman 0:38ceb79fef03 843
kevman 0:38ceb79fef03 844 return( 0 );
kevman 0:38ceb79fef03 845 }
kevman 0:38ceb79fef03 846
kevman 0:38ceb79fef03 847 /*
kevman 0:38ceb79fef03 848 * Compare signed values
kevman 0:38ceb79fef03 849 */
kevman 0:38ceb79fef03 850 int mbedtls_mpi_cmp_mpi( const mbedtls_mpi *X, const mbedtls_mpi *Y )
kevman 0:38ceb79fef03 851 {
kevman 0:38ceb79fef03 852 size_t i, j;
kevman 0:38ceb79fef03 853
kevman 0:38ceb79fef03 854 for( i = X->n; i > 0; i-- )
kevman 0:38ceb79fef03 855 if( X->p[i - 1] != 0 )
kevman 0:38ceb79fef03 856 break;
kevman 0:38ceb79fef03 857
kevman 0:38ceb79fef03 858 for( j = Y->n; j > 0; j-- )
kevman 0:38ceb79fef03 859 if( Y->p[j - 1] != 0 )
kevman 0:38ceb79fef03 860 break;
kevman 0:38ceb79fef03 861
kevman 0:38ceb79fef03 862 if( i == 0 && j == 0 )
kevman 0:38ceb79fef03 863 return( 0 );
kevman 0:38ceb79fef03 864
kevman 0:38ceb79fef03 865 if( i > j ) return( X->s );
kevman 0:38ceb79fef03 866 if( j > i ) return( -Y->s );
kevman 0:38ceb79fef03 867
kevman 0:38ceb79fef03 868 if( X->s > 0 && Y->s < 0 ) return( 1 );
kevman 0:38ceb79fef03 869 if( Y->s > 0 && X->s < 0 ) return( -1 );
kevman 0:38ceb79fef03 870
kevman 0:38ceb79fef03 871 for( ; i > 0; i-- )
kevman 0:38ceb79fef03 872 {
kevman 0:38ceb79fef03 873 if( X->p[i - 1] > Y->p[i - 1] ) return( X->s );
kevman 0:38ceb79fef03 874 if( X->p[i - 1] < Y->p[i - 1] ) return( -X->s );
kevman 0:38ceb79fef03 875 }
kevman 0:38ceb79fef03 876
kevman 0:38ceb79fef03 877 return( 0 );
kevman 0:38ceb79fef03 878 }
kevman 0:38ceb79fef03 879
kevman 0:38ceb79fef03 880 /*
kevman 0:38ceb79fef03 881 * Compare signed values
kevman 0:38ceb79fef03 882 */
kevman 0:38ceb79fef03 883 int mbedtls_mpi_cmp_int( const mbedtls_mpi *X, mbedtls_mpi_sint z )
kevman 0:38ceb79fef03 884 {
kevman 0:38ceb79fef03 885 mbedtls_mpi Y;
kevman 0:38ceb79fef03 886 mbedtls_mpi_uint p[1];
kevman 0:38ceb79fef03 887
kevman 0:38ceb79fef03 888 *p = ( z < 0 ) ? -z : z;
kevman 0:38ceb79fef03 889 Y.s = ( z < 0 ) ? -1 : 1;
kevman 0:38ceb79fef03 890 Y.n = 1;
kevman 0:38ceb79fef03 891 Y.p = p;
kevman 0:38ceb79fef03 892
kevman 0:38ceb79fef03 893 return( mbedtls_mpi_cmp_mpi( X, &Y ) );
kevman 0:38ceb79fef03 894 }
kevman 0:38ceb79fef03 895
kevman 0:38ceb79fef03 896 /*
kevman 0:38ceb79fef03 897 * Unsigned addition: X = |A| + |B| (HAC 14.7)
kevman 0:38ceb79fef03 898 */
kevman 0:38ceb79fef03 899 int mbedtls_mpi_add_abs( mbedtls_mpi *X, const mbedtls_mpi *A, const mbedtls_mpi *B )
kevman 0:38ceb79fef03 900 {
kevman 0:38ceb79fef03 901 int ret;
kevman 0:38ceb79fef03 902 size_t i, j;
kevman 0:38ceb79fef03 903 mbedtls_mpi_uint *o, *p, c, tmp;
kevman 0:38ceb79fef03 904
kevman 0:38ceb79fef03 905 if( X == B )
kevman 0:38ceb79fef03 906 {
kevman 0:38ceb79fef03 907 const mbedtls_mpi *T = A; A = X; B = T;
kevman 0:38ceb79fef03 908 }
kevman 0:38ceb79fef03 909
kevman 0:38ceb79fef03 910 if( X != A )
kevman 0:38ceb79fef03 911 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( X, A ) );
kevman 0:38ceb79fef03 912
kevman 0:38ceb79fef03 913 /*
kevman 0:38ceb79fef03 914 * X should always be positive as a result of unsigned additions.
kevman 0:38ceb79fef03 915 */
kevman 0:38ceb79fef03 916 X->s = 1;
kevman 0:38ceb79fef03 917
kevman 0:38ceb79fef03 918 for( j = B->n; j > 0; j-- )
kevman 0:38ceb79fef03 919 if( B->p[j - 1] != 0 )
kevman 0:38ceb79fef03 920 break;
kevman 0:38ceb79fef03 921
kevman 0:38ceb79fef03 922 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, j ) );
kevman 0:38ceb79fef03 923
kevman 0:38ceb79fef03 924 o = B->p; p = X->p; c = 0;
kevman 0:38ceb79fef03 925
kevman 0:38ceb79fef03 926 /*
kevman 0:38ceb79fef03 927 * tmp is used because it might happen that p == o
kevman 0:38ceb79fef03 928 */
kevman 0:38ceb79fef03 929 for( i = 0; i < j; i++, o++, p++ )
kevman 0:38ceb79fef03 930 {
kevman 0:38ceb79fef03 931 tmp= *o;
kevman 0:38ceb79fef03 932 *p += c; c = ( *p < c );
kevman 0:38ceb79fef03 933 *p += tmp; c += ( *p < tmp );
kevman 0:38ceb79fef03 934 }
kevman 0:38ceb79fef03 935
kevman 0:38ceb79fef03 936 while( c != 0 )
kevman 0:38ceb79fef03 937 {
kevman 0:38ceb79fef03 938 if( i >= X->n )
kevman 0:38ceb79fef03 939 {
kevman 0:38ceb79fef03 940 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, i + 1 ) );
kevman 0:38ceb79fef03 941 p = X->p + i;
kevman 0:38ceb79fef03 942 }
kevman 0:38ceb79fef03 943
kevman 0:38ceb79fef03 944 *p += c; c = ( *p < c ); i++; p++;
kevman 0:38ceb79fef03 945 }
kevman 0:38ceb79fef03 946
kevman 0:38ceb79fef03 947 cleanup:
kevman 0:38ceb79fef03 948
kevman 0:38ceb79fef03 949 return( ret );
kevman 0:38ceb79fef03 950 }
kevman 0:38ceb79fef03 951
kevman 0:38ceb79fef03 952 /*
kevman 0:38ceb79fef03 953 * Helper for mbedtls_mpi subtraction
kevman 0:38ceb79fef03 954 */
kevman 0:38ceb79fef03 955 static void mpi_sub_hlp( size_t n, mbedtls_mpi_uint *s, mbedtls_mpi_uint *d )
kevman 0:38ceb79fef03 956 {
kevman 0:38ceb79fef03 957 size_t i;
kevman 0:38ceb79fef03 958 mbedtls_mpi_uint c, z;
kevman 0:38ceb79fef03 959
kevman 0:38ceb79fef03 960 for( i = c = 0; i < n; i++, s++, d++ )
kevman 0:38ceb79fef03 961 {
kevman 0:38ceb79fef03 962 z = ( *d < c ); *d -= c;
kevman 0:38ceb79fef03 963 c = ( *d < *s ) + z; *d -= *s;
kevman 0:38ceb79fef03 964 }
kevman 0:38ceb79fef03 965
kevman 0:38ceb79fef03 966 while( c != 0 )
kevman 0:38ceb79fef03 967 {
kevman 0:38ceb79fef03 968 z = ( *d < c ); *d -= c;
kevman 0:38ceb79fef03 969 c = z; d++;
kevman 0:38ceb79fef03 970 }
kevman 0:38ceb79fef03 971 }
kevman 0:38ceb79fef03 972
kevman 0:38ceb79fef03 973 /*
kevman 0:38ceb79fef03 974 * Unsigned subtraction: X = |A| - |B| (HAC 14.9)
kevman 0:38ceb79fef03 975 */
kevman 0:38ceb79fef03 976 int mbedtls_mpi_sub_abs( mbedtls_mpi *X, const mbedtls_mpi *A, const mbedtls_mpi *B )
kevman 0:38ceb79fef03 977 {
kevman 0:38ceb79fef03 978 mbedtls_mpi TB;
kevman 0:38ceb79fef03 979 int ret;
kevman 0:38ceb79fef03 980 size_t n;
kevman 0:38ceb79fef03 981
kevman 0:38ceb79fef03 982 if( mbedtls_mpi_cmp_abs( A, B ) < 0 )
kevman 0:38ceb79fef03 983 return( MBEDTLS_ERR_MPI_NEGATIVE_VALUE );
kevman 0:38ceb79fef03 984
kevman 0:38ceb79fef03 985 mbedtls_mpi_init( &TB );
kevman 0:38ceb79fef03 986
kevman 0:38ceb79fef03 987 if( X == B )
kevman 0:38ceb79fef03 988 {
kevman 0:38ceb79fef03 989 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &TB, B ) );
kevman 0:38ceb79fef03 990 B = &TB;
kevman 0:38ceb79fef03 991 }
kevman 0:38ceb79fef03 992
kevman 0:38ceb79fef03 993 if( X != A )
kevman 0:38ceb79fef03 994 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( X, A ) );
kevman 0:38ceb79fef03 995
kevman 0:38ceb79fef03 996 /*
kevman 0:38ceb79fef03 997 * X should always be positive as a result of unsigned subtractions.
kevman 0:38ceb79fef03 998 */
kevman 0:38ceb79fef03 999 X->s = 1;
kevman 0:38ceb79fef03 1000
kevman 0:38ceb79fef03 1001 ret = 0;
kevman 0:38ceb79fef03 1002
kevman 0:38ceb79fef03 1003 for( n = B->n; n > 0; n-- )
kevman 0:38ceb79fef03 1004 if( B->p[n - 1] != 0 )
kevman 0:38ceb79fef03 1005 break;
kevman 0:38ceb79fef03 1006
kevman 0:38ceb79fef03 1007 mpi_sub_hlp( n, B->p, X->p );
kevman 0:38ceb79fef03 1008
kevman 0:38ceb79fef03 1009 cleanup:
kevman 0:38ceb79fef03 1010
kevman 0:38ceb79fef03 1011 mbedtls_mpi_free( &TB );
kevman 0:38ceb79fef03 1012
kevman 0:38ceb79fef03 1013 return( ret );
kevman 0:38ceb79fef03 1014 }
kevman 0:38ceb79fef03 1015
kevman 0:38ceb79fef03 1016 /*
kevman 0:38ceb79fef03 1017 * Signed addition: X = A + B
kevman 0:38ceb79fef03 1018 */
kevman 0:38ceb79fef03 1019 int mbedtls_mpi_add_mpi( mbedtls_mpi *X, const mbedtls_mpi *A, const mbedtls_mpi *B )
kevman 0:38ceb79fef03 1020 {
kevman 0:38ceb79fef03 1021 int ret, s = A->s;
kevman 0:38ceb79fef03 1022
kevman 0:38ceb79fef03 1023 if( A->s * B->s < 0 )
kevman 0:38ceb79fef03 1024 {
kevman 0:38ceb79fef03 1025 if( mbedtls_mpi_cmp_abs( A, B ) >= 0 )
kevman 0:38ceb79fef03 1026 {
kevman 0:38ceb79fef03 1027 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_abs( X, A, B ) );
kevman 0:38ceb79fef03 1028 X->s = s;
kevman 0:38ceb79fef03 1029 }
kevman 0:38ceb79fef03 1030 else
kevman 0:38ceb79fef03 1031 {
kevman 0:38ceb79fef03 1032 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_abs( X, B, A ) );
kevman 0:38ceb79fef03 1033 X->s = -s;
kevman 0:38ceb79fef03 1034 }
kevman 0:38ceb79fef03 1035 }
kevman 0:38ceb79fef03 1036 else
kevman 0:38ceb79fef03 1037 {
kevman 0:38ceb79fef03 1038 MBEDTLS_MPI_CHK( mbedtls_mpi_add_abs( X, A, B ) );
kevman 0:38ceb79fef03 1039 X->s = s;
kevman 0:38ceb79fef03 1040 }
kevman 0:38ceb79fef03 1041
kevman 0:38ceb79fef03 1042 cleanup:
kevman 0:38ceb79fef03 1043
kevman 0:38ceb79fef03 1044 return( ret );
kevman 0:38ceb79fef03 1045 }
kevman 0:38ceb79fef03 1046
kevman 0:38ceb79fef03 1047 /*
kevman 0:38ceb79fef03 1048 * Signed subtraction: X = A - B
kevman 0:38ceb79fef03 1049 */
kevman 0:38ceb79fef03 1050 int mbedtls_mpi_sub_mpi( mbedtls_mpi *X, const mbedtls_mpi *A, const mbedtls_mpi *B )
kevman 0:38ceb79fef03 1051 {
kevman 0:38ceb79fef03 1052 int ret, s = A->s;
kevman 0:38ceb79fef03 1053
kevman 0:38ceb79fef03 1054 if( A->s * B->s > 0 )
kevman 0:38ceb79fef03 1055 {
kevman 0:38ceb79fef03 1056 if( mbedtls_mpi_cmp_abs( A, B ) >= 0 )
kevman 0:38ceb79fef03 1057 {
kevman 0:38ceb79fef03 1058 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_abs( X, A, B ) );
kevman 0:38ceb79fef03 1059 X->s = s;
kevman 0:38ceb79fef03 1060 }
kevman 0:38ceb79fef03 1061 else
kevman 0:38ceb79fef03 1062 {
kevman 0:38ceb79fef03 1063 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_abs( X, B, A ) );
kevman 0:38ceb79fef03 1064 X->s = -s;
kevman 0:38ceb79fef03 1065 }
kevman 0:38ceb79fef03 1066 }
kevman 0:38ceb79fef03 1067 else
kevman 0:38ceb79fef03 1068 {
kevman 0:38ceb79fef03 1069 MBEDTLS_MPI_CHK( mbedtls_mpi_add_abs( X, A, B ) );
kevman 0:38ceb79fef03 1070 X->s = s;
kevman 0:38ceb79fef03 1071 }
kevman 0:38ceb79fef03 1072
kevman 0:38ceb79fef03 1073 cleanup:
kevman 0:38ceb79fef03 1074
kevman 0:38ceb79fef03 1075 return( ret );
kevman 0:38ceb79fef03 1076 }
kevman 0:38ceb79fef03 1077
kevman 0:38ceb79fef03 1078 /*
kevman 0:38ceb79fef03 1079 * Signed addition: X = A + b
kevman 0:38ceb79fef03 1080 */
kevman 0:38ceb79fef03 1081 int mbedtls_mpi_add_int( mbedtls_mpi *X, const mbedtls_mpi *A, mbedtls_mpi_sint b )
kevman 0:38ceb79fef03 1082 {
kevman 0:38ceb79fef03 1083 mbedtls_mpi _B;
kevman 0:38ceb79fef03 1084 mbedtls_mpi_uint p[1];
kevman 0:38ceb79fef03 1085
kevman 0:38ceb79fef03 1086 p[0] = ( b < 0 ) ? -b : b;
kevman 0:38ceb79fef03 1087 _B.s = ( b < 0 ) ? -1 : 1;
kevman 0:38ceb79fef03 1088 _B.n = 1;
kevman 0:38ceb79fef03 1089 _B.p = p;
kevman 0:38ceb79fef03 1090
kevman 0:38ceb79fef03 1091 return( mbedtls_mpi_add_mpi( X, A, &_B ) );
kevman 0:38ceb79fef03 1092 }
kevman 0:38ceb79fef03 1093
kevman 0:38ceb79fef03 1094 /*
kevman 0:38ceb79fef03 1095 * Signed subtraction: X = A - b
kevman 0:38ceb79fef03 1096 */
kevman 0:38ceb79fef03 1097 int mbedtls_mpi_sub_int( mbedtls_mpi *X, const mbedtls_mpi *A, mbedtls_mpi_sint b )
kevman 0:38ceb79fef03 1098 {
kevman 0:38ceb79fef03 1099 mbedtls_mpi _B;
kevman 0:38ceb79fef03 1100 mbedtls_mpi_uint p[1];
kevman 0:38ceb79fef03 1101
kevman 0:38ceb79fef03 1102 p[0] = ( b < 0 ) ? -b : b;
kevman 0:38ceb79fef03 1103 _B.s = ( b < 0 ) ? -1 : 1;
kevman 0:38ceb79fef03 1104 _B.n = 1;
kevman 0:38ceb79fef03 1105 _B.p = p;
kevman 0:38ceb79fef03 1106
kevman 0:38ceb79fef03 1107 return( mbedtls_mpi_sub_mpi( X, A, &_B ) );
kevman 0:38ceb79fef03 1108 }
kevman 0:38ceb79fef03 1109
kevman 0:38ceb79fef03 1110 /*
kevman 0:38ceb79fef03 1111 * Helper for mbedtls_mpi multiplication
kevman 0:38ceb79fef03 1112 */
kevman 0:38ceb79fef03 1113 static
kevman 0:38ceb79fef03 1114 #if defined(__APPLE__) && defined(__arm__)
kevman 0:38ceb79fef03 1115 /*
kevman 0:38ceb79fef03 1116 * Apple LLVM version 4.2 (clang-425.0.24) (based on LLVM 3.2svn)
kevman 0:38ceb79fef03 1117 * appears to need this to prevent bad ARM code generation at -O3.
kevman 0:38ceb79fef03 1118 */
kevman 0:38ceb79fef03 1119 __attribute__ ((noinline))
kevman 0:38ceb79fef03 1120 #endif
kevman 0:38ceb79fef03 1121 void mpi_mul_hlp( size_t i, mbedtls_mpi_uint *s, mbedtls_mpi_uint *d, mbedtls_mpi_uint b )
kevman 0:38ceb79fef03 1122 {
kevman 0:38ceb79fef03 1123 mbedtls_mpi_uint c = 0, t = 0;
kevman 0:38ceb79fef03 1124
kevman 0:38ceb79fef03 1125 #if defined(MULADDC_HUIT)
kevman 0:38ceb79fef03 1126 for( ; i >= 8; i -= 8 )
kevman 0:38ceb79fef03 1127 {
kevman 0:38ceb79fef03 1128 MULADDC_INIT
kevman 0:38ceb79fef03 1129 MULADDC_HUIT
kevman 0:38ceb79fef03 1130 MULADDC_STOP
kevman 0:38ceb79fef03 1131 }
kevman 0:38ceb79fef03 1132
kevman 0:38ceb79fef03 1133 for( ; i > 0; i-- )
kevman 0:38ceb79fef03 1134 {
kevman 0:38ceb79fef03 1135 MULADDC_INIT
kevman 0:38ceb79fef03 1136 MULADDC_CORE
kevman 0:38ceb79fef03 1137 MULADDC_STOP
kevman 0:38ceb79fef03 1138 }
kevman 0:38ceb79fef03 1139 #else /* MULADDC_HUIT */
kevman 0:38ceb79fef03 1140 for( ; i >= 16; i -= 16 )
kevman 0:38ceb79fef03 1141 {
kevman 0:38ceb79fef03 1142 MULADDC_INIT
kevman 0:38ceb79fef03 1143 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1144 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1145 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1146 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1147
kevman 0:38ceb79fef03 1148 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1149 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1150 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1151 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1152 MULADDC_STOP
kevman 0:38ceb79fef03 1153 }
kevman 0:38ceb79fef03 1154
kevman 0:38ceb79fef03 1155 for( ; i >= 8; i -= 8 )
kevman 0:38ceb79fef03 1156 {
kevman 0:38ceb79fef03 1157 MULADDC_INIT
kevman 0:38ceb79fef03 1158 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1159 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1160
kevman 0:38ceb79fef03 1161 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1162 MULADDC_CORE MULADDC_CORE
kevman 0:38ceb79fef03 1163 MULADDC_STOP
kevman 0:38ceb79fef03 1164 }
kevman 0:38ceb79fef03 1165
kevman 0:38ceb79fef03 1166 for( ; i > 0; i-- )
kevman 0:38ceb79fef03 1167 {
kevman 0:38ceb79fef03 1168 MULADDC_INIT
kevman 0:38ceb79fef03 1169 MULADDC_CORE
kevman 0:38ceb79fef03 1170 MULADDC_STOP
kevman 0:38ceb79fef03 1171 }
kevman 0:38ceb79fef03 1172 #endif /* MULADDC_HUIT */
kevman 0:38ceb79fef03 1173
kevman 0:38ceb79fef03 1174 t++;
kevman 0:38ceb79fef03 1175
kevman 0:38ceb79fef03 1176 do {
kevman 0:38ceb79fef03 1177 *d += c; c = ( *d < c ); d++;
kevman 0:38ceb79fef03 1178 }
kevman 0:38ceb79fef03 1179 while( c != 0 );
kevman 0:38ceb79fef03 1180 }
kevman 0:38ceb79fef03 1181
kevman 0:38ceb79fef03 1182 /*
kevman 0:38ceb79fef03 1183 * Baseline multiplication: X = A * B (HAC 14.12)
kevman 0:38ceb79fef03 1184 */
kevman 0:38ceb79fef03 1185 int mbedtls_mpi_mul_mpi( mbedtls_mpi *X, const mbedtls_mpi *A, const mbedtls_mpi *B )
kevman 0:38ceb79fef03 1186 {
kevman 0:38ceb79fef03 1187 int ret;
kevman 0:38ceb79fef03 1188 size_t i, j;
kevman 0:38ceb79fef03 1189 mbedtls_mpi TA, TB;
kevman 0:38ceb79fef03 1190
kevman 0:38ceb79fef03 1191 mbedtls_mpi_init( &TA ); mbedtls_mpi_init( &TB );
kevman 0:38ceb79fef03 1192
kevman 0:38ceb79fef03 1193 if( X == A ) { MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &TA, A ) ); A = &TA; }
kevman 0:38ceb79fef03 1194 if( X == B ) { MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &TB, B ) ); B = &TB; }
kevman 0:38ceb79fef03 1195
kevman 0:38ceb79fef03 1196 for( i = A->n; i > 0; i-- )
kevman 0:38ceb79fef03 1197 if( A->p[i - 1] != 0 )
kevman 0:38ceb79fef03 1198 break;
kevman 0:38ceb79fef03 1199
kevman 0:38ceb79fef03 1200 for( j = B->n; j > 0; j-- )
kevman 0:38ceb79fef03 1201 if( B->p[j - 1] != 0 )
kevman 0:38ceb79fef03 1202 break;
kevman 0:38ceb79fef03 1203
kevman 0:38ceb79fef03 1204 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, i + j ) );
kevman 0:38ceb79fef03 1205 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( X, 0 ) );
kevman 0:38ceb79fef03 1206
kevman 0:38ceb79fef03 1207 for( ; j > 0; j-- )
kevman 0:38ceb79fef03 1208 mpi_mul_hlp( i, A->p, X->p + j - 1, B->p[j - 1] );
kevman 0:38ceb79fef03 1209
kevman 0:38ceb79fef03 1210 X->s = A->s * B->s;
kevman 0:38ceb79fef03 1211
kevman 0:38ceb79fef03 1212 cleanup:
kevman 0:38ceb79fef03 1213
kevman 0:38ceb79fef03 1214 mbedtls_mpi_free( &TB ); mbedtls_mpi_free( &TA );
kevman 0:38ceb79fef03 1215
kevman 0:38ceb79fef03 1216 return( ret );
kevman 0:38ceb79fef03 1217 }
kevman 0:38ceb79fef03 1218
kevman 0:38ceb79fef03 1219 /*
kevman 0:38ceb79fef03 1220 * Baseline multiplication: X = A * b
kevman 0:38ceb79fef03 1221 */
kevman 0:38ceb79fef03 1222 int mbedtls_mpi_mul_int( mbedtls_mpi *X, const mbedtls_mpi *A, mbedtls_mpi_uint b )
kevman 0:38ceb79fef03 1223 {
kevman 0:38ceb79fef03 1224 mbedtls_mpi _B;
kevman 0:38ceb79fef03 1225 mbedtls_mpi_uint p[1];
kevman 0:38ceb79fef03 1226
kevman 0:38ceb79fef03 1227 _B.s = 1;
kevman 0:38ceb79fef03 1228 _B.n = 1;
kevman 0:38ceb79fef03 1229 _B.p = p;
kevman 0:38ceb79fef03 1230 p[0] = b;
kevman 0:38ceb79fef03 1231
kevman 0:38ceb79fef03 1232 return( mbedtls_mpi_mul_mpi( X, A, &_B ) );
kevman 0:38ceb79fef03 1233 }
kevman 0:38ceb79fef03 1234
kevman 0:38ceb79fef03 1235 /*
kevman 0:38ceb79fef03 1236 * Unsigned integer divide - double mbedtls_mpi_uint dividend, u1/u0, and
kevman 0:38ceb79fef03 1237 * mbedtls_mpi_uint divisor, d
kevman 0:38ceb79fef03 1238 */
kevman 0:38ceb79fef03 1239 static mbedtls_mpi_uint mbedtls_int_div_int( mbedtls_mpi_uint u1,
kevman 0:38ceb79fef03 1240 mbedtls_mpi_uint u0, mbedtls_mpi_uint d, mbedtls_mpi_uint *r )
kevman 0:38ceb79fef03 1241 {
kevman 0:38ceb79fef03 1242 #if defined(MBEDTLS_HAVE_UDBL)
kevman 0:38ceb79fef03 1243 mbedtls_t_udbl dividend, quotient;
kevman 0:38ceb79fef03 1244 #else
kevman 0:38ceb79fef03 1245 const mbedtls_mpi_uint radix = (mbedtls_mpi_uint) 1 << biH;
kevman 0:38ceb79fef03 1246 const mbedtls_mpi_uint uint_halfword_mask = ( (mbedtls_mpi_uint) 1 << biH ) - 1;
kevman 0:38ceb79fef03 1247 mbedtls_mpi_uint d0, d1, q0, q1, rAX, r0, quotient;
kevman 0:38ceb79fef03 1248 mbedtls_mpi_uint u0_msw, u0_lsw;
kevman 0:38ceb79fef03 1249 size_t s;
kevman 0:38ceb79fef03 1250 #endif
kevman 0:38ceb79fef03 1251
kevman 0:38ceb79fef03 1252 /*
kevman 0:38ceb79fef03 1253 * Check for overflow
kevman 0:38ceb79fef03 1254 */
kevman 0:38ceb79fef03 1255 if( 0 == d || u1 >= d )
kevman 0:38ceb79fef03 1256 {
kevman 0:38ceb79fef03 1257 if (r != NULL) *r = ~0;
kevman 0:38ceb79fef03 1258
kevman 0:38ceb79fef03 1259 return ( ~0 );
kevman 0:38ceb79fef03 1260 }
kevman 0:38ceb79fef03 1261
kevman 0:38ceb79fef03 1262 #if defined(MBEDTLS_HAVE_UDBL)
kevman 0:38ceb79fef03 1263 dividend = (mbedtls_t_udbl) u1 << biL;
kevman 0:38ceb79fef03 1264 dividend |= (mbedtls_t_udbl) u0;
kevman 0:38ceb79fef03 1265 quotient = dividend / d;
kevman 0:38ceb79fef03 1266 if( quotient > ( (mbedtls_t_udbl) 1 << biL ) - 1 )
kevman 0:38ceb79fef03 1267 quotient = ( (mbedtls_t_udbl) 1 << biL ) - 1;
kevman 0:38ceb79fef03 1268
kevman 0:38ceb79fef03 1269 if( r != NULL )
kevman 0:38ceb79fef03 1270 *r = (mbedtls_mpi_uint)( dividend - (quotient * d ) );
kevman 0:38ceb79fef03 1271
kevman 0:38ceb79fef03 1272 return (mbedtls_mpi_uint) quotient;
kevman 0:38ceb79fef03 1273 #else
kevman 0:38ceb79fef03 1274
kevman 0:38ceb79fef03 1275 /*
kevman 0:38ceb79fef03 1276 * Algorithm D, Section 4.3.1 - The Art of Computer Programming
kevman 0:38ceb79fef03 1277 * Vol. 2 - Seminumerical Algorithms, Knuth
kevman 0:38ceb79fef03 1278 */
kevman 0:38ceb79fef03 1279
kevman 0:38ceb79fef03 1280 /*
kevman 0:38ceb79fef03 1281 * Normalize the divisor, d, and dividend, u0, u1
kevman 0:38ceb79fef03 1282 */
kevman 0:38ceb79fef03 1283 s = mbedtls_clz( d );
kevman 0:38ceb79fef03 1284 d = d << s;
kevman 0:38ceb79fef03 1285
kevman 0:38ceb79fef03 1286 u1 = u1 << s;
kevman 0:38ceb79fef03 1287 u1 |= ( u0 >> ( biL - s ) ) & ( -(mbedtls_mpi_sint)s >> ( biL - 1 ) );
kevman 0:38ceb79fef03 1288 u0 = u0 << s;
kevman 0:38ceb79fef03 1289
kevman 0:38ceb79fef03 1290 d1 = d >> biH;
kevman 0:38ceb79fef03 1291 d0 = d & uint_halfword_mask;
kevman 0:38ceb79fef03 1292
kevman 0:38ceb79fef03 1293 u0_msw = u0 >> biH;
kevman 0:38ceb79fef03 1294 u0_lsw = u0 & uint_halfword_mask;
kevman 0:38ceb79fef03 1295
kevman 0:38ceb79fef03 1296 /*
kevman 0:38ceb79fef03 1297 * Find the first quotient and remainder
kevman 0:38ceb79fef03 1298 */
kevman 0:38ceb79fef03 1299 q1 = u1 / d1;
kevman 0:38ceb79fef03 1300 r0 = u1 - d1 * q1;
kevman 0:38ceb79fef03 1301
kevman 0:38ceb79fef03 1302 while( q1 >= radix || ( q1 * d0 > radix * r0 + u0_msw ) )
kevman 0:38ceb79fef03 1303 {
kevman 0:38ceb79fef03 1304 q1 -= 1;
kevman 0:38ceb79fef03 1305 r0 += d1;
kevman 0:38ceb79fef03 1306
kevman 0:38ceb79fef03 1307 if ( r0 >= radix ) break;
kevman 0:38ceb79fef03 1308 }
kevman 0:38ceb79fef03 1309
kevman 0:38ceb79fef03 1310 rAX = ( u1 * radix ) + ( u0_msw - q1 * d );
kevman 0:38ceb79fef03 1311 q0 = rAX / d1;
kevman 0:38ceb79fef03 1312 r0 = rAX - q0 * d1;
kevman 0:38ceb79fef03 1313
kevman 0:38ceb79fef03 1314 while( q0 >= radix || ( q0 * d0 > radix * r0 + u0_lsw ) )
kevman 0:38ceb79fef03 1315 {
kevman 0:38ceb79fef03 1316 q0 -= 1;
kevman 0:38ceb79fef03 1317 r0 += d1;
kevman 0:38ceb79fef03 1318
kevman 0:38ceb79fef03 1319 if ( r0 >= radix ) break;
kevman 0:38ceb79fef03 1320 }
kevman 0:38ceb79fef03 1321
kevman 0:38ceb79fef03 1322 if (r != NULL)
kevman 0:38ceb79fef03 1323 *r = ( rAX * radix + u0_lsw - q0 * d ) >> s;
kevman 0:38ceb79fef03 1324
kevman 0:38ceb79fef03 1325 quotient = q1 * radix + q0;
kevman 0:38ceb79fef03 1326
kevman 0:38ceb79fef03 1327 return quotient;
kevman 0:38ceb79fef03 1328 #endif
kevman 0:38ceb79fef03 1329 }
kevman 0:38ceb79fef03 1330
kevman 0:38ceb79fef03 1331 /*
kevman 0:38ceb79fef03 1332 * Division by mbedtls_mpi: A = Q * B + R (HAC 14.20)
kevman 0:38ceb79fef03 1333 */
kevman 0:38ceb79fef03 1334 int mbedtls_mpi_div_mpi( mbedtls_mpi *Q, mbedtls_mpi *R, const mbedtls_mpi *A, const mbedtls_mpi *B )
kevman 0:38ceb79fef03 1335 {
kevman 0:38ceb79fef03 1336 int ret;
kevman 0:38ceb79fef03 1337 size_t i, n, t, k;
kevman 0:38ceb79fef03 1338 mbedtls_mpi X, Y, Z, T1, T2;
kevman 0:38ceb79fef03 1339
kevman 0:38ceb79fef03 1340 if( mbedtls_mpi_cmp_int( B, 0 ) == 0 )
kevman 0:38ceb79fef03 1341 return( MBEDTLS_ERR_MPI_DIVISION_BY_ZERO );
kevman 0:38ceb79fef03 1342
kevman 0:38ceb79fef03 1343 mbedtls_mpi_init( &X ); mbedtls_mpi_init( &Y ); mbedtls_mpi_init( &Z );
kevman 0:38ceb79fef03 1344 mbedtls_mpi_init( &T1 ); mbedtls_mpi_init( &T2 );
kevman 0:38ceb79fef03 1345
kevman 0:38ceb79fef03 1346 if( mbedtls_mpi_cmp_abs( A, B ) < 0 )
kevman 0:38ceb79fef03 1347 {
kevman 0:38ceb79fef03 1348 if( Q != NULL ) MBEDTLS_MPI_CHK( mbedtls_mpi_lset( Q, 0 ) );
kevman 0:38ceb79fef03 1349 if( R != NULL ) MBEDTLS_MPI_CHK( mbedtls_mpi_copy( R, A ) );
kevman 0:38ceb79fef03 1350 return( 0 );
kevman 0:38ceb79fef03 1351 }
kevman 0:38ceb79fef03 1352
kevman 0:38ceb79fef03 1353 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &X, A ) );
kevman 0:38ceb79fef03 1354 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &Y, B ) );
kevman 0:38ceb79fef03 1355 X.s = Y.s = 1;
kevman 0:38ceb79fef03 1356
kevman 0:38ceb79fef03 1357 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( &Z, A->n + 2 ) );
kevman 0:38ceb79fef03 1358 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &Z, 0 ) );
kevman 0:38ceb79fef03 1359 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( &T1, 2 ) );
kevman 0:38ceb79fef03 1360 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( &T2, 3 ) );
kevman 0:38ceb79fef03 1361
kevman 0:38ceb79fef03 1362 k = mbedtls_mpi_bitlen( &Y ) % biL;
kevman 0:38ceb79fef03 1363 if( k < biL - 1 )
kevman 0:38ceb79fef03 1364 {
kevman 0:38ceb79fef03 1365 k = biL - 1 - k;
kevman 0:38ceb79fef03 1366 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_l( &X, k ) );
kevman 0:38ceb79fef03 1367 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_l( &Y, k ) );
kevman 0:38ceb79fef03 1368 }
kevman 0:38ceb79fef03 1369 else k = 0;
kevman 0:38ceb79fef03 1370
kevman 0:38ceb79fef03 1371 n = X.n - 1;
kevman 0:38ceb79fef03 1372 t = Y.n - 1;
kevman 0:38ceb79fef03 1373 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_l( &Y, biL * ( n - t ) ) );
kevman 0:38ceb79fef03 1374
kevman 0:38ceb79fef03 1375 while( mbedtls_mpi_cmp_mpi( &X, &Y ) >= 0 )
kevman 0:38ceb79fef03 1376 {
kevman 0:38ceb79fef03 1377 Z.p[n - t]++;
kevman 0:38ceb79fef03 1378 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &X, &X, &Y ) );
kevman 0:38ceb79fef03 1379 }
kevman 0:38ceb79fef03 1380 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &Y, biL * ( n - t ) ) );
kevman 0:38ceb79fef03 1381
kevman 0:38ceb79fef03 1382 for( i = n; i > t ; i-- )
kevman 0:38ceb79fef03 1383 {
kevman 0:38ceb79fef03 1384 if( X.p[i] >= Y.p[t] )
kevman 0:38ceb79fef03 1385 Z.p[i - t - 1] = ~0;
kevman 0:38ceb79fef03 1386 else
kevman 0:38ceb79fef03 1387 {
kevman 0:38ceb79fef03 1388 Z.p[i - t - 1] = mbedtls_int_div_int( X.p[i], X.p[i - 1],
kevman 0:38ceb79fef03 1389 Y.p[t], NULL);
kevman 0:38ceb79fef03 1390 }
kevman 0:38ceb79fef03 1391
kevman 0:38ceb79fef03 1392 Z.p[i - t - 1]++;
kevman 0:38ceb79fef03 1393 do
kevman 0:38ceb79fef03 1394 {
kevman 0:38ceb79fef03 1395 Z.p[i - t - 1]--;
kevman 0:38ceb79fef03 1396
kevman 0:38ceb79fef03 1397 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &T1, 0 ) );
kevman 0:38ceb79fef03 1398 T1.p[0] = ( t < 1 ) ? 0 : Y.p[t - 1];
kevman 0:38ceb79fef03 1399 T1.p[1] = Y.p[t];
kevman 0:38ceb79fef03 1400 MBEDTLS_MPI_CHK( mbedtls_mpi_mul_int( &T1, &T1, Z.p[i - t - 1] ) );
kevman 0:38ceb79fef03 1401
kevman 0:38ceb79fef03 1402 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &T2, 0 ) );
kevman 0:38ceb79fef03 1403 T2.p[0] = ( i < 2 ) ? 0 : X.p[i - 2];
kevman 0:38ceb79fef03 1404 T2.p[1] = ( i < 1 ) ? 0 : X.p[i - 1];
kevman 0:38ceb79fef03 1405 T2.p[2] = X.p[i];
kevman 0:38ceb79fef03 1406 }
kevman 0:38ceb79fef03 1407 while( mbedtls_mpi_cmp_mpi( &T1, &T2 ) > 0 );
kevman 0:38ceb79fef03 1408
kevman 0:38ceb79fef03 1409 MBEDTLS_MPI_CHK( mbedtls_mpi_mul_int( &T1, &Y, Z.p[i - t - 1] ) );
kevman 0:38ceb79fef03 1410 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_l( &T1, biL * ( i - t - 1 ) ) );
kevman 0:38ceb79fef03 1411 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &X, &X, &T1 ) );
kevman 0:38ceb79fef03 1412
kevman 0:38ceb79fef03 1413 if( mbedtls_mpi_cmp_int( &X, 0 ) < 0 )
kevman 0:38ceb79fef03 1414 {
kevman 0:38ceb79fef03 1415 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &T1, &Y ) );
kevman 0:38ceb79fef03 1416 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_l( &T1, biL * ( i - t - 1 ) ) );
kevman 0:38ceb79fef03 1417 MBEDTLS_MPI_CHK( mbedtls_mpi_add_mpi( &X, &X, &T1 ) );
kevman 0:38ceb79fef03 1418 Z.p[i - t - 1]--;
kevman 0:38ceb79fef03 1419 }
kevman 0:38ceb79fef03 1420 }
kevman 0:38ceb79fef03 1421
kevman 0:38ceb79fef03 1422 if( Q != NULL )
kevman 0:38ceb79fef03 1423 {
kevman 0:38ceb79fef03 1424 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( Q, &Z ) );
kevman 0:38ceb79fef03 1425 Q->s = A->s * B->s;
kevman 0:38ceb79fef03 1426 }
kevman 0:38ceb79fef03 1427
kevman 0:38ceb79fef03 1428 if( R != NULL )
kevman 0:38ceb79fef03 1429 {
kevman 0:38ceb79fef03 1430 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &X, k ) );
kevman 0:38ceb79fef03 1431 X.s = A->s;
kevman 0:38ceb79fef03 1432 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( R, &X ) );
kevman 0:38ceb79fef03 1433
kevman 0:38ceb79fef03 1434 if( mbedtls_mpi_cmp_int( R, 0 ) == 0 )
kevman 0:38ceb79fef03 1435 R->s = 1;
kevman 0:38ceb79fef03 1436 }
kevman 0:38ceb79fef03 1437
kevman 0:38ceb79fef03 1438 cleanup:
kevman 0:38ceb79fef03 1439
kevman 0:38ceb79fef03 1440 mbedtls_mpi_free( &X ); mbedtls_mpi_free( &Y ); mbedtls_mpi_free( &Z );
kevman 0:38ceb79fef03 1441 mbedtls_mpi_free( &T1 ); mbedtls_mpi_free( &T2 );
kevman 0:38ceb79fef03 1442
kevman 0:38ceb79fef03 1443 return( ret );
kevman 0:38ceb79fef03 1444 }
kevman 0:38ceb79fef03 1445
kevman 0:38ceb79fef03 1446 /*
kevman 0:38ceb79fef03 1447 * Division by int: A = Q * b + R
kevman 0:38ceb79fef03 1448 */
kevman 0:38ceb79fef03 1449 int mbedtls_mpi_div_int( mbedtls_mpi *Q, mbedtls_mpi *R, const mbedtls_mpi *A, mbedtls_mpi_sint b )
kevman 0:38ceb79fef03 1450 {
kevman 0:38ceb79fef03 1451 mbedtls_mpi _B;
kevman 0:38ceb79fef03 1452 mbedtls_mpi_uint p[1];
kevman 0:38ceb79fef03 1453
kevman 0:38ceb79fef03 1454 p[0] = ( b < 0 ) ? -b : b;
kevman 0:38ceb79fef03 1455 _B.s = ( b < 0 ) ? -1 : 1;
kevman 0:38ceb79fef03 1456 _B.n = 1;
kevman 0:38ceb79fef03 1457 _B.p = p;
kevman 0:38ceb79fef03 1458
kevman 0:38ceb79fef03 1459 return( mbedtls_mpi_div_mpi( Q, R, A, &_B ) );
kevman 0:38ceb79fef03 1460 }
kevman 0:38ceb79fef03 1461
kevman 0:38ceb79fef03 1462 /*
kevman 0:38ceb79fef03 1463 * Modulo: R = A mod B
kevman 0:38ceb79fef03 1464 */
kevman 0:38ceb79fef03 1465 int mbedtls_mpi_mod_mpi( mbedtls_mpi *R, const mbedtls_mpi *A, const mbedtls_mpi *B )
kevman 0:38ceb79fef03 1466 {
kevman 0:38ceb79fef03 1467 int ret;
kevman 0:38ceb79fef03 1468
kevman 0:38ceb79fef03 1469 if( mbedtls_mpi_cmp_int( B, 0 ) < 0 )
kevman 0:38ceb79fef03 1470 return( MBEDTLS_ERR_MPI_NEGATIVE_VALUE );
kevman 0:38ceb79fef03 1471
kevman 0:38ceb79fef03 1472 MBEDTLS_MPI_CHK( mbedtls_mpi_div_mpi( NULL, R, A, B ) );
kevman 0:38ceb79fef03 1473
kevman 0:38ceb79fef03 1474 while( mbedtls_mpi_cmp_int( R, 0 ) < 0 )
kevman 0:38ceb79fef03 1475 MBEDTLS_MPI_CHK( mbedtls_mpi_add_mpi( R, R, B ) );
kevman 0:38ceb79fef03 1476
kevman 0:38ceb79fef03 1477 while( mbedtls_mpi_cmp_mpi( R, B ) >= 0 )
kevman 0:38ceb79fef03 1478 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( R, R, B ) );
kevman 0:38ceb79fef03 1479
kevman 0:38ceb79fef03 1480 cleanup:
kevman 0:38ceb79fef03 1481
kevman 0:38ceb79fef03 1482 return( ret );
kevman 0:38ceb79fef03 1483 }
kevman 0:38ceb79fef03 1484
kevman 0:38ceb79fef03 1485 /*
kevman 0:38ceb79fef03 1486 * Modulo: r = A mod b
kevman 0:38ceb79fef03 1487 */
kevman 0:38ceb79fef03 1488 int mbedtls_mpi_mod_int( mbedtls_mpi_uint *r, const mbedtls_mpi *A, mbedtls_mpi_sint b )
kevman 0:38ceb79fef03 1489 {
kevman 0:38ceb79fef03 1490 size_t i;
kevman 0:38ceb79fef03 1491 mbedtls_mpi_uint x, y, z;
kevman 0:38ceb79fef03 1492
kevman 0:38ceb79fef03 1493 if( b == 0 )
kevman 0:38ceb79fef03 1494 return( MBEDTLS_ERR_MPI_DIVISION_BY_ZERO );
kevman 0:38ceb79fef03 1495
kevman 0:38ceb79fef03 1496 if( b < 0 )
kevman 0:38ceb79fef03 1497 return( MBEDTLS_ERR_MPI_NEGATIVE_VALUE );
kevman 0:38ceb79fef03 1498
kevman 0:38ceb79fef03 1499 /*
kevman 0:38ceb79fef03 1500 * handle trivial cases
kevman 0:38ceb79fef03 1501 */
kevman 0:38ceb79fef03 1502 if( b == 1 )
kevman 0:38ceb79fef03 1503 {
kevman 0:38ceb79fef03 1504 *r = 0;
kevman 0:38ceb79fef03 1505 return( 0 );
kevman 0:38ceb79fef03 1506 }
kevman 0:38ceb79fef03 1507
kevman 0:38ceb79fef03 1508 if( b == 2 )
kevman 0:38ceb79fef03 1509 {
kevman 0:38ceb79fef03 1510 *r = A->p[0] & 1;
kevman 0:38ceb79fef03 1511 return( 0 );
kevman 0:38ceb79fef03 1512 }
kevman 0:38ceb79fef03 1513
kevman 0:38ceb79fef03 1514 /*
kevman 0:38ceb79fef03 1515 * general case
kevman 0:38ceb79fef03 1516 */
kevman 0:38ceb79fef03 1517 for( i = A->n, y = 0; i > 0; i-- )
kevman 0:38ceb79fef03 1518 {
kevman 0:38ceb79fef03 1519 x = A->p[i - 1];
kevman 0:38ceb79fef03 1520 y = ( y << biH ) | ( x >> biH );
kevman 0:38ceb79fef03 1521 z = y / b;
kevman 0:38ceb79fef03 1522 y -= z * b;
kevman 0:38ceb79fef03 1523
kevman 0:38ceb79fef03 1524 x <<= biH;
kevman 0:38ceb79fef03 1525 y = ( y << biH ) | ( x >> biH );
kevman 0:38ceb79fef03 1526 z = y / b;
kevman 0:38ceb79fef03 1527 y -= z * b;
kevman 0:38ceb79fef03 1528 }
kevman 0:38ceb79fef03 1529
kevman 0:38ceb79fef03 1530 /*
kevman 0:38ceb79fef03 1531 * If A is negative, then the current y represents a negative value.
kevman 0:38ceb79fef03 1532 * Flipping it to the positive side.
kevman 0:38ceb79fef03 1533 */
kevman 0:38ceb79fef03 1534 if( A->s < 0 && y != 0 )
kevman 0:38ceb79fef03 1535 y = b - y;
kevman 0:38ceb79fef03 1536
kevman 0:38ceb79fef03 1537 *r = y;
kevman 0:38ceb79fef03 1538
kevman 0:38ceb79fef03 1539 return( 0 );
kevman 0:38ceb79fef03 1540 }
kevman 0:38ceb79fef03 1541
kevman 0:38ceb79fef03 1542 /*
kevman 0:38ceb79fef03 1543 * Fast Montgomery initialization (thanks to Tom St Denis)
kevman 0:38ceb79fef03 1544 */
kevman 0:38ceb79fef03 1545 static void mpi_montg_init( mbedtls_mpi_uint *mm, const mbedtls_mpi *N )
kevman 0:38ceb79fef03 1546 {
kevman 0:38ceb79fef03 1547 mbedtls_mpi_uint x, m0 = N->p[0];
kevman 0:38ceb79fef03 1548 unsigned int i;
kevman 0:38ceb79fef03 1549
kevman 0:38ceb79fef03 1550 x = m0;
kevman 0:38ceb79fef03 1551 x += ( ( m0 + 2 ) & 4 ) << 1;
kevman 0:38ceb79fef03 1552
kevman 0:38ceb79fef03 1553 for( i = biL; i >= 8; i /= 2 )
kevman 0:38ceb79fef03 1554 x *= ( 2 - ( m0 * x ) );
kevman 0:38ceb79fef03 1555
kevman 0:38ceb79fef03 1556 *mm = ~x + 1;
kevman 0:38ceb79fef03 1557 }
kevman 0:38ceb79fef03 1558
kevman 0:38ceb79fef03 1559 /*
kevman 0:38ceb79fef03 1560 * Montgomery multiplication: A = A * B * R^-1 mod N (HAC 14.36)
kevman 0:38ceb79fef03 1561 */
kevman 0:38ceb79fef03 1562 static int mpi_montmul( mbedtls_mpi *A, const mbedtls_mpi *B, const mbedtls_mpi *N, mbedtls_mpi_uint mm,
kevman 0:38ceb79fef03 1563 const mbedtls_mpi *T )
kevman 0:38ceb79fef03 1564 {
kevman 0:38ceb79fef03 1565 size_t i, n, m;
kevman 0:38ceb79fef03 1566 mbedtls_mpi_uint u0, u1, *d;
kevman 0:38ceb79fef03 1567
kevman 0:38ceb79fef03 1568 if( T->n < N->n + 1 || T->p == NULL )
kevman 0:38ceb79fef03 1569 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 1570
kevman 0:38ceb79fef03 1571 memset( T->p, 0, T->n * ciL );
kevman 0:38ceb79fef03 1572
kevman 0:38ceb79fef03 1573 d = T->p;
kevman 0:38ceb79fef03 1574 n = N->n;
kevman 0:38ceb79fef03 1575 m = ( B->n < n ) ? B->n : n;
kevman 0:38ceb79fef03 1576
kevman 0:38ceb79fef03 1577 for( i = 0; i < n; i++ )
kevman 0:38ceb79fef03 1578 {
kevman 0:38ceb79fef03 1579 /*
kevman 0:38ceb79fef03 1580 * T = (T + u0*B + u1*N) / 2^biL
kevman 0:38ceb79fef03 1581 */
kevman 0:38ceb79fef03 1582 u0 = A->p[i];
kevman 0:38ceb79fef03 1583 u1 = ( d[0] + u0 * B->p[0] ) * mm;
kevman 0:38ceb79fef03 1584
kevman 0:38ceb79fef03 1585 mpi_mul_hlp( m, B->p, d, u0 );
kevman 0:38ceb79fef03 1586 mpi_mul_hlp( n, N->p, d, u1 );
kevman 0:38ceb79fef03 1587
kevman 0:38ceb79fef03 1588 *d++ = u0; d[n + 1] = 0;
kevman 0:38ceb79fef03 1589 }
kevman 0:38ceb79fef03 1590
kevman 0:38ceb79fef03 1591 memcpy( A->p, d, ( n + 1 ) * ciL );
kevman 0:38ceb79fef03 1592
kevman 0:38ceb79fef03 1593 if( mbedtls_mpi_cmp_abs( A, N ) >= 0 )
kevman 0:38ceb79fef03 1594 mpi_sub_hlp( n, N->p, A->p );
kevman 0:38ceb79fef03 1595 else
kevman 0:38ceb79fef03 1596 /* prevent timing attacks */
kevman 0:38ceb79fef03 1597 mpi_sub_hlp( n, A->p, T->p );
kevman 0:38ceb79fef03 1598
kevman 0:38ceb79fef03 1599 return( 0 );
kevman 0:38ceb79fef03 1600 }
kevman 0:38ceb79fef03 1601
kevman 0:38ceb79fef03 1602 /*
kevman 0:38ceb79fef03 1603 * Montgomery reduction: A = A * R^-1 mod N
kevman 0:38ceb79fef03 1604 */
kevman 0:38ceb79fef03 1605 static int mpi_montred( mbedtls_mpi *A, const mbedtls_mpi *N, mbedtls_mpi_uint mm, const mbedtls_mpi *T )
kevman 0:38ceb79fef03 1606 {
kevman 0:38ceb79fef03 1607 mbedtls_mpi_uint z = 1;
kevman 0:38ceb79fef03 1608 mbedtls_mpi U;
kevman 0:38ceb79fef03 1609
kevman 0:38ceb79fef03 1610 U.n = U.s = (int) z;
kevman 0:38ceb79fef03 1611 U.p = &z;
kevman 0:38ceb79fef03 1612
kevman 0:38ceb79fef03 1613 return( mpi_montmul( A, &U, N, mm, T ) );
kevman 0:38ceb79fef03 1614 }
kevman 0:38ceb79fef03 1615
kevman 0:38ceb79fef03 1616 /*
kevman 0:38ceb79fef03 1617 * Sliding-window exponentiation: X = A^E mod N (HAC 14.85)
kevman 0:38ceb79fef03 1618 */
kevman 0:38ceb79fef03 1619 int mbedtls_mpi_exp_mod( mbedtls_mpi *X, const mbedtls_mpi *A, const mbedtls_mpi *E, const mbedtls_mpi *N, mbedtls_mpi *_RR )
kevman 0:38ceb79fef03 1620 {
kevman 0:38ceb79fef03 1621 int ret;
kevman 0:38ceb79fef03 1622 size_t wbits, wsize, one = 1;
kevman 0:38ceb79fef03 1623 size_t i, j, nblimbs;
kevman 0:38ceb79fef03 1624 size_t bufsize, nbits;
kevman 0:38ceb79fef03 1625 mbedtls_mpi_uint ei, mm, state;
kevman 0:38ceb79fef03 1626 mbedtls_mpi RR, T, W[ 2 << MBEDTLS_MPI_WINDOW_SIZE ], Apos;
kevman 0:38ceb79fef03 1627 int neg;
kevman 0:38ceb79fef03 1628
kevman 0:38ceb79fef03 1629 if( mbedtls_mpi_cmp_int( N, 0 ) <= 0 || ( N->p[0] & 1 ) == 0 )
kevman 0:38ceb79fef03 1630 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 1631
kevman 0:38ceb79fef03 1632 if( mbedtls_mpi_cmp_int( E, 0 ) < 0 )
kevman 0:38ceb79fef03 1633 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 1634
kevman 0:38ceb79fef03 1635 /*
kevman 0:38ceb79fef03 1636 * Init temps and window size
kevman 0:38ceb79fef03 1637 */
kevman 0:38ceb79fef03 1638 mpi_montg_init( &mm, N );
kevman 0:38ceb79fef03 1639 mbedtls_mpi_init( &RR ); mbedtls_mpi_init( &T );
kevman 0:38ceb79fef03 1640 mbedtls_mpi_init( &Apos );
kevman 0:38ceb79fef03 1641 memset( W, 0, sizeof( W ) );
kevman 0:38ceb79fef03 1642
kevman 0:38ceb79fef03 1643 i = mbedtls_mpi_bitlen( E );
kevman 0:38ceb79fef03 1644
kevman 0:38ceb79fef03 1645 wsize = ( i > 671 ) ? 6 : ( i > 239 ) ? 5 :
kevman 0:38ceb79fef03 1646 ( i > 79 ) ? 4 : ( i > 23 ) ? 3 : 1;
kevman 0:38ceb79fef03 1647
kevman 0:38ceb79fef03 1648 if( wsize > MBEDTLS_MPI_WINDOW_SIZE )
kevman 0:38ceb79fef03 1649 wsize = MBEDTLS_MPI_WINDOW_SIZE;
kevman 0:38ceb79fef03 1650
kevman 0:38ceb79fef03 1651 j = N->n + 1;
kevman 0:38ceb79fef03 1652 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( X, j ) );
kevman 0:38ceb79fef03 1653 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( &W[1], j ) );
kevman 0:38ceb79fef03 1654 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( &T, j * 2 ) );
kevman 0:38ceb79fef03 1655
kevman 0:38ceb79fef03 1656 /*
kevman 0:38ceb79fef03 1657 * Compensate for negative A (and correct at the end)
kevman 0:38ceb79fef03 1658 */
kevman 0:38ceb79fef03 1659 neg = ( A->s == -1 );
kevman 0:38ceb79fef03 1660 if( neg )
kevman 0:38ceb79fef03 1661 {
kevman 0:38ceb79fef03 1662 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &Apos, A ) );
kevman 0:38ceb79fef03 1663 Apos.s = 1;
kevman 0:38ceb79fef03 1664 A = &Apos;
kevman 0:38ceb79fef03 1665 }
kevman 0:38ceb79fef03 1666
kevman 0:38ceb79fef03 1667 /*
kevman 0:38ceb79fef03 1668 * If 1st call, pre-compute R^2 mod N
kevman 0:38ceb79fef03 1669 */
kevman 0:38ceb79fef03 1670 if( _RR == NULL || _RR->p == NULL )
kevman 0:38ceb79fef03 1671 {
kevman 0:38ceb79fef03 1672 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &RR, 1 ) );
kevman 0:38ceb79fef03 1673 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_l( &RR, N->n * 2 * biL ) );
kevman 0:38ceb79fef03 1674 MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &RR, &RR, N ) );
kevman 0:38ceb79fef03 1675
kevman 0:38ceb79fef03 1676 if( _RR != NULL )
kevman 0:38ceb79fef03 1677 memcpy( _RR, &RR, sizeof( mbedtls_mpi ) );
kevman 0:38ceb79fef03 1678 }
kevman 0:38ceb79fef03 1679 else
kevman 0:38ceb79fef03 1680 memcpy( &RR, _RR, sizeof( mbedtls_mpi ) );
kevman 0:38ceb79fef03 1681
kevman 0:38ceb79fef03 1682 /*
kevman 0:38ceb79fef03 1683 * W[1] = A * R^2 * R^-1 mod N = A * R mod N
kevman 0:38ceb79fef03 1684 */
kevman 0:38ceb79fef03 1685 if( mbedtls_mpi_cmp_mpi( A, N ) >= 0 )
kevman 0:38ceb79fef03 1686 MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &W[1], A, N ) );
kevman 0:38ceb79fef03 1687 else
kevman 0:38ceb79fef03 1688 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &W[1], A ) );
kevman 0:38ceb79fef03 1689
kevman 0:38ceb79fef03 1690 MBEDTLS_MPI_CHK( mpi_montmul( &W[1], &RR, N, mm, &T ) );
kevman 0:38ceb79fef03 1691
kevman 0:38ceb79fef03 1692 /*
kevman 0:38ceb79fef03 1693 * X = R^2 * R^-1 mod N = R mod N
kevman 0:38ceb79fef03 1694 */
kevman 0:38ceb79fef03 1695 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( X, &RR ) );
kevman 0:38ceb79fef03 1696 MBEDTLS_MPI_CHK( mpi_montred( X, N, mm, &T ) );
kevman 0:38ceb79fef03 1697
kevman 0:38ceb79fef03 1698 if( wsize > 1 )
kevman 0:38ceb79fef03 1699 {
kevman 0:38ceb79fef03 1700 /*
kevman 0:38ceb79fef03 1701 * W[1 << (wsize - 1)] = W[1] ^ (wsize - 1)
kevman 0:38ceb79fef03 1702 */
kevman 0:38ceb79fef03 1703 j = one << ( wsize - 1 );
kevman 0:38ceb79fef03 1704
kevman 0:38ceb79fef03 1705 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( &W[j], N->n + 1 ) );
kevman 0:38ceb79fef03 1706 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &W[j], &W[1] ) );
kevman 0:38ceb79fef03 1707
kevman 0:38ceb79fef03 1708 for( i = 0; i < wsize - 1; i++ )
kevman 0:38ceb79fef03 1709 MBEDTLS_MPI_CHK( mpi_montmul( &W[j], &W[j], N, mm, &T ) );
kevman 0:38ceb79fef03 1710
kevman 0:38ceb79fef03 1711 /*
kevman 0:38ceb79fef03 1712 * W[i] = W[i - 1] * W[1]
kevman 0:38ceb79fef03 1713 */
kevman 0:38ceb79fef03 1714 for( i = j + 1; i < ( one << wsize ); i++ )
kevman 0:38ceb79fef03 1715 {
kevman 0:38ceb79fef03 1716 MBEDTLS_MPI_CHK( mbedtls_mpi_grow( &W[i], N->n + 1 ) );
kevman 0:38ceb79fef03 1717 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &W[i], &W[i - 1] ) );
kevman 0:38ceb79fef03 1718
kevman 0:38ceb79fef03 1719 MBEDTLS_MPI_CHK( mpi_montmul( &W[i], &W[1], N, mm, &T ) );
kevman 0:38ceb79fef03 1720 }
kevman 0:38ceb79fef03 1721 }
kevman 0:38ceb79fef03 1722
kevman 0:38ceb79fef03 1723 nblimbs = E->n;
kevman 0:38ceb79fef03 1724 bufsize = 0;
kevman 0:38ceb79fef03 1725 nbits = 0;
kevman 0:38ceb79fef03 1726 wbits = 0;
kevman 0:38ceb79fef03 1727 state = 0;
kevman 0:38ceb79fef03 1728
kevman 0:38ceb79fef03 1729 while( 1 )
kevman 0:38ceb79fef03 1730 {
kevman 0:38ceb79fef03 1731 if( bufsize == 0 )
kevman 0:38ceb79fef03 1732 {
kevman 0:38ceb79fef03 1733 if( nblimbs == 0 )
kevman 0:38ceb79fef03 1734 break;
kevman 0:38ceb79fef03 1735
kevman 0:38ceb79fef03 1736 nblimbs--;
kevman 0:38ceb79fef03 1737
kevman 0:38ceb79fef03 1738 bufsize = sizeof( mbedtls_mpi_uint ) << 3;
kevman 0:38ceb79fef03 1739 }
kevman 0:38ceb79fef03 1740
kevman 0:38ceb79fef03 1741 bufsize--;
kevman 0:38ceb79fef03 1742
kevman 0:38ceb79fef03 1743 ei = (E->p[nblimbs] >> bufsize) & 1;
kevman 0:38ceb79fef03 1744
kevman 0:38ceb79fef03 1745 /*
kevman 0:38ceb79fef03 1746 * skip leading 0s
kevman 0:38ceb79fef03 1747 */
kevman 0:38ceb79fef03 1748 if( ei == 0 && state == 0 )
kevman 0:38ceb79fef03 1749 continue;
kevman 0:38ceb79fef03 1750
kevman 0:38ceb79fef03 1751 if( ei == 0 && state == 1 )
kevman 0:38ceb79fef03 1752 {
kevman 0:38ceb79fef03 1753 /*
kevman 0:38ceb79fef03 1754 * out of window, square X
kevman 0:38ceb79fef03 1755 */
kevman 0:38ceb79fef03 1756 MBEDTLS_MPI_CHK( mpi_montmul( X, X, N, mm, &T ) );
kevman 0:38ceb79fef03 1757 continue;
kevman 0:38ceb79fef03 1758 }
kevman 0:38ceb79fef03 1759
kevman 0:38ceb79fef03 1760 /*
kevman 0:38ceb79fef03 1761 * add ei to current window
kevman 0:38ceb79fef03 1762 */
kevman 0:38ceb79fef03 1763 state = 2;
kevman 0:38ceb79fef03 1764
kevman 0:38ceb79fef03 1765 nbits++;
kevman 0:38ceb79fef03 1766 wbits |= ( ei << ( wsize - nbits ) );
kevman 0:38ceb79fef03 1767
kevman 0:38ceb79fef03 1768 if( nbits == wsize )
kevman 0:38ceb79fef03 1769 {
kevman 0:38ceb79fef03 1770 /*
kevman 0:38ceb79fef03 1771 * X = X^wsize R^-1 mod N
kevman 0:38ceb79fef03 1772 */
kevman 0:38ceb79fef03 1773 for( i = 0; i < wsize; i++ )
kevman 0:38ceb79fef03 1774 MBEDTLS_MPI_CHK( mpi_montmul( X, X, N, mm, &T ) );
kevman 0:38ceb79fef03 1775
kevman 0:38ceb79fef03 1776 /*
kevman 0:38ceb79fef03 1777 * X = X * W[wbits] R^-1 mod N
kevman 0:38ceb79fef03 1778 */
kevman 0:38ceb79fef03 1779 MBEDTLS_MPI_CHK( mpi_montmul( X, &W[wbits], N, mm, &T ) );
kevman 0:38ceb79fef03 1780
kevman 0:38ceb79fef03 1781 state--;
kevman 0:38ceb79fef03 1782 nbits = 0;
kevman 0:38ceb79fef03 1783 wbits = 0;
kevman 0:38ceb79fef03 1784 }
kevman 0:38ceb79fef03 1785 }
kevman 0:38ceb79fef03 1786
kevman 0:38ceb79fef03 1787 /*
kevman 0:38ceb79fef03 1788 * process the remaining bits
kevman 0:38ceb79fef03 1789 */
kevman 0:38ceb79fef03 1790 for( i = 0; i < nbits; i++ )
kevman 0:38ceb79fef03 1791 {
kevman 0:38ceb79fef03 1792 MBEDTLS_MPI_CHK( mpi_montmul( X, X, N, mm, &T ) );
kevman 0:38ceb79fef03 1793
kevman 0:38ceb79fef03 1794 wbits <<= 1;
kevman 0:38ceb79fef03 1795
kevman 0:38ceb79fef03 1796 if( ( wbits & ( one << wsize ) ) != 0 )
kevman 0:38ceb79fef03 1797 MBEDTLS_MPI_CHK( mpi_montmul( X, &W[1], N, mm, &T ) );
kevman 0:38ceb79fef03 1798 }
kevman 0:38ceb79fef03 1799
kevman 0:38ceb79fef03 1800 /*
kevman 0:38ceb79fef03 1801 * X = A^E * R * R^-1 mod N = A^E mod N
kevman 0:38ceb79fef03 1802 */
kevman 0:38ceb79fef03 1803 MBEDTLS_MPI_CHK( mpi_montred( X, N, mm, &T ) );
kevman 0:38ceb79fef03 1804
kevman 0:38ceb79fef03 1805 if( neg && E->n != 0 && ( E->p[0] & 1 ) != 0 )
kevman 0:38ceb79fef03 1806 {
kevman 0:38ceb79fef03 1807 X->s = -1;
kevman 0:38ceb79fef03 1808 MBEDTLS_MPI_CHK( mbedtls_mpi_add_mpi( X, N, X ) );
kevman 0:38ceb79fef03 1809 }
kevman 0:38ceb79fef03 1810
kevman 0:38ceb79fef03 1811 cleanup:
kevman 0:38ceb79fef03 1812
kevman 0:38ceb79fef03 1813 for( i = ( one << ( wsize - 1 ) ); i < ( one << wsize ); i++ )
kevman 0:38ceb79fef03 1814 mbedtls_mpi_free( &W[i] );
kevman 0:38ceb79fef03 1815
kevman 0:38ceb79fef03 1816 mbedtls_mpi_free( &W[1] ); mbedtls_mpi_free( &T ); mbedtls_mpi_free( &Apos );
kevman 0:38ceb79fef03 1817
kevman 0:38ceb79fef03 1818 if( _RR == NULL || _RR->p == NULL )
kevman 0:38ceb79fef03 1819 mbedtls_mpi_free( &RR );
kevman 0:38ceb79fef03 1820
kevman 0:38ceb79fef03 1821 return( ret );
kevman 0:38ceb79fef03 1822 }
kevman 0:38ceb79fef03 1823
kevman 0:38ceb79fef03 1824 /*
kevman 0:38ceb79fef03 1825 * Greatest common divisor: G = gcd(A, B) (HAC 14.54)
kevman 0:38ceb79fef03 1826 */
kevman 0:38ceb79fef03 1827 int mbedtls_mpi_gcd( mbedtls_mpi *G, const mbedtls_mpi *A, const mbedtls_mpi *B )
kevman 0:38ceb79fef03 1828 {
kevman 0:38ceb79fef03 1829 int ret;
kevman 0:38ceb79fef03 1830 size_t lz, lzt;
kevman 0:38ceb79fef03 1831 mbedtls_mpi TG, TA, TB;
kevman 0:38ceb79fef03 1832
kevman 0:38ceb79fef03 1833 mbedtls_mpi_init( &TG ); mbedtls_mpi_init( &TA ); mbedtls_mpi_init( &TB );
kevman 0:38ceb79fef03 1834
kevman 0:38ceb79fef03 1835 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &TA, A ) );
kevman 0:38ceb79fef03 1836 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &TB, B ) );
kevman 0:38ceb79fef03 1837
kevman 0:38ceb79fef03 1838 lz = mbedtls_mpi_lsb( &TA );
kevman 0:38ceb79fef03 1839 lzt = mbedtls_mpi_lsb( &TB );
kevman 0:38ceb79fef03 1840
kevman 0:38ceb79fef03 1841 if( lzt < lz )
kevman 0:38ceb79fef03 1842 lz = lzt;
kevman 0:38ceb79fef03 1843
kevman 0:38ceb79fef03 1844 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &TA, lz ) );
kevman 0:38ceb79fef03 1845 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &TB, lz ) );
kevman 0:38ceb79fef03 1846
kevman 0:38ceb79fef03 1847 TA.s = TB.s = 1;
kevman 0:38ceb79fef03 1848
kevman 0:38ceb79fef03 1849 while( mbedtls_mpi_cmp_int( &TA, 0 ) != 0 )
kevman 0:38ceb79fef03 1850 {
kevman 0:38ceb79fef03 1851 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &TA, mbedtls_mpi_lsb( &TA ) ) );
kevman 0:38ceb79fef03 1852 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &TB, mbedtls_mpi_lsb( &TB ) ) );
kevman 0:38ceb79fef03 1853
kevman 0:38ceb79fef03 1854 if( mbedtls_mpi_cmp_mpi( &TA, &TB ) >= 0 )
kevman 0:38ceb79fef03 1855 {
kevman 0:38ceb79fef03 1856 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_abs( &TA, &TA, &TB ) );
kevman 0:38ceb79fef03 1857 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &TA, 1 ) );
kevman 0:38ceb79fef03 1858 }
kevman 0:38ceb79fef03 1859 else
kevman 0:38ceb79fef03 1860 {
kevman 0:38ceb79fef03 1861 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_abs( &TB, &TB, &TA ) );
kevman 0:38ceb79fef03 1862 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &TB, 1 ) );
kevman 0:38ceb79fef03 1863 }
kevman 0:38ceb79fef03 1864 }
kevman 0:38ceb79fef03 1865
kevman 0:38ceb79fef03 1866 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_l( &TB, lz ) );
kevman 0:38ceb79fef03 1867 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( G, &TB ) );
kevman 0:38ceb79fef03 1868
kevman 0:38ceb79fef03 1869 cleanup:
kevman 0:38ceb79fef03 1870
kevman 0:38ceb79fef03 1871 mbedtls_mpi_free( &TG ); mbedtls_mpi_free( &TA ); mbedtls_mpi_free( &TB );
kevman 0:38ceb79fef03 1872
kevman 0:38ceb79fef03 1873 return( ret );
kevman 0:38ceb79fef03 1874 }
kevman 0:38ceb79fef03 1875
kevman 0:38ceb79fef03 1876 /*
kevman 0:38ceb79fef03 1877 * Fill X with size bytes of random.
kevman 0:38ceb79fef03 1878 *
kevman 0:38ceb79fef03 1879 * Use a temporary bytes representation to make sure the result is the same
kevman 0:38ceb79fef03 1880 * regardless of the platform endianness (useful when f_rng is actually
kevman 0:38ceb79fef03 1881 * deterministic, eg for tests).
kevman 0:38ceb79fef03 1882 */
kevman 0:38ceb79fef03 1883 int mbedtls_mpi_fill_random( mbedtls_mpi *X, size_t size,
kevman 0:38ceb79fef03 1884 int (*f_rng)(void *, unsigned char *, size_t),
kevman 0:38ceb79fef03 1885 void *p_rng )
kevman 0:38ceb79fef03 1886 {
kevman 0:38ceb79fef03 1887 int ret;
kevman 0:38ceb79fef03 1888 unsigned char buf[MBEDTLS_MPI_MAX_SIZE];
kevman 0:38ceb79fef03 1889
kevman 0:38ceb79fef03 1890 if( size > MBEDTLS_MPI_MAX_SIZE )
kevman 0:38ceb79fef03 1891 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 1892
kevman 0:38ceb79fef03 1893 MBEDTLS_MPI_CHK( f_rng( p_rng, buf, size ) );
kevman 0:38ceb79fef03 1894 MBEDTLS_MPI_CHK( mbedtls_mpi_read_binary( X, buf, size ) );
kevman 0:38ceb79fef03 1895
kevman 0:38ceb79fef03 1896 cleanup:
kevman 0:38ceb79fef03 1897 mbedtls_platform_zeroize( buf, sizeof( buf ) );
kevman 0:38ceb79fef03 1898 return( ret );
kevman 0:38ceb79fef03 1899 }
kevman 0:38ceb79fef03 1900
kevman 0:38ceb79fef03 1901 /*
kevman 0:38ceb79fef03 1902 * Modular inverse: X = A^-1 mod N (HAC 14.61 / 14.64)
kevman 0:38ceb79fef03 1903 */
kevman 0:38ceb79fef03 1904 int mbedtls_mpi_inv_mod( mbedtls_mpi *X, const mbedtls_mpi *A, const mbedtls_mpi *N )
kevman 0:38ceb79fef03 1905 {
kevman 0:38ceb79fef03 1906 int ret;
kevman 0:38ceb79fef03 1907 mbedtls_mpi G, TA, TU, U1, U2, TB, TV, V1, V2;
kevman 0:38ceb79fef03 1908
kevman 0:38ceb79fef03 1909 if( mbedtls_mpi_cmp_int( N, 1 ) <= 0 )
kevman 0:38ceb79fef03 1910 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 1911
kevman 0:38ceb79fef03 1912 mbedtls_mpi_init( &TA ); mbedtls_mpi_init( &TU ); mbedtls_mpi_init( &U1 ); mbedtls_mpi_init( &U2 );
kevman 0:38ceb79fef03 1913 mbedtls_mpi_init( &G ); mbedtls_mpi_init( &TB ); mbedtls_mpi_init( &TV );
kevman 0:38ceb79fef03 1914 mbedtls_mpi_init( &V1 ); mbedtls_mpi_init( &V2 );
kevman 0:38ceb79fef03 1915
kevman 0:38ceb79fef03 1916 MBEDTLS_MPI_CHK( mbedtls_mpi_gcd( &G, A, N ) );
kevman 0:38ceb79fef03 1917
kevman 0:38ceb79fef03 1918 if( mbedtls_mpi_cmp_int( &G, 1 ) != 0 )
kevman 0:38ceb79fef03 1919 {
kevman 0:38ceb79fef03 1920 ret = MBEDTLS_ERR_MPI_NOT_ACCEPTABLE;
kevman 0:38ceb79fef03 1921 goto cleanup;
kevman 0:38ceb79fef03 1922 }
kevman 0:38ceb79fef03 1923
kevman 0:38ceb79fef03 1924 MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &TA, A, N ) );
kevman 0:38ceb79fef03 1925 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &TU, &TA ) );
kevman 0:38ceb79fef03 1926 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &TB, N ) );
kevman 0:38ceb79fef03 1927 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &TV, N ) );
kevman 0:38ceb79fef03 1928
kevman 0:38ceb79fef03 1929 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &U1, 1 ) );
kevman 0:38ceb79fef03 1930 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &U2, 0 ) );
kevman 0:38ceb79fef03 1931 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &V1, 0 ) );
kevman 0:38ceb79fef03 1932 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &V2, 1 ) );
kevman 0:38ceb79fef03 1933
kevman 0:38ceb79fef03 1934 do
kevman 0:38ceb79fef03 1935 {
kevman 0:38ceb79fef03 1936 while( ( TU.p[0] & 1 ) == 0 )
kevman 0:38ceb79fef03 1937 {
kevman 0:38ceb79fef03 1938 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &TU, 1 ) );
kevman 0:38ceb79fef03 1939
kevman 0:38ceb79fef03 1940 if( ( U1.p[0] & 1 ) != 0 || ( U2.p[0] & 1 ) != 0 )
kevman 0:38ceb79fef03 1941 {
kevman 0:38ceb79fef03 1942 MBEDTLS_MPI_CHK( mbedtls_mpi_add_mpi( &U1, &U1, &TB ) );
kevman 0:38ceb79fef03 1943 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &U2, &U2, &TA ) );
kevman 0:38ceb79fef03 1944 }
kevman 0:38ceb79fef03 1945
kevman 0:38ceb79fef03 1946 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &U1, 1 ) );
kevman 0:38ceb79fef03 1947 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &U2, 1 ) );
kevman 0:38ceb79fef03 1948 }
kevman 0:38ceb79fef03 1949
kevman 0:38ceb79fef03 1950 while( ( TV.p[0] & 1 ) == 0 )
kevman 0:38ceb79fef03 1951 {
kevman 0:38ceb79fef03 1952 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &TV, 1 ) );
kevman 0:38ceb79fef03 1953
kevman 0:38ceb79fef03 1954 if( ( V1.p[0] & 1 ) != 0 || ( V2.p[0] & 1 ) != 0 )
kevman 0:38ceb79fef03 1955 {
kevman 0:38ceb79fef03 1956 MBEDTLS_MPI_CHK( mbedtls_mpi_add_mpi( &V1, &V1, &TB ) );
kevman 0:38ceb79fef03 1957 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &V2, &V2, &TA ) );
kevman 0:38ceb79fef03 1958 }
kevman 0:38ceb79fef03 1959
kevman 0:38ceb79fef03 1960 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &V1, 1 ) );
kevman 0:38ceb79fef03 1961 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &V2, 1 ) );
kevman 0:38ceb79fef03 1962 }
kevman 0:38ceb79fef03 1963
kevman 0:38ceb79fef03 1964 if( mbedtls_mpi_cmp_mpi( &TU, &TV ) >= 0 )
kevman 0:38ceb79fef03 1965 {
kevman 0:38ceb79fef03 1966 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &TU, &TU, &TV ) );
kevman 0:38ceb79fef03 1967 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &U1, &U1, &V1 ) );
kevman 0:38ceb79fef03 1968 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &U2, &U2, &V2 ) );
kevman 0:38ceb79fef03 1969 }
kevman 0:38ceb79fef03 1970 else
kevman 0:38ceb79fef03 1971 {
kevman 0:38ceb79fef03 1972 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &TV, &TV, &TU ) );
kevman 0:38ceb79fef03 1973 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &V1, &V1, &U1 ) );
kevman 0:38ceb79fef03 1974 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &V2, &V2, &U2 ) );
kevman 0:38ceb79fef03 1975 }
kevman 0:38ceb79fef03 1976 }
kevman 0:38ceb79fef03 1977 while( mbedtls_mpi_cmp_int( &TU, 0 ) != 0 );
kevman 0:38ceb79fef03 1978
kevman 0:38ceb79fef03 1979 while( mbedtls_mpi_cmp_int( &V1, 0 ) < 0 )
kevman 0:38ceb79fef03 1980 MBEDTLS_MPI_CHK( mbedtls_mpi_add_mpi( &V1, &V1, N ) );
kevman 0:38ceb79fef03 1981
kevman 0:38ceb79fef03 1982 while( mbedtls_mpi_cmp_mpi( &V1, N ) >= 0 )
kevman 0:38ceb79fef03 1983 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &V1, &V1, N ) );
kevman 0:38ceb79fef03 1984
kevman 0:38ceb79fef03 1985 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( X, &V1 ) );
kevman 0:38ceb79fef03 1986
kevman 0:38ceb79fef03 1987 cleanup:
kevman 0:38ceb79fef03 1988
kevman 0:38ceb79fef03 1989 mbedtls_mpi_free( &TA ); mbedtls_mpi_free( &TU ); mbedtls_mpi_free( &U1 ); mbedtls_mpi_free( &U2 );
kevman 0:38ceb79fef03 1990 mbedtls_mpi_free( &G ); mbedtls_mpi_free( &TB ); mbedtls_mpi_free( &TV );
kevman 0:38ceb79fef03 1991 mbedtls_mpi_free( &V1 ); mbedtls_mpi_free( &V2 );
kevman 0:38ceb79fef03 1992
kevman 0:38ceb79fef03 1993 return( ret );
kevman 0:38ceb79fef03 1994 }
kevman 0:38ceb79fef03 1995
kevman 0:38ceb79fef03 1996 #if defined(MBEDTLS_GENPRIME)
kevman 0:38ceb79fef03 1997
kevman 0:38ceb79fef03 1998 static const int small_prime[] =
kevman 0:38ceb79fef03 1999 {
kevman 0:38ceb79fef03 2000 3, 5, 7, 11, 13, 17, 19, 23,
kevman 0:38ceb79fef03 2001 29, 31, 37, 41, 43, 47, 53, 59,
kevman 0:38ceb79fef03 2002 61, 67, 71, 73, 79, 83, 89, 97,
kevman 0:38ceb79fef03 2003 101, 103, 107, 109, 113, 127, 131, 137,
kevman 0:38ceb79fef03 2004 139, 149, 151, 157, 163, 167, 173, 179,
kevman 0:38ceb79fef03 2005 181, 191, 193, 197, 199, 211, 223, 227,
kevman 0:38ceb79fef03 2006 229, 233, 239, 241, 251, 257, 263, 269,
kevman 0:38ceb79fef03 2007 271, 277, 281, 283, 293, 307, 311, 313,
kevman 0:38ceb79fef03 2008 317, 331, 337, 347, 349, 353, 359, 367,
kevman 0:38ceb79fef03 2009 373, 379, 383, 389, 397, 401, 409, 419,
kevman 0:38ceb79fef03 2010 421, 431, 433, 439, 443, 449, 457, 461,
kevman 0:38ceb79fef03 2011 463, 467, 479, 487, 491, 499, 503, 509,
kevman 0:38ceb79fef03 2012 521, 523, 541, 547, 557, 563, 569, 571,
kevman 0:38ceb79fef03 2013 577, 587, 593, 599, 601, 607, 613, 617,
kevman 0:38ceb79fef03 2014 619, 631, 641, 643, 647, 653, 659, 661,
kevman 0:38ceb79fef03 2015 673, 677, 683, 691, 701, 709, 719, 727,
kevman 0:38ceb79fef03 2016 733, 739, 743, 751, 757, 761, 769, 773,
kevman 0:38ceb79fef03 2017 787, 797, 809, 811, 821, 823, 827, 829,
kevman 0:38ceb79fef03 2018 839, 853, 857, 859, 863, 877, 881, 883,
kevman 0:38ceb79fef03 2019 887, 907, 911, 919, 929, 937, 941, 947,
kevman 0:38ceb79fef03 2020 953, 967, 971, 977, 983, 991, 997, -103
kevman 0:38ceb79fef03 2021 };
kevman 0:38ceb79fef03 2022
kevman 0:38ceb79fef03 2023 /*
kevman 0:38ceb79fef03 2024 * Small divisors test (X must be positive)
kevman 0:38ceb79fef03 2025 *
kevman 0:38ceb79fef03 2026 * Return values:
kevman 0:38ceb79fef03 2027 * 0: no small factor (possible prime, more tests needed)
kevman 0:38ceb79fef03 2028 * 1: certain prime
kevman 0:38ceb79fef03 2029 * MBEDTLS_ERR_MPI_NOT_ACCEPTABLE: certain non-prime
kevman 0:38ceb79fef03 2030 * other negative: error
kevman 0:38ceb79fef03 2031 */
kevman 0:38ceb79fef03 2032 static int mpi_check_small_factors( const mbedtls_mpi *X )
kevman 0:38ceb79fef03 2033 {
kevman 0:38ceb79fef03 2034 int ret = 0;
kevman 0:38ceb79fef03 2035 size_t i;
kevman 0:38ceb79fef03 2036 mbedtls_mpi_uint r;
kevman 0:38ceb79fef03 2037
kevman 0:38ceb79fef03 2038 if( ( X->p[0] & 1 ) == 0 )
kevman 0:38ceb79fef03 2039 return( MBEDTLS_ERR_MPI_NOT_ACCEPTABLE );
kevman 0:38ceb79fef03 2040
kevman 0:38ceb79fef03 2041 for( i = 0; small_prime[i] > 0; i++ )
kevman 0:38ceb79fef03 2042 {
kevman 0:38ceb79fef03 2043 if( mbedtls_mpi_cmp_int( X, small_prime[i] ) <= 0 )
kevman 0:38ceb79fef03 2044 return( 1 );
kevman 0:38ceb79fef03 2045
kevman 0:38ceb79fef03 2046 MBEDTLS_MPI_CHK( mbedtls_mpi_mod_int( &r, X, small_prime[i] ) );
kevman 0:38ceb79fef03 2047
kevman 0:38ceb79fef03 2048 if( r == 0 )
kevman 0:38ceb79fef03 2049 return( MBEDTLS_ERR_MPI_NOT_ACCEPTABLE );
kevman 0:38ceb79fef03 2050 }
kevman 0:38ceb79fef03 2051
kevman 0:38ceb79fef03 2052 cleanup:
kevman 0:38ceb79fef03 2053 return( ret );
kevman 0:38ceb79fef03 2054 }
kevman 0:38ceb79fef03 2055
kevman 0:38ceb79fef03 2056 /*
kevman 0:38ceb79fef03 2057 * Miller-Rabin pseudo-primality test (HAC 4.24)
kevman 0:38ceb79fef03 2058 */
kevman 0:38ceb79fef03 2059 static int mpi_miller_rabin( const mbedtls_mpi *X,
kevman 0:38ceb79fef03 2060 int (*f_rng)(void *, unsigned char *, size_t),
kevman 0:38ceb79fef03 2061 void *p_rng )
kevman 0:38ceb79fef03 2062 {
kevman 0:38ceb79fef03 2063 int ret, count;
kevman 0:38ceb79fef03 2064 size_t i, j, k, n, s;
kevman 0:38ceb79fef03 2065 mbedtls_mpi W, R, T, A, RR;
kevman 0:38ceb79fef03 2066
kevman 0:38ceb79fef03 2067 mbedtls_mpi_init( &W ); mbedtls_mpi_init( &R ); mbedtls_mpi_init( &T ); mbedtls_mpi_init( &A );
kevman 0:38ceb79fef03 2068 mbedtls_mpi_init( &RR );
kevman 0:38ceb79fef03 2069
kevman 0:38ceb79fef03 2070 /*
kevman 0:38ceb79fef03 2071 * W = |X| - 1
kevman 0:38ceb79fef03 2072 * R = W >> lsb( W )
kevman 0:38ceb79fef03 2073 */
kevman 0:38ceb79fef03 2074 MBEDTLS_MPI_CHK( mbedtls_mpi_sub_int( &W, X, 1 ) );
kevman 0:38ceb79fef03 2075 s = mbedtls_mpi_lsb( &W );
kevman 0:38ceb79fef03 2076 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &R, &W ) );
kevman 0:38ceb79fef03 2077 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &R, s ) );
kevman 0:38ceb79fef03 2078
kevman 0:38ceb79fef03 2079 i = mbedtls_mpi_bitlen( X );
kevman 0:38ceb79fef03 2080 /*
kevman 0:38ceb79fef03 2081 * HAC, table 4.4
kevman 0:38ceb79fef03 2082 */
kevman 0:38ceb79fef03 2083 n = ( ( i >= 1300 ) ? 2 : ( i >= 850 ) ? 3 :
kevman 0:38ceb79fef03 2084 ( i >= 650 ) ? 4 : ( i >= 350 ) ? 8 :
kevman 0:38ceb79fef03 2085 ( i >= 250 ) ? 12 : ( i >= 150 ) ? 18 : 27 );
kevman 0:38ceb79fef03 2086
kevman 0:38ceb79fef03 2087 for( i = 0; i < n; i++ )
kevman 0:38ceb79fef03 2088 {
kevman 0:38ceb79fef03 2089 /*
kevman 0:38ceb79fef03 2090 * pick a random A, 1 < A < |X| - 1
kevman 0:38ceb79fef03 2091 */
kevman 0:38ceb79fef03 2092 MBEDTLS_MPI_CHK( mbedtls_mpi_fill_random( &A, X->n * ciL, f_rng, p_rng ) );
kevman 0:38ceb79fef03 2093
kevman 0:38ceb79fef03 2094 if( mbedtls_mpi_cmp_mpi( &A, &W ) >= 0 )
kevman 0:38ceb79fef03 2095 {
kevman 0:38ceb79fef03 2096 j = mbedtls_mpi_bitlen( &A ) - mbedtls_mpi_bitlen( &W );
kevman 0:38ceb79fef03 2097 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &A, j + 1 ) );
kevman 0:38ceb79fef03 2098 }
kevman 0:38ceb79fef03 2099 A.p[0] |= 3;
kevman 0:38ceb79fef03 2100
kevman 0:38ceb79fef03 2101 count = 0;
kevman 0:38ceb79fef03 2102 do {
kevman 0:38ceb79fef03 2103 MBEDTLS_MPI_CHK( mbedtls_mpi_fill_random( &A, X->n * ciL, f_rng, p_rng ) );
kevman 0:38ceb79fef03 2104
kevman 0:38ceb79fef03 2105 j = mbedtls_mpi_bitlen( &A );
kevman 0:38ceb79fef03 2106 k = mbedtls_mpi_bitlen( &W );
kevman 0:38ceb79fef03 2107 if (j > k) {
kevman 0:38ceb79fef03 2108 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &A, j - k ) );
kevman 0:38ceb79fef03 2109 }
kevman 0:38ceb79fef03 2110
kevman 0:38ceb79fef03 2111 if (count++ > 30) {
kevman 0:38ceb79fef03 2112 return MBEDTLS_ERR_MPI_NOT_ACCEPTABLE;
kevman 0:38ceb79fef03 2113 }
kevman 0:38ceb79fef03 2114
kevman 0:38ceb79fef03 2115 } while ( mbedtls_mpi_cmp_mpi( &A, &W ) >= 0 ||
kevman 0:38ceb79fef03 2116 mbedtls_mpi_cmp_int( &A, 1 ) <= 0 );
kevman 0:38ceb79fef03 2117
kevman 0:38ceb79fef03 2118 /*
kevman 0:38ceb79fef03 2119 * A = A^R mod |X|
kevman 0:38ceb79fef03 2120 */
kevman 0:38ceb79fef03 2121 MBEDTLS_MPI_CHK( mbedtls_mpi_exp_mod( &A, &A, &R, X, &RR ) );
kevman 0:38ceb79fef03 2122
kevman 0:38ceb79fef03 2123 if( mbedtls_mpi_cmp_mpi( &A, &W ) == 0 ||
kevman 0:38ceb79fef03 2124 mbedtls_mpi_cmp_int( &A, 1 ) == 0 )
kevman 0:38ceb79fef03 2125 continue;
kevman 0:38ceb79fef03 2126
kevman 0:38ceb79fef03 2127 j = 1;
kevman 0:38ceb79fef03 2128 while( j < s && mbedtls_mpi_cmp_mpi( &A, &W ) != 0 )
kevman 0:38ceb79fef03 2129 {
kevman 0:38ceb79fef03 2130 /*
kevman 0:38ceb79fef03 2131 * A = A * A mod |X|
kevman 0:38ceb79fef03 2132 */
kevman 0:38ceb79fef03 2133 MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &T, &A, &A ) );
kevman 0:38ceb79fef03 2134 MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &A, &T, X ) );
kevman 0:38ceb79fef03 2135
kevman 0:38ceb79fef03 2136 if( mbedtls_mpi_cmp_int( &A, 1 ) == 0 )
kevman 0:38ceb79fef03 2137 break;
kevman 0:38ceb79fef03 2138
kevman 0:38ceb79fef03 2139 j++;
kevman 0:38ceb79fef03 2140 }
kevman 0:38ceb79fef03 2141
kevman 0:38ceb79fef03 2142 /*
kevman 0:38ceb79fef03 2143 * not prime if A != |X| - 1 or A == 1
kevman 0:38ceb79fef03 2144 */
kevman 0:38ceb79fef03 2145 if( mbedtls_mpi_cmp_mpi( &A, &W ) != 0 ||
kevman 0:38ceb79fef03 2146 mbedtls_mpi_cmp_int( &A, 1 ) == 0 )
kevman 0:38ceb79fef03 2147 {
kevman 0:38ceb79fef03 2148 ret = MBEDTLS_ERR_MPI_NOT_ACCEPTABLE;
kevman 0:38ceb79fef03 2149 break;
kevman 0:38ceb79fef03 2150 }
kevman 0:38ceb79fef03 2151 }
kevman 0:38ceb79fef03 2152
kevman 0:38ceb79fef03 2153 cleanup:
kevman 0:38ceb79fef03 2154 mbedtls_mpi_free( &W ); mbedtls_mpi_free( &R ); mbedtls_mpi_free( &T ); mbedtls_mpi_free( &A );
kevman 0:38ceb79fef03 2155 mbedtls_mpi_free( &RR );
kevman 0:38ceb79fef03 2156
kevman 0:38ceb79fef03 2157 return( ret );
kevman 0:38ceb79fef03 2158 }
kevman 0:38ceb79fef03 2159
kevman 0:38ceb79fef03 2160 /*
kevman 0:38ceb79fef03 2161 * Pseudo-primality test: small factors, then Miller-Rabin
kevman 0:38ceb79fef03 2162 */
kevman 0:38ceb79fef03 2163 int mbedtls_mpi_is_prime( const mbedtls_mpi *X,
kevman 0:38ceb79fef03 2164 int (*f_rng)(void *, unsigned char *, size_t),
kevman 0:38ceb79fef03 2165 void *p_rng )
kevman 0:38ceb79fef03 2166 {
kevman 0:38ceb79fef03 2167 int ret;
kevman 0:38ceb79fef03 2168 mbedtls_mpi XX;
kevman 0:38ceb79fef03 2169
kevman 0:38ceb79fef03 2170 XX.s = 1;
kevman 0:38ceb79fef03 2171 XX.n = X->n;
kevman 0:38ceb79fef03 2172 XX.p = X->p;
kevman 0:38ceb79fef03 2173
kevman 0:38ceb79fef03 2174 if( mbedtls_mpi_cmp_int( &XX, 0 ) == 0 ||
kevman 0:38ceb79fef03 2175 mbedtls_mpi_cmp_int( &XX, 1 ) == 0 )
kevman 0:38ceb79fef03 2176 return( MBEDTLS_ERR_MPI_NOT_ACCEPTABLE );
kevman 0:38ceb79fef03 2177
kevman 0:38ceb79fef03 2178 if( mbedtls_mpi_cmp_int( &XX, 2 ) == 0 )
kevman 0:38ceb79fef03 2179 return( 0 );
kevman 0:38ceb79fef03 2180
kevman 0:38ceb79fef03 2181 if( ( ret = mpi_check_small_factors( &XX ) ) != 0 )
kevman 0:38ceb79fef03 2182 {
kevman 0:38ceb79fef03 2183 if( ret == 1 )
kevman 0:38ceb79fef03 2184 return( 0 );
kevman 0:38ceb79fef03 2185
kevman 0:38ceb79fef03 2186 return( ret );
kevman 0:38ceb79fef03 2187 }
kevman 0:38ceb79fef03 2188
kevman 0:38ceb79fef03 2189 return( mpi_miller_rabin( &XX, f_rng, p_rng ) );
kevman 0:38ceb79fef03 2190 }
kevman 0:38ceb79fef03 2191
kevman 0:38ceb79fef03 2192 /*
kevman 0:38ceb79fef03 2193 * Prime number generation
kevman 0:38ceb79fef03 2194 *
kevman 0:38ceb79fef03 2195 * If dh_flag is 0 and nbits is at least 1024, then the procedure
kevman 0:38ceb79fef03 2196 * follows the RSA probably-prime generation method of FIPS 186-4.
kevman 0:38ceb79fef03 2197 * NB. FIPS 186-4 only allows the specific bit lengths of 1024 and 1536.
kevman 0:38ceb79fef03 2198 */
kevman 0:38ceb79fef03 2199 int mbedtls_mpi_gen_prime( mbedtls_mpi *X, size_t nbits, int dh_flag,
kevman 0:38ceb79fef03 2200 int (*f_rng)(void *, unsigned char *, size_t),
kevman 0:38ceb79fef03 2201 void *p_rng )
kevman 0:38ceb79fef03 2202 {
kevman 0:38ceb79fef03 2203 #ifdef MBEDTLS_HAVE_INT64
kevman 0:38ceb79fef03 2204 // ceil(2^63.5)
kevman 0:38ceb79fef03 2205 #define CEIL_MAXUINT_DIV_SQRT2 0xb504f333f9de6485ULL
kevman 0:38ceb79fef03 2206 #else
kevman 0:38ceb79fef03 2207 // ceil(2^31.5)
kevman 0:38ceb79fef03 2208 #define CEIL_MAXUINT_DIV_SQRT2 0xb504f334U
kevman 0:38ceb79fef03 2209 #endif
kevman 0:38ceb79fef03 2210 int ret = MBEDTLS_ERR_MPI_NOT_ACCEPTABLE;
kevman 0:38ceb79fef03 2211 size_t k, n;
kevman 0:38ceb79fef03 2212 mbedtls_mpi_uint r;
kevman 0:38ceb79fef03 2213 mbedtls_mpi Y;
kevman 0:38ceb79fef03 2214
kevman 0:38ceb79fef03 2215 if( nbits < 3 || nbits > MBEDTLS_MPI_MAX_BITS )
kevman 0:38ceb79fef03 2216 return( MBEDTLS_ERR_MPI_BAD_INPUT_DATA );
kevman 0:38ceb79fef03 2217
kevman 0:38ceb79fef03 2218 mbedtls_mpi_init( &Y );
kevman 0:38ceb79fef03 2219
kevman 0:38ceb79fef03 2220 n = BITS_TO_LIMBS( nbits );
kevman 0:38ceb79fef03 2221
kevman 0:38ceb79fef03 2222 while( 1 )
kevman 0:38ceb79fef03 2223 {
kevman 0:38ceb79fef03 2224 MBEDTLS_MPI_CHK( mbedtls_mpi_fill_random( X, n * ciL, f_rng, p_rng ) );
kevman 0:38ceb79fef03 2225 /* make sure generated number is at least (nbits-1)+0.5 bits (FIPS 186-4 §B.3.3 steps 4.4, 5.5) */
kevman 0:38ceb79fef03 2226 if( X->p[n-1] < CEIL_MAXUINT_DIV_SQRT2 ) continue;
kevman 0:38ceb79fef03 2227
kevman 0:38ceb79fef03 2228 k = n * biL;
kevman 0:38ceb79fef03 2229 if( k > nbits ) MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( X, k - nbits ) );
kevman 0:38ceb79fef03 2230 X->p[0] |= 1;
kevman 0:38ceb79fef03 2231
kevman 0:38ceb79fef03 2232 if( dh_flag == 0 )
kevman 0:38ceb79fef03 2233 {
kevman 0:38ceb79fef03 2234 ret = mbedtls_mpi_is_prime( X, f_rng, p_rng );
kevman 0:38ceb79fef03 2235
kevman 0:38ceb79fef03 2236 if( ret != MBEDTLS_ERR_MPI_NOT_ACCEPTABLE )
kevman 0:38ceb79fef03 2237 goto cleanup;
kevman 0:38ceb79fef03 2238 }
kevman 0:38ceb79fef03 2239 else
kevman 0:38ceb79fef03 2240 {
kevman 0:38ceb79fef03 2241 /*
kevman 0:38ceb79fef03 2242 * An necessary condition for Y and X = 2Y + 1 to be prime
kevman 0:38ceb79fef03 2243 * is X = 2 mod 3 (which is equivalent to Y = 2 mod 3).
kevman 0:38ceb79fef03 2244 * Make sure it is satisfied, while keeping X = 3 mod 4
kevman 0:38ceb79fef03 2245 */
kevman 0:38ceb79fef03 2246
kevman 0:38ceb79fef03 2247 X->p[0] |= 2;
kevman 0:38ceb79fef03 2248
kevman 0:38ceb79fef03 2249 MBEDTLS_MPI_CHK( mbedtls_mpi_mod_int( &r, X, 3 ) );
kevman 0:38ceb79fef03 2250 if( r == 0 )
kevman 0:38ceb79fef03 2251 MBEDTLS_MPI_CHK( mbedtls_mpi_add_int( X, X, 8 ) );
kevman 0:38ceb79fef03 2252 else if( r == 1 )
kevman 0:38ceb79fef03 2253 MBEDTLS_MPI_CHK( mbedtls_mpi_add_int( X, X, 4 ) );
kevman 0:38ceb79fef03 2254
kevman 0:38ceb79fef03 2255 /* Set Y = (X-1) / 2, which is X / 2 because X is odd */
kevman 0:38ceb79fef03 2256 MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &Y, X ) );
kevman 0:38ceb79fef03 2257 MBEDTLS_MPI_CHK( mbedtls_mpi_shift_r( &Y, 1 ) );
kevman 0:38ceb79fef03 2258
kevman 0:38ceb79fef03 2259 while( 1 )
kevman 0:38ceb79fef03 2260 {
kevman 0:38ceb79fef03 2261 /*
kevman 0:38ceb79fef03 2262 * First, check small factors for X and Y
kevman 0:38ceb79fef03 2263 * before doing Miller-Rabin on any of them
kevman 0:38ceb79fef03 2264 */
kevman 0:38ceb79fef03 2265 if( ( ret = mpi_check_small_factors( X ) ) == 0 &&
kevman 0:38ceb79fef03 2266 ( ret = mpi_check_small_factors( &Y ) ) == 0 &&
kevman 0:38ceb79fef03 2267 ( ret = mpi_miller_rabin( X, f_rng, p_rng ) ) == 0 &&
kevman 0:38ceb79fef03 2268 ( ret = mpi_miller_rabin( &Y, f_rng, p_rng ) ) == 0 )
kevman 0:38ceb79fef03 2269 goto cleanup;
kevman 0:38ceb79fef03 2270
kevman 0:38ceb79fef03 2271 if( ret != MBEDTLS_ERR_MPI_NOT_ACCEPTABLE )
kevman 0:38ceb79fef03 2272 goto cleanup;
kevman 0:38ceb79fef03 2273
kevman 0:38ceb79fef03 2274 /*
kevman 0:38ceb79fef03 2275 * Next candidates. We want to preserve Y = (X-1) / 2 and
kevman 0:38ceb79fef03 2276 * Y = 1 mod 2 and Y = 2 mod 3 (eq X = 3 mod 4 and X = 2 mod 3)
kevman 0:38ceb79fef03 2277 * so up Y by 6 and X by 12.
kevman 0:38ceb79fef03 2278 */
kevman 0:38ceb79fef03 2279 MBEDTLS_MPI_CHK( mbedtls_mpi_add_int( X, X, 12 ) );
kevman 0:38ceb79fef03 2280 MBEDTLS_MPI_CHK( mbedtls_mpi_add_int( &Y, &Y, 6 ) );
kevman 0:38ceb79fef03 2281 }
kevman 0:38ceb79fef03 2282 }
kevman 0:38ceb79fef03 2283 }
kevman 0:38ceb79fef03 2284
kevman 0:38ceb79fef03 2285 cleanup:
kevman 0:38ceb79fef03 2286
kevman 0:38ceb79fef03 2287 mbedtls_mpi_free( &Y );
kevman 0:38ceb79fef03 2288
kevman 0:38ceb79fef03 2289 return( ret );
kevman 0:38ceb79fef03 2290 }
kevman 0:38ceb79fef03 2291
kevman 0:38ceb79fef03 2292 #endif /* MBEDTLS_GENPRIME */
kevman 0:38ceb79fef03 2293
kevman 0:38ceb79fef03 2294 #if defined(MBEDTLS_SELF_TEST)
kevman 0:38ceb79fef03 2295
kevman 0:38ceb79fef03 2296 #define GCD_PAIR_COUNT 3
kevman 0:38ceb79fef03 2297
kevman 0:38ceb79fef03 2298 static const int gcd_pairs[GCD_PAIR_COUNT][3] =
kevman 0:38ceb79fef03 2299 {
kevman 0:38ceb79fef03 2300 { 693, 609, 21 },
kevman 0:38ceb79fef03 2301 { 1764, 868, 28 },
kevman 0:38ceb79fef03 2302 { 768454923, 542167814, 1 }
kevman 0:38ceb79fef03 2303 };
kevman 0:38ceb79fef03 2304
kevman 0:38ceb79fef03 2305 /*
kevman 0:38ceb79fef03 2306 * Checkup routine
kevman 0:38ceb79fef03 2307 */
kevman 0:38ceb79fef03 2308 int mbedtls_mpi_self_test( int verbose )
kevman 0:38ceb79fef03 2309 {
kevman 0:38ceb79fef03 2310 int ret, i;
kevman 0:38ceb79fef03 2311 mbedtls_mpi A, E, N, X, Y, U, V;
kevman 0:38ceb79fef03 2312
kevman 0:38ceb79fef03 2313 mbedtls_mpi_init( &A ); mbedtls_mpi_init( &E ); mbedtls_mpi_init( &N ); mbedtls_mpi_init( &X );
kevman 0:38ceb79fef03 2314 mbedtls_mpi_init( &Y ); mbedtls_mpi_init( &U ); mbedtls_mpi_init( &V );
kevman 0:38ceb79fef03 2315
kevman 0:38ceb79fef03 2316 MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &A, 16,
kevman 0:38ceb79fef03 2317 "EFE021C2645FD1DC586E69184AF4A31E" \
kevman 0:38ceb79fef03 2318 "D5F53E93B5F123FA41680867BA110131" \
kevman 0:38ceb79fef03 2319 "944FE7952E2517337780CB0DB80E61AA" \
kevman 0:38ceb79fef03 2320 "E7C8DDC6C5C6AADEB34EB38A2F40D5E6" ) );
kevman 0:38ceb79fef03 2321
kevman 0:38ceb79fef03 2322 MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &E, 16,
kevman 0:38ceb79fef03 2323 "B2E7EFD37075B9F03FF989C7C5051C20" \
kevman 0:38ceb79fef03 2324 "34D2A323810251127E7BF8625A4F49A5" \
kevman 0:38ceb79fef03 2325 "F3E27F4DA8BD59C47D6DAABA4C8127BD" \
kevman 0:38ceb79fef03 2326 "5B5C25763222FEFCCFC38B832366C29E" ) );
kevman 0:38ceb79fef03 2327
kevman 0:38ceb79fef03 2328 MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &N, 16,
kevman 0:38ceb79fef03 2329 "0066A198186C18C10B2F5ED9B522752A" \
kevman 0:38ceb79fef03 2330 "9830B69916E535C8F047518A889A43A5" \
kevman 0:38ceb79fef03 2331 "94B6BED27A168D31D4A52F88925AA8F5" ) );
kevman 0:38ceb79fef03 2332
kevman 0:38ceb79fef03 2333 MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &X, &A, &N ) );
kevman 0:38ceb79fef03 2334
kevman 0:38ceb79fef03 2335 MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &U, 16,
kevman 0:38ceb79fef03 2336 "602AB7ECA597A3D6B56FF9829A5E8B85" \
kevman 0:38ceb79fef03 2337 "9E857EA95A03512E2BAE7391688D264A" \
kevman 0:38ceb79fef03 2338 "A5663B0341DB9CCFD2C4C5F421FEC814" \
kevman 0:38ceb79fef03 2339 "8001B72E848A38CAE1C65F78E56ABDEF" \
kevman 0:38ceb79fef03 2340 "E12D3C039B8A02D6BE593F0BBBDA56F1" \
kevman 0:38ceb79fef03 2341 "ECF677152EF804370C1A305CAF3B5BF1" \
kevman 0:38ceb79fef03 2342 "30879B56C61DE584A0F53A2447A51E" ) );
kevman 0:38ceb79fef03 2343
kevman 0:38ceb79fef03 2344 if( verbose != 0 )
kevman 0:38ceb79fef03 2345 mbedtls_printf( " MPI test #1 (mul_mpi): " );
kevman 0:38ceb79fef03 2346
kevman 0:38ceb79fef03 2347 if( mbedtls_mpi_cmp_mpi( &X, &U ) != 0 )
kevman 0:38ceb79fef03 2348 {
kevman 0:38ceb79fef03 2349 if( verbose != 0 )
kevman 0:38ceb79fef03 2350 mbedtls_printf( "failed\n" );
kevman 0:38ceb79fef03 2351
kevman 0:38ceb79fef03 2352 ret = 1;
kevman 0:38ceb79fef03 2353 goto cleanup;
kevman 0:38ceb79fef03 2354 }
kevman 0:38ceb79fef03 2355
kevman 0:38ceb79fef03 2356 if( verbose != 0 )
kevman 0:38ceb79fef03 2357 mbedtls_printf( "passed\n" );
kevman 0:38ceb79fef03 2358
kevman 0:38ceb79fef03 2359 MBEDTLS_MPI_CHK( mbedtls_mpi_div_mpi( &X, &Y, &A, &N ) );
kevman 0:38ceb79fef03 2360
kevman 0:38ceb79fef03 2361 MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &U, 16,
kevman 0:38ceb79fef03 2362 "256567336059E52CAE22925474705F39A94" ) );
kevman 0:38ceb79fef03 2363
kevman 0:38ceb79fef03 2364 MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &V, 16,
kevman 0:38ceb79fef03 2365 "6613F26162223DF488E9CD48CC132C7A" \
kevman 0:38ceb79fef03 2366 "0AC93C701B001B092E4E5B9F73BCD27B" \
kevman 0:38ceb79fef03 2367 "9EE50D0657C77F374E903CDFA4C642" ) );
kevman 0:38ceb79fef03 2368
kevman 0:38ceb79fef03 2369 if( verbose != 0 )
kevman 0:38ceb79fef03 2370 mbedtls_printf( " MPI test #2 (div_mpi): " );
kevman 0:38ceb79fef03 2371
kevman 0:38ceb79fef03 2372 if( mbedtls_mpi_cmp_mpi( &X, &U ) != 0 ||
kevman 0:38ceb79fef03 2373 mbedtls_mpi_cmp_mpi( &Y, &V ) != 0 )
kevman 0:38ceb79fef03 2374 {
kevman 0:38ceb79fef03 2375 if( verbose != 0 )
kevman 0:38ceb79fef03 2376 mbedtls_printf( "failed\n" );
kevman 0:38ceb79fef03 2377
kevman 0:38ceb79fef03 2378 ret = 1;
kevman 0:38ceb79fef03 2379 goto cleanup;
kevman 0:38ceb79fef03 2380 }
kevman 0:38ceb79fef03 2381
kevman 0:38ceb79fef03 2382 if( verbose != 0 )
kevman 0:38ceb79fef03 2383 mbedtls_printf( "passed\n" );
kevman 0:38ceb79fef03 2384
kevman 0:38ceb79fef03 2385 MBEDTLS_MPI_CHK( mbedtls_mpi_exp_mod( &X, &A, &E, &N, NULL ) );
kevman 0:38ceb79fef03 2386
kevman 0:38ceb79fef03 2387 MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &U, 16,
kevman 0:38ceb79fef03 2388 "36E139AEA55215609D2816998ED020BB" \
kevman 0:38ceb79fef03 2389 "BD96C37890F65171D948E9BC7CBAA4D9" \
kevman 0:38ceb79fef03 2390 "325D24D6A3C12710F10A09FA08AB87" ) );
kevman 0:38ceb79fef03 2391
kevman 0:38ceb79fef03 2392 if( verbose != 0 )
kevman 0:38ceb79fef03 2393 mbedtls_printf( " MPI test #3 (exp_mod): " );
kevman 0:38ceb79fef03 2394
kevman 0:38ceb79fef03 2395 if( mbedtls_mpi_cmp_mpi( &X, &U ) != 0 )
kevman 0:38ceb79fef03 2396 {
kevman 0:38ceb79fef03 2397 if( verbose != 0 )
kevman 0:38ceb79fef03 2398 mbedtls_printf( "failed\n" );
kevman 0:38ceb79fef03 2399
kevman 0:38ceb79fef03 2400 ret = 1;
kevman 0:38ceb79fef03 2401 goto cleanup;
kevman 0:38ceb79fef03 2402 }
kevman 0:38ceb79fef03 2403
kevman 0:38ceb79fef03 2404 if( verbose != 0 )
kevman 0:38ceb79fef03 2405 mbedtls_printf( "passed\n" );
kevman 0:38ceb79fef03 2406
kevman 0:38ceb79fef03 2407 MBEDTLS_MPI_CHK( mbedtls_mpi_inv_mod( &X, &A, &N ) );
kevman 0:38ceb79fef03 2408
kevman 0:38ceb79fef03 2409 MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &U, 16,
kevman 0:38ceb79fef03 2410 "003A0AAEDD7E784FC07D8F9EC6E3BFD5" \
kevman 0:38ceb79fef03 2411 "C3DBA76456363A10869622EAC2DD84EC" \
kevman 0:38ceb79fef03 2412 "C5B8A74DAC4D09E03B5E0BE779F2DF61" ) );
kevman 0:38ceb79fef03 2413
kevman 0:38ceb79fef03 2414 if( verbose != 0 )
kevman 0:38ceb79fef03 2415 mbedtls_printf( " MPI test #4 (inv_mod): " );
kevman 0:38ceb79fef03 2416
kevman 0:38ceb79fef03 2417 if( mbedtls_mpi_cmp_mpi( &X, &U ) != 0 )
kevman 0:38ceb79fef03 2418 {
kevman 0:38ceb79fef03 2419 if( verbose != 0 )
kevman 0:38ceb79fef03 2420 mbedtls_printf( "failed\n" );
kevman 0:38ceb79fef03 2421
kevman 0:38ceb79fef03 2422 ret = 1;
kevman 0:38ceb79fef03 2423 goto cleanup;
kevman 0:38ceb79fef03 2424 }
kevman 0:38ceb79fef03 2425
kevman 0:38ceb79fef03 2426 if( verbose != 0 )
kevman 0:38ceb79fef03 2427 mbedtls_printf( "passed\n" );
kevman 0:38ceb79fef03 2428
kevman 0:38ceb79fef03 2429 if( verbose != 0 )
kevman 0:38ceb79fef03 2430 mbedtls_printf( " MPI test #5 (simple gcd): " );
kevman 0:38ceb79fef03 2431
kevman 0:38ceb79fef03 2432 for( i = 0; i < GCD_PAIR_COUNT; i++ )
kevman 0:38ceb79fef03 2433 {
kevman 0:38ceb79fef03 2434 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &X, gcd_pairs[i][0] ) );
kevman 0:38ceb79fef03 2435 MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &Y, gcd_pairs[i][1] ) );
kevman 0:38ceb79fef03 2436
kevman 0:38ceb79fef03 2437 MBEDTLS_MPI_CHK( mbedtls_mpi_gcd( &A, &X, &Y ) );
kevman 0:38ceb79fef03 2438
kevman 0:38ceb79fef03 2439 if( mbedtls_mpi_cmp_int( &A, gcd_pairs[i][2] ) != 0 )
kevman 0:38ceb79fef03 2440 {
kevman 0:38ceb79fef03 2441 if( verbose != 0 )
kevman 0:38ceb79fef03 2442 mbedtls_printf( "failed at %d\n", i );
kevman 0:38ceb79fef03 2443
kevman 0:38ceb79fef03 2444 ret = 1;
kevman 0:38ceb79fef03 2445 goto cleanup;
kevman 0:38ceb79fef03 2446 }
kevman 0:38ceb79fef03 2447 }
kevman 0:38ceb79fef03 2448
kevman 0:38ceb79fef03 2449 if( verbose != 0 )
kevman 0:38ceb79fef03 2450 mbedtls_printf( "passed\n" );
kevman 0:38ceb79fef03 2451
kevman 0:38ceb79fef03 2452 cleanup:
kevman 0:38ceb79fef03 2453
kevman 0:38ceb79fef03 2454 if( ret != 0 && verbose != 0 )
kevman 0:38ceb79fef03 2455 mbedtls_printf( "Unexpected error, return code = %08X\n", ret );
kevman 0:38ceb79fef03 2456
kevman 0:38ceb79fef03 2457 mbedtls_mpi_free( &A ); mbedtls_mpi_free( &E ); mbedtls_mpi_free( &N ); mbedtls_mpi_free( &X );
kevman 0:38ceb79fef03 2458 mbedtls_mpi_free( &Y ); mbedtls_mpi_free( &U ); mbedtls_mpi_free( &V );
kevman 0:38ceb79fef03 2459
kevman 0:38ceb79fef03 2460 if( verbose != 0 )
kevman 0:38ceb79fef03 2461 mbedtls_printf( "\n" );
kevman 0:38ceb79fef03 2462
kevman 0:38ceb79fef03 2463 return( ret );
kevman 0:38ceb79fef03 2464 }
kevman 0:38ceb79fef03 2465
kevman 0:38ceb79fef03 2466 #endif /* MBEDTLS_SELF_TEST */
kevman 0:38ceb79fef03 2467
kevman 0:38ceb79fef03 2468 #endif /* MBEDTLS_BIGNUM_C */