WNCInterface - I added functionality to get the RSSI, BER, and C…

Users » ng977t » Code » WNCInterface

I added functionality to get the RSSI, BER, and Cell Neighbor for reporting connection issues to M2X

mbedtls/source/bignum.c@16:8a4105d407d3, 2016-11-14 (annotated)

Committer:: JMF
Date:: Mon Nov 14 21:15:42 2016 +0000
Revision:: 16:8a4105d407d3
Parent:: 12:0071cb144c7a

updated to ensure it builds with TLS by correcting config defaults.

Who changed what in which revision?

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

Repository toolbox

Export to desktop IDE

Build repository

Repository details

Type:	Program
Created:	18 Apr 2019
Imports:	0
Forks:	0
Commits:	32
Dependents:	0
Dependencies:	1
Followers:	1

mbedtls/source/bignum.c@16:8a4105d407d3, 2016-11-14 (annotated)

Who changed what in which revision?

Repository toolbox

Repository details

Important Information for this Arm website

Access Warning