mbed-os | Mbed

EL4121 Embedded System » Code » mbed-os

Dependents: cobaLCDJoyMotor_Thread odometry_omni_3roda_v3 odometry_omni_3roda_v1 odometry_omni_3roda_v2 ... more

features/mbedtls/src/rsa.c@0:b74591d5ab33, 2017-12-11 (annotated)

Committer:: be_bryan
Date:: Mon Dec 11 17:54:04 2017 +0000
Revision:: 0:b74591d5ab33

motor ++

Who changed what in which revision?

User	Revision	Line number	New contents of line
be_bryan	0:b74591d5ab33	1	/*
be_bryan	0:b74591d5ab33	2	* The RSA public-key cryptosystem
be_bryan	0:b74591d5ab33	3	*
be_bryan	0:b74591d5ab33	4	* Copyright (C) 2006-2015, ARM Limited, All Rights Reserved
be_bryan	0:b74591d5ab33	5	* SPDX-License-Identifier: Apache-2.0
be_bryan	0:b74591d5ab33	6	*
be_bryan	0:b74591d5ab33	7	* Licensed under the Apache License, Version 2.0 (the "License"); you may
be_bryan	0:b74591d5ab33	8	* not use this file except in compliance with the License.
be_bryan	0:b74591d5ab33	9	* You may obtain a copy of the License at
be_bryan	0:b74591d5ab33	10	*
be_bryan	0:b74591d5ab33	11	* http://www.apache.org/licenses/LICENSE-2.0
be_bryan	0:b74591d5ab33	12	*
be_bryan	0:b74591d5ab33	13	* Unless required by applicable law or agreed to in writing, software
be_bryan	0:b74591d5ab33	14	* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
be_bryan	0:b74591d5ab33	15	* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
be_bryan	0:b74591d5ab33	16	* See the License for the specific language governing permissions and
be_bryan	0:b74591d5ab33	17	* limitations under the License.
be_bryan	0:b74591d5ab33	18	*
be_bryan	0:b74591d5ab33	19	* This file is part of mbed TLS (https://tls.mbed.org)
be_bryan	0:b74591d5ab33	20	*/
be_bryan	0:b74591d5ab33	21	/*
be_bryan	0:b74591d5ab33	22	* The following sources were referenced in the design of this implementation
be_bryan	0:b74591d5ab33	23	* of the RSA algorithm:
be_bryan	0:b74591d5ab33	24	*
be_bryan	0:b74591d5ab33	25	* [1] A method for obtaining digital signatures and public-key cryptosystems
be_bryan	0:b74591d5ab33	26	* R Rivest, A Shamir, and L Adleman
be_bryan	0:b74591d5ab33	27	* http://people.csail.mit.edu/rivest/pubs.html#RSA78
be_bryan	0:b74591d5ab33	28	*
be_bryan	0:b74591d5ab33	29	* [2] Handbook of Applied Cryptography - 1997, Chapter 8
be_bryan	0:b74591d5ab33	30	* Menezes, van Oorschot and Vanstone
be_bryan	0:b74591d5ab33	31	*
be_bryan	0:b74591d5ab33	32	* [3] Malware Guard Extension: Using SGX to Conceal Cache Attacks
be_bryan	0:b74591d5ab33	33	* Michael Schwarz, Samuel Weiser, Daniel Gruss, Clémentine Maurice and
be_bryan	0:b74591d5ab33	34	* Stefan Mangard
be_bryan	0:b74591d5ab33	35	* https://arxiv.org/abs/1702.08719v2
be_bryan	0:b74591d5ab33	36	*
be_bryan	0:b74591d5ab33	37	*/
be_bryan	0:b74591d5ab33	38
be_bryan	0:b74591d5ab33	39	#if !defined(MBEDTLS_CONFIG_FILE)
be_bryan	0:b74591d5ab33	40	#include "mbedtls/config.h"
be_bryan	0:b74591d5ab33	41	#else
be_bryan	0:b74591d5ab33	42	#include MBEDTLS_CONFIG_FILE
be_bryan	0:b74591d5ab33	43	#endif
be_bryan	0:b74591d5ab33	44
be_bryan	0:b74591d5ab33	45	#if defined(MBEDTLS_RSA_C)
be_bryan	0:b74591d5ab33	46
be_bryan	0:b74591d5ab33	47	#include "mbedtls/rsa.h"
be_bryan	0:b74591d5ab33	48	#include "mbedtls/oid.h"
be_bryan	0:b74591d5ab33	49
be_bryan	0:b74591d5ab33	50	#include <string.h>
be_bryan	0:b74591d5ab33	51
be_bryan	0:b74591d5ab33	52	#if defined(MBEDTLS_PKCS1_V21)
be_bryan	0:b74591d5ab33	53	#include "mbedtls/md.h"
be_bryan	0:b74591d5ab33	54	#endif
be_bryan	0:b74591d5ab33	55
be_bryan	0:b74591d5ab33	56	#if defined(MBEDTLS_PKCS1_V15) && !defined(__OpenBSD__)
be_bryan	0:b74591d5ab33	57	#include <stdlib.h>
be_bryan	0:b74591d5ab33	58	#endif
be_bryan	0:b74591d5ab33	59
be_bryan	0:b74591d5ab33	60	#if defined(MBEDTLS_PLATFORM_C)
be_bryan	0:b74591d5ab33	61	#include "mbedtls/platform.h"
be_bryan	0:b74591d5ab33	62	#else
be_bryan	0:b74591d5ab33	63	#include <stdio.h>
be_bryan	0:b74591d5ab33	64	#define mbedtls_printf printf
be_bryan	0:b74591d5ab33	65	#define mbedtls_calloc calloc
be_bryan	0:b74591d5ab33	66	#define mbedtls_free free
be_bryan	0:b74591d5ab33	67	#endif
be_bryan	0:b74591d5ab33	68
be_bryan	0:b74591d5ab33	69	/* Implementation that should never be optimized out by the compiler */
be_bryan	0:b74591d5ab33	70	static void mbedtls_zeroize( void *v, size_t n ) {
be_bryan	0:b74591d5ab33	71	volatile unsigned char p = (unsigned char)v; while( n-- ) *p++ = 0;
be_bryan	0:b74591d5ab33	72	}
be_bryan	0:b74591d5ab33	73
be_bryan	0:b74591d5ab33	74	/*
be_bryan	0:b74591d5ab33	75	* Initialize an RSA context
be_bryan	0:b74591d5ab33	76	*/
be_bryan	0:b74591d5ab33	77	void mbedtls_rsa_init( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	78	int padding,
be_bryan	0:b74591d5ab33	79	int hash_id )
be_bryan	0:b74591d5ab33	80	{
be_bryan	0:b74591d5ab33	81	memset( ctx, 0, sizeof( mbedtls_rsa_context ) );
be_bryan	0:b74591d5ab33	82
be_bryan	0:b74591d5ab33	83	mbedtls_rsa_set_padding( ctx, padding, hash_id );
be_bryan	0:b74591d5ab33	84
be_bryan	0:b74591d5ab33	85	#if defined(MBEDTLS_THREADING_C)
be_bryan	0:b74591d5ab33	86	mbedtls_mutex_init( &ctx->mutex );
be_bryan	0:b74591d5ab33	87	#endif
be_bryan	0:b74591d5ab33	88	}
be_bryan	0:b74591d5ab33	89
be_bryan	0:b74591d5ab33	90	/*
be_bryan	0:b74591d5ab33	91	* Set padding for an existing RSA context
be_bryan	0:b74591d5ab33	92	*/
be_bryan	0:b74591d5ab33	93	void mbedtls_rsa_set_padding( mbedtls_rsa_context *ctx, int padding, int hash_id )
be_bryan	0:b74591d5ab33	94	{
be_bryan	0:b74591d5ab33	95	ctx->padding = padding;
be_bryan	0:b74591d5ab33	96	ctx->hash_id = hash_id;
be_bryan	0:b74591d5ab33	97	}
be_bryan	0:b74591d5ab33	98
be_bryan	0:b74591d5ab33	99	#if defined(MBEDTLS_GENPRIME)
be_bryan	0:b74591d5ab33	100
be_bryan	0:b74591d5ab33	101	/*
be_bryan	0:b74591d5ab33	102	* Generate an RSA keypair
be_bryan	0:b74591d5ab33	103	*/
be_bryan	0:b74591d5ab33	104	int mbedtls_rsa_gen_key( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	105	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	106	void *p_rng,
be_bryan	0:b74591d5ab33	107	unsigned int nbits, int exponent )
be_bryan	0:b74591d5ab33	108	{
be_bryan	0:b74591d5ab33	109	int ret;
be_bryan	0:b74591d5ab33	110	mbedtls_mpi P1, Q1, H, G;
be_bryan	0:b74591d5ab33	111
be_bryan	0:b74591d5ab33	112	if( f_rng == NULL \|\| nbits < 128 \|\| exponent < 3 )
be_bryan	0:b74591d5ab33	113	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	114
be_bryan	0:b74591d5ab33	115	if( nbits % 2 )
be_bryan	0:b74591d5ab33	116	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	117
be_bryan	0:b74591d5ab33	118	mbedtls_mpi_init( &P1 ); mbedtls_mpi_init( &Q1 );
be_bryan	0:b74591d5ab33	119	mbedtls_mpi_init( &H ); mbedtls_mpi_init( &G );
be_bryan	0:b74591d5ab33	120
be_bryan	0:b74591d5ab33	121	/*
be_bryan	0:b74591d5ab33	122	* find primes P and Q with Q < P so that:
be_bryan	0:b74591d5ab33	123	* GCD( E, (P-1)*(Q-1) ) == 1
be_bryan	0:b74591d5ab33	124	*/
be_bryan	0:b74591d5ab33	125	MBEDTLS_MPI_CHK( mbedtls_mpi_lset( &ctx->E, exponent ) );
be_bryan	0:b74591d5ab33	126
be_bryan	0:b74591d5ab33	127	do
be_bryan	0:b74591d5ab33	128	{
be_bryan	0:b74591d5ab33	129	MBEDTLS_MPI_CHK( mbedtls_mpi_gen_prime( &ctx->P, nbits >> 1, 0,
be_bryan	0:b74591d5ab33	130	f_rng, p_rng ) );
be_bryan	0:b74591d5ab33	131
be_bryan	0:b74591d5ab33	132	MBEDTLS_MPI_CHK( mbedtls_mpi_gen_prime( &ctx->Q, nbits >> 1, 0,
be_bryan	0:b74591d5ab33	133	f_rng, p_rng ) );
be_bryan	0:b74591d5ab33	134
be_bryan	0:b74591d5ab33	135	if( mbedtls_mpi_cmp_mpi( &ctx->P, &ctx->Q ) == 0 )
be_bryan	0:b74591d5ab33	136	continue;
be_bryan	0:b74591d5ab33	137
be_bryan	0:b74591d5ab33	138	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &ctx->N, &ctx->P, &ctx->Q ) );
be_bryan	0:b74591d5ab33	139	if( mbedtls_mpi_bitlen( &ctx->N ) != nbits )
be_bryan	0:b74591d5ab33	140	continue;
be_bryan	0:b74591d5ab33	141
be_bryan	0:b74591d5ab33	142	if( mbedtls_mpi_cmp_mpi( &ctx->P, &ctx->Q ) < 0 )
be_bryan	0:b74591d5ab33	143	mbedtls_mpi_swap( &ctx->P, &ctx->Q );
be_bryan	0:b74591d5ab33	144
be_bryan	0:b74591d5ab33	145	MBEDTLS_MPI_CHK( mbedtls_mpi_sub_int( &P1, &ctx->P, 1 ) );
be_bryan	0:b74591d5ab33	146	MBEDTLS_MPI_CHK( mbedtls_mpi_sub_int( &Q1, &ctx->Q, 1 ) );
be_bryan	0:b74591d5ab33	147	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &H, &P1, &Q1 ) );
be_bryan	0:b74591d5ab33	148	MBEDTLS_MPI_CHK( mbedtls_mpi_gcd( &G, &ctx->E, &H ) );
be_bryan	0:b74591d5ab33	149	}
be_bryan	0:b74591d5ab33	150	while( mbedtls_mpi_cmp_int( &G, 1 ) != 0 );
be_bryan	0:b74591d5ab33	151
be_bryan	0:b74591d5ab33	152	/*
be_bryan	0:b74591d5ab33	153	* D = E^-1 mod ((P-1)*(Q-1))
be_bryan	0:b74591d5ab33	154	* DP = D mod (P - 1)
be_bryan	0:b74591d5ab33	155	* DQ = D mod (Q - 1)
be_bryan	0:b74591d5ab33	156	* QP = Q^-1 mod P
be_bryan	0:b74591d5ab33	157	*/
be_bryan	0:b74591d5ab33	158	MBEDTLS_MPI_CHK( mbedtls_mpi_inv_mod( &ctx->D , &ctx->E, &H ) );
be_bryan	0:b74591d5ab33	159	MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &ctx->DP, &ctx->D, &P1 ) );
be_bryan	0:b74591d5ab33	160	MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &ctx->DQ, &ctx->D, &Q1 ) );
be_bryan	0:b74591d5ab33	161	MBEDTLS_MPI_CHK( mbedtls_mpi_inv_mod( &ctx->QP, &ctx->Q, &ctx->P ) );
be_bryan	0:b74591d5ab33	162
be_bryan	0:b74591d5ab33	163	ctx->len = ( mbedtls_mpi_bitlen( &ctx->N ) + 7 ) >> 3;
be_bryan	0:b74591d5ab33	164
be_bryan	0:b74591d5ab33	165	cleanup:
be_bryan	0:b74591d5ab33	166
be_bryan	0:b74591d5ab33	167	mbedtls_mpi_free( &P1 ); mbedtls_mpi_free( &Q1 ); mbedtls_mpi_free( &H ); mbedtls_mpi_free( &G );
be_bryan	0:b74591d5ab33	168
be_bryan	0:b74591d5ab33	169	if( ret != 0 )
be_bryan	0:b74591d5ab33	170	{
be_bryan	0:b74591d5ab33	171	mbedtls_rsa_free( ctx );
be_bryan	0:b74591d5ab33	172	return( MBEDTLS_ERR_RSA_KEY_GEN_FAILED + ret );
be_bryan	0:b74591d5ab33	173	}
be_bryan	0:b74591d5ab33	174
be_bryan	0:b74591d5ab33	175	return( 0 );
be_bryan	0:b74591d5ab33	176	}
be_bryan	0:b74591d5ab33	177
be_bryan	0:b74591d5ab33	178	#endif /* MBEDTLS_GENPRIME */
be_bryan	0:b74591d5ab33	179
be_bryan	0:b74591d5ab33	180	/*
be_bryan	0:b74591d5ab33	181	* Check a public RSA key
be_bryan	0:b74591d5ab33	182	*/
be_bryan	0:b74591d5ab33	183	int mbedtls_rsa_check_pubkey( const mbedtls_rsa_context *ctx )
be_bryan	0:b74591d5ab33	184	{
be_bryan	0:b74591d5ab33	185	if( !ctx->N.p \|\| !ctx->E.p )
be_bryan	0:b74591d5ab33	186	return( MBEDTLS_ERR_RSA_KEY_CHECK_FAILED );
be_bryan	0:b74591d5ab33	187
be_bryan	0:b74591d5ab33	188	if( ( ctx->N.p[0] & 1 ) == 0 \|\|
be_bryan	0:b74591d5ab33	189	( ctx->E.p[0] & 1 ) == 0 )
be_bryan	0:b74591d5ab33	190	return( MBEDTLS_ERR_RSA_KEY_CHECK_FAILED );
be_bryan	0:b74591d5ab33	191
be_bryan	0:b74591d5ab33	192	if( mbedtls_mpi_bitlen( &ctx->N ) < 128 \|\|
be_bryan	0:b74591d5ab33	193	mbedtls_mpi_bitlen( &ctx->N ) > MBEDTLS_MPI_MAX_BITS )
be_bryan	0:b74591d5ab33	194	return( MBEDTLS_ERR_RSA_KEY_CHECK_FAILED );
be_bryan	0:b74591d5ab33	195
be_bryan	0:b74591d5ab33	196	if( mbedtls_mpi_bitlen( &ctx->E ) < 2 \|\|
be_bryan	0:b74591d5ab33	197	mbedtls_mpi_cmp_mpi( &ctx->E, &ctx->N ) >= 0 )
be_bryan	0:b74591d5ab33	198	return( MBEDTLS_ERR_RSA_KEY_CHECK_FAILED );
be_bryan	0:b74591d5ab33	199
be_bryan	0:b74591d5ab33	200	return( 0 );
be_bryan	0:b74591d5ab33	201	}
be_bryan	0:b74591d5ab33	202
be_bryan	0:b74591d5ab33	203	/*
be_bryan	0:b74591d5ab33	204	* Check a private RSA key
be_bryan	0:b74591d5ab33	205	*/
be_bryan	0:b74591d5ab33	206	int mbedtls_rsa_check_privkey( const mbedtls_rsa_context *ctx )
be_bryan	0:b74591d5ab33	207	{
be_bryan	0:b74591d5ab33	208	int ret;
be_bryan	0:b74591d5ab33	209	mbedtls_mpi PQ, DE, P1, Q1, H, I, G, G2, L1, L2, DP, DQ, QP;
be_bryan	0:b74591d5ab33	210
be_bryan	0:b74591d5ab33	211	if( ( ret = mbedtls_rsa_check_pubkey( ctx ) ) != 0 )
be_bryan	0:b74591d5ab33	212	return( ret );
be_bryan	0:b74591d5ab33	213
be_bryan	0:b74591d5ab33	214	if( !ctx->P.p \|\| !ctx->Q.p \|\| !ctx->D.p )
be_bryan	0:b74591d5ab33	215	return( MBEDTLS_ERR_RSA_KEY_CHECK_FAILED );
be_bryan	0:b74591d5ab33	216
be_bryan	0:b74591d5ab33	217	mbedtls_mpi_init( &PQ ); mbedtls_mpi_init( &DE ); mbedtls_mpi_init( &P1 ); mbedtls_mpi_init( &Q1 );
be_bryan	0:b74591d5ab33	218	mbedtls_mpi_init( &H ); mbedtls_mpi_init( &I ); mbedtls_mpi_init( &G ); mbedtls_mpi_init( &G2 );
be_bryan	0:b74591d5ab33	219	mbedtls_mpi_init( &L1 ); mbedtls_mpi_init( &L2 ); mbedtls_mpi_init( &DP ); mbedtls_mpi_init( &DQ );
be_bryan	0:b74591d5ab33	220	mbedtls_mpi_init( &QP );
be_bryan	0:b74591d5ab33	221
be_bryan	0:b74591d5ab33	222	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &PQ, &ctx->P, &ctx->Q ) );
be_bryan	0:b74591d5ab33	223	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &DE, &ctx->D, &ctx->E ) );
be_bryan	0:b74591d5ab33	224	MBEDTLS_MPI_CHK( mbedtls_mpi_sub_int( &P1, &ctx->P, 1 ) );
be_bryan	0:b74591d5ab33	225	MBEDTLS_MPI_CHK( mbedtls_mpi_sub_int( &Q1, &ctx->Q, 1 ) );
be_bryan	0:b74591d5ab33	226	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &H, &P1, &Q1 ) );
be_bryan	0:b74591d5ab33	227	MBEDTLS_MPI_CHK( mbedtls_mpi_gcd( &G, &ctx->E, &H ) );
be_bryan	0:b74591d5ab33	228
be_bryan	0:b74591d5ab33	229	MBEDTLS_MPI_CHK( mbedtls_mpi_gcd( &G2, &P1, &Q1 ) );
be_bryan	0:b74591d5ab33	230	MBEDTLS_MPI_CHK( mbedtls_mpi_div_mpi( &L1, &L2, &H, &G2 ) );
be_bryan	0:b74591d5ab33	231	MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &I, &DE, &L1 ) );
be_bryan	0:b74591d5ab33	232
be_bryan	0:b74591d5ab33	233	MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &DP, &ctx->D, &P1 ) );
be_bryan	0:b74591d5ab33	234	MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &DQ, &ctx->D, &Q1 ) );
be_bryan	0:b74591d5ab33	235	MBEDTLS_MPI_CHK( mbedtls_mpi_inv_mod( &QP, &ctx->Q, &ctx->P ) );
be_bryan	0:b74591d5ab33	236	/*
be_bryan	0:b74591d5ab33	237	* Check for a valid PKCS1v2 private key
be_bryan	0:b74591d5ab33	238	*/
be_bryan	0:b74591d5ab33	239	if( mbedtls_mpi_cmp_mpi( &PQ, &ctx->N ) != 0 \|\|
be_bryan	0:b74591d5ab33	240	mbedtls_mpi_cmp_mpi( &DP, &ctx->DP ) != 0 \|\|
be_bryan	0:b74591d5ab33	241	mbedtls_mpi_cmp_mpi( &DQ, &ctx->DQ ) != 0 \|\|
be_bryan	0:b74591d5ab33	242	mbedtls_mpi_cmp_mpi( &QP, &ctx->QP ) != 0 \|\|
be_bryan	0:b74591d5ab33	243	mbedtls_mpi_cmp_int( &L2, 0 ) != 0 \|\|
be_bryan	0:b74591d5ab33	244	mbedtls_mpi_cmp_int( &I, 1 ) != 0 \|\|
be_bryan	0:b74591d5ab33	245	mbedtls_mpi_cmp_int( &G, 1 ) != 0 )
be_bryan	0:b74591d5ab33	246	{
be_bryan	0:b74591d5ab33	247	ret = MBEDTLS_ERR_RSA_KEY_CHECK_FAILED;
be_bryan	0:b74591d5ab33	248	}
be_bryan	0:b74591d5ab33	249
be_bryan	0:b74591d5ab33	250	cleanup:
be_bryan	0:b74591d5ab33	251	mbedtls_mpi_free( &PQ ); mbedtls_mpi_free( &DE ); mbedtls_mpi_free( &P1 ); mbedtls_mpi_free( &Q1 );
be_bryan	0:b74591d5ab33	252	mbedtls_mpi_free( &H ); mbedtls_mpi_free( &I ); mbedtls_mpi_free( &G ); mbedtls_mpi_free( &G2 );
be_bryan	0:b74591d5ab33	253	mbedtls_mpi_free( &L1 ); mbedtls_mpi_free( &L2 ); mbedtls_mpi_free( &DP ); mbedtls_mpi_free( &DQ );
be_bryan	0:b74591d5ab33	254	mbedtls_mpi_free( &QP );
be_bryan	0:b74591d5ab33	255
be_bryan	0:b74591d5ab33	256	if( ret == MBEDTLS_ERR_RSA_KEY_CHECK_FAILED )
be_bryan	0:b74591d5ab33	257	return( ret );
be_bryan	0:b74591d5ab33	258
be_bryan	0:b74591d5ab33	259	if( ret != 0 )
be_bryan	0:b74591d5ab33	260	return( MBEDTLS_ERR_RSA_KEY_CHECK_FAILED + ret );
be_bryan	0:b74591d5ab33	261
be_bryan	0:b74591d5ab33	262	return( 0 );
be_bryan	0:b74591d5ab33	263	}
be_bryan	0:b74591d5ab33	264
be_bryan	0:b74591d5ab33	265	/*
be_bryan	0:b74591d5ab33	266	* Check if contexts holding a public and private key match
be_bryan	0:b74591d5ab33	267	*/
be_bryan	0:b74591d5ab33	268	int mbedtls_rsa_check_pub_priv( const mbedtls_rsa_context pub, const mbedtls_rsa_context prv )
be_bryan	0:b74591d5ab33	269	{
be_bryan	0:b74591d5ab33	270	if( mbedtls_rsa_check_pubkey( pub ) != 0 \|\|
be_bryan	0:b74591d5ab33	271	mbedtls_rsa_check_privkey( prv ) != 0 )
be_bryan	0:b74591d5ab33	272	{
be_bryan	0:b74591d5ab33	273	return( MBEDTLS_ERR_RSA_KEY_CHECK_FAILED );
be_bryan	0:b74591d5ab33	274	}
be_bryan	0:b74591d5ab33	275
be_bryan	0:b74591d5ab33	276	if( mbedtls_mpi_cmp_mpi( &pub->N, &prv->N ) != 0 \|\|
be_bryan	0:b74591d5ab33	277	mbedtls_mpi_cmp_mpi( &pub->E, &prv->E ) != 0 )
be_bryan	0:b74591d5ab33	278	{
be_bryan	0:b74591d5ab33	279	return( MBEDTLS_ERR_RSA_KEY_CHECK_FAILED );
be_bryan	0:b74591d5ab33	280	}
be_bryan	0:b74591d5ab33	281
be_bryan	0:b74591d5ab33	282	return( 0 );
be_bryan	0:b74591d5ab33	283	}
be_bryan	0:b74591d5ab33	284
be_bryan	0:b74591d5ab33	285	/*
be_bryan	0:b74591d5ab33	286	* Do an RSA public key operation
be_bryan	0:b74591d5ab33	287	*/
be_bryan	0:b74591d5ab33	288	int mbedtls_rsa_public( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	289	const unsigned char *input,
be_bryan	0:b74591d5ab33	290	unsigned char *output )
be_bryan	0:b74591d5ab33	291	{
be_bryan	0:b74591d5ab33	292	int ret;
be_bryan	0:b74591d5ab33	293	size_t olen;
be_bryan	0:b74591d5ab33	294	mbedtls_mpi T;
be_bryan	0:b74591d5ab33	295
be_bryan	0:b74591d5ab33	296	mbedtls_mpi_init( &T );
be_bryan	0:b74591d5ab33	297
be_bryan	0:b74591d5ab33	298	#if defined(MBEDTLS_THREADING_C)
be_bryan	0:b74591d5ab33	299	if( ( ret = mbedtls_mutex_lock( &ctx->mutex ) ) != 0 )
be_bryan	0:b74591d5ab33	300	return( ret );
be_bryan	0:b74591d5ab33	301	#endif
be_bryan	0:b74591d5ab33	302
be_bryan	0:b74591d5ab33	303	MBEDTLS_MPI_CHK( mbedtls_mpi_read_binary( &T, input, ctx->len ) );
be_bryan	0:b74591d5ab33	304
be_bryan	0:b74591d5ab33	305	if( mbedtls_mpi_cmp_mpi( &T, &ctx->N ) >= 0 )
be_bryan	0:b74591d5ab33	306	{
be_bryan	0:b74591d5ab33	307	ret = MBEDTLS_ERR_MPI_BAD_INPUT_DATA;
be_bryan	0:b74591d5ab33	308	goto cleanup;
be_bryan	0:b74591d5ab33	309	}
be_bryan	0:b74591d5ab33	310
be_bryan	0:b74591d5ab33	311	olen = ctx->len;
be_bryan	0:b74591d5ab33	312	MBEDTLS_MPI_CHK( mbedtls_mpi_exp_mod( &T, &T, &ctx->E, &ctx->N, &ctx->RN ) );
be_bryan	0:b74591d5ab33	313	MBEDTLS_MPI_CHK( mbedtls_mpi_write_binary( &T, output, olen ) );
be_bryan	0:b74591d5ab33	314
be_bryan	0:b74591d5ab33	315	cleanup:
be_bryan	0:b74591d5ab33	316	#if defined(MBEDTLS_THREADING_C)
be_bryan	0:b74591d5ab33	317	if( mbedtls_mutex_unlock( &ctx->mutex ) != 0 )
be_bryan	0:b74591d5ab33	318	return( MBEDTLS_ERR_THREADING_MUTEX_ERROR );
be_bryan	0:b74591d5ab33	319	#endif
be_bryan	0:b74591d5ab33	320
be_bryan	0:b74591d5ab33	321	mbedtls_mpi_free( &T );
be_bryan	0:b74591d5ab33	322
be_bryan	0:b74591d5ab33	323	if( ret != 0 )
be_bryan	0:b74591d5ab33	324	return( MBEDTLS_ERR_RSA_PUBLIC_FAILED + ret );
be_bryan	0:b74591d5ab33	325
be_bryan	0:b74591d5ab33	326	return( 0 );
be_bryan	0:b74591d5ab33	327	}
be_bryan	0:b74591d5ab33	328
be_bryan	0:b74591d5ab33	329	/*
be_bryan	0:b74591d5ab33	330	* Generate or update blinding values, see section 10 of:
be_bryan	0:b74591d5ab33	331	* KOCHER, Paul C. Timing attacks on implementations of Diffie-Hellman, RSA,
be_bryan	0:b74591d5ab33	332	* DSS, and other systems. In : Advances in Cryptology-CRYPTO'96. Springer
be_bryan	0:b74591d5ab33	333	* Berlin Heidelberg, 1996. p. 104-113.
be_bryan	0:b74591d5ab33	334	*/
be_bryan	0:b74591d5ab33	335	static int rsa_prepare_blinding( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	336	int (f_rng)(void , unsigned char , size_t), void p_rng )
be_bryan	0:b74591d5ab33	337	{
be_bryan	0:b74591d5ab33	338	int ret, count = 0;
be_bryan	0:b74591d5ab33	339
be_bryan	0:b74591d5ab33	340	if( ctx->Vf.p != NULL )
be_bryan	0:b74591d5ab33	341	{
be_bryan	0:b74591d5ab33	342	/* We already have blinding values, just update them by squaring */
be_bryan	0:b74591d5ab33	343	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &ctx->Vi, &ctx->Vi, &ctx->Vi ) );
be_bryan	0:b74591d5ab33	344	MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &ctx->Vi, &ctx->Vi, &ctx->N ) );
be_bryan	0:b74591d5ab33	345	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &ctx->Vf, &ctx->Vf, &ctx->Vf ) );
be_bryan	0:b74591d5ab33	346	MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &ctx->Vf, &ctx->Vf, &ctx->N ) );
be_bryan	0:b74591d5ab33	347
be_bryan	0:b74591d5ab33	348	goto cleanup;
be_bryan	0:b74591d5ab33	349	}
be_bryan	0:b74591d5ab33	350
be_bryan	0:b74591d5ab33	351	/* Unblinding value: Vf = random number, invertible mod N */
be_bryan	0:b74591d5ab33	352	do {
be_bryan	0:b74591d5ab33	353	if( count++ > 10 )
be_bryan	0:b74591d5ab33	354	return( MBEDTLS_ERR_RSA_RNG_FAILED );
be_bryan	0:b74591d5ab33	355
be_bryan	0:b74591d5ab33	356	MBEDTLS_MPI_CHK( mbedtls_mpi_fill_random( &ctx->Vf, ctx->len - 1, f_rng, p_rng ) );
be_bryan	0:b74591d5ab33	357	MBEDTLS_MPI_CHK( mbedtls_mpi_gcd( &ctx->Vi, &ctx->Vf, &ctx->N ) );
be_bryan	0:b74591d5ab33	358	} while( mbedtls_mpi_cmp_int( &ctx->Vi, 1 ) != 0 );
be_bryan	0:b74591d5ab33	359
be_bryan	0:b74591d5ab33	360	/* Blinding value: Vi = Vf^(-e) mod N */
be_bryan	0:b74591d5ab33	361	MBEDTLS_MPI_CHK( mbedtls_mpi_inv_mod( &ctx->Vi, &ctx->Vf, &ctx->N ) );
be_bryan	0:b74591d5ab33	362	MBEDTLS_MPI_CHK( mbedtls_mpi_exp_mod( &ctx->Vi, &ctx->Vi, &ctx->E, &ctx->N, &ctx->RN ) );
be_bryan	0:b74591d5ab33	363
be_bryan	0:b74591d5ab33	364
be_bryan	0:b74591d5ab33	365	cleanup:
be_bryan	0:b74591d5ab33	366	return( ret );
be_bryan	0:b74591d5ab33	367	}
be_bryan	0:b74591d5ab33	368
be_bryan	0:b74591d5ab33	369	/*
be_bryan	0:b74591d5ab33	370	* Exponent blinding supposed to prevent side-channel attacks using multiple
be_bryan	0:b74591d5ab33	371	* traces of measurements to recover the RSA key. The more collisions are there,
be_bryan	0:b74591d5ab33	372	* the more bits of the key can be recovered. See [3].
be_bryan	0:b74591d5ab33	373	*
be_bryan	0:b74591d5ab33	374	* Collecting n collisions with m bit long blinding value requires 2^(m-m/n)
be_bryan	0:b74591d5ab33	375	* observations on avarage.
be_bryan	0:b74591d5ab33	376	*
be_bryan	0:b74591d5ab33	377	* For example with 28 byte blinding to achieve 2 collisions the adversary has
be_bryan	0:b74591d5ab33	378	* to make 2^112 observations on avarage.
be_bryan	0:b74591d5ab33	379	*
be_bryan	0:b74591d5ab33	380	* (With the currently (as of 2017 April) known best algorithms breaking 2048
be_bryan	0:b74591d5ab33	381	* bit RSA requires approximately as much time as trying out 2^112 random keys.
be_bryan	0:b74591d5ab33	382	* Thus in this sense with 28 byte blinding the security is not reduced by
be_bryan	0:b74591d5ab33	383	* side-channel attacks like the one in [3])
be_bryan	0:b74591d5ab33	384	*
be_bryan	0:b74591d5ab33	385	* This countermeasure does not help if the key recovery is possible with a
be_bryan	0:b74591d5ab33	386	* single trace.
be_bryan	0:b74591d5ab33	387	*/
be_bryan	0:b74591d5ab33	388	#define RSA_EXPONENT_BLINDING 28
be_bryan	0:b74591d5ab33	389
be_bryan	0:b74591d5ab33	390	/*
be_bryan	0:b74591d5ab33	391	* Do an RSA private key operation
be_bryan	0:b74591d5ab33	392	*/
be_bryan	0:b74591d5ab33	393	int mbedtls_rsa_private( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	394	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	395	void *p_rng,
be_bryan	0:b74591d5ab33	396	const unsigned char *input,
be_bryan	0:b74591d5ab33	397	unsigned char *output )
be_bryan	0:b74591d5ab33	398	{
be_bryan	0:b74591d5ab33	399	int ret;
be_bryan	0:b74591d5ab33	400	size_t olen;
be_bryan	0:b74591d5ab33	401	mbedtls_mpi T, T1, T2;
be_bryan	0:b74591d5ab33	402	mbedtls_mpi P1, Q1, R;
be_bryan	0:b74591d5ab33	403	#if defined(MBEDTLS_RSA_NO_CRT)
be_bryan	0:b74591d5ab33	404	mbedtls_mpi D_blind;
be_bryan	0:b74591d5ab33	405	mbedtls_mpi *D = &ctx->D;
be_bryan	0:b74591d5ab33	406	#else
be_bryan	0:b74591d5ab33	407	mbedtls_mpi DP_blind, DQ_blind;
be_bryan	0:b74591d5ab33	408	mbedtls_mpi *DP = &ctx->DP;
be_bryan	0:b74591d5ab33	409	mbedtls_mpi *DQ = &ctx->DQ;
be_bryan	0:b74591d5ab33	410	#endif
be_bryan	0:b74591d5ab33	411
be_bryan	0:b74591d5ab33	412	/* Make sure we have private key info, prevent possible misuse */
be_bryan	0:b74591d5ab33	413	if( ctx->P.p == NULL \|\| ctx->Q.p == NULL \|\| ctx->D.p == NULL )
be_bryan	0:b74591d5ab33	414	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	415
be_bryan	0:b74591d5ab33	416	mbedtls_mpi_init( &T ); mbedtls_mpi_init( &T1 ); mbedtls_mpi_init( &T2 );
be_bryan	0:b74591d5ab33	417	mbedtls_mpi_init( &P1 ); mbedtls_mpi_init( &Q1 ); mbedtls_mpi_init( &R );
be_bryan	0:b74591d5ab33	418
be_bryan	0:b74591d5ab33	419
be_bryan	0:b74591d5ab33	420	if( f_rng != NULL )
be_bryan	0:b74591d5ab33	421	{
be_bryan	0:b74591d5ab33	422	#if defined(MBEDTLS_RSA_NO_CRT)
be_bryan	0:b74591d5ab33	423	mbedtls_mpi_init( &D_blind );
be_bryan	0:b74591d5ab33	424	#else
be_bryan	0:b74591d5ab33	425	mbedtls_mpi_init( &DP_blind );
be_bryan	0:b74591d5ab33	426	mbedtls_mpi_init( &DQ_blind );
be_bryan	0:b74591d5ab33	427	#endif
be_bryan	0:b74591d5ab33	428	}
be_bryan	0:b74591d5ab33	429
be_bryan	0:b74591d5ab33	430
be_bryan	0:b74591d5ab33	431	#if defined(MBEDTLS_THREADING_C)
be_bryan	0:b74591d5ab33	432	if( ( ret = mbedtls_mutex_lock( &ctx->mutex ) ) != 0 )
be_bryan	0:b74591d5ab33	433	return( ret );
be_bryan	0:b74591d5ab33	434	#endif
be_bryan	0:b74591d5ab33	435
be_bryan	0:b74591d5ab33	436	MBEDTLS_MPI_CHK( mbedtls_mpi_read_binary( &T, input, ctx->len ) );
be_bryan	0:b74591d5ab33	437	if( mbedtls_mpi_cmp_mpi( &T, &ctx->N ) >= 0 )
be_bryan	0:b74591d5ab33	438	{
be_bryan	0:b74591d5ab33	439	ret = MBEDTLS_ERR_MPI_BAD_INPUT_DATA;
be_bryan	0:b74591d5ab33	440	goto cleanup;
be_bryan	0:b74591d5ab33	441	}
be_bryan	0:b74591d5ab33	442
be_bryan	0:b74591d5ab33	443	if( f_rng != NULL )
be_bryan	0:b74591d5ab33	444	{
be_bryan	0:b74591d5ab33	445	/*
be_bryan	0:b74591d5ab33	446	* Blinding
be_bryan	0:b74591d5ab33	447	* T = T * Vi mod N
be_bryan	0:b74591d5ab33	448	*/
be_bryan	0:b74591d5ab33	449	MBEDTLS_MPI_CHK( rsa_prepare_blinding( ctx, f_rng, p_rng ) );
be_bryan	0:b74591d5ab33	450	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &T, &T, &ctx->Vi ) );
be_bryan	0:b74591d5ab33	451	MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &T, &T, &ctx->N ) );
be_bryan	0:b74591d5ab33	452
be_bryan	0:b74591d5ab33	453	/*
be_bryan	0:b74591d5ab33	454	* Exponent blinding
be_bryan	0:b74591d5ab33	455	*/
be_bryan	0:b74591d5ab33	456	MBEDTLS_MPI_CHK( mbedtls_mpi_sub_int( &P1, &ctx->P, 1 ) );
be_bryan	0:b74591d5ab33	457	MBEDTLS_MPI_CHK( mbedtls_mpi_sub_int( &Q1, &ctx->Q, 1 ) );
be_bryan	0:b74591d5ab33	458
be_bryan	0:b74591d5ab33	459	#if defined(MBEDTLS_RSA_NO_CRT)
be_bryan	0:b74591d5ab33	460	/*
be_bryan	0:b74591d5ab33	461	* D_blind = ( P - 1 ) * ( Q - 1 ) * R + D
be_bryan	0:b74591d5ab33	462	*/
be_bryan	0:b74591d5ab33	463	MBEDTLS_MPI_CHK( mbedtls_mpi_fill_random( &R, RSA_EXPONENT_BLINDING,
be_bryan	0:b74591d5ab33	464	f_rng, p_rng ) );
be_bryan	0:b74591d5ab33	465	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &D_blind, &P1, &Q1 ) );
be_bryan	0:b74591d5ab33	466	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &D_blind, &D_blind, &R ) );
be_bryan	0:b74591d5ab33	467	MBEDTLS_MPI_CHK( mbedtls_mpi_add_mpi( &D_blind, &D_blind, &ctx->D ) );
be_bryan	0:b74591d5ab33	468
be_bryan	0:b74591d5ab33	469	D = &D_blind;
be_bryan	0:b74591d5ab33	470	#else
be_bryan	0:b74591d5ab33	471	/*
be_bryan	0:b74591d5ab33	472	* DP_blind = ( P - 1 ) * R + DP
be_bryan	0:b74591d5ab33	473	*/
be_bryan	0:b74591d5ab33	474	MBEDTLS_MPI_CHK( mbedtls_mpi_fill_random( &R, RSA_EXPONENT_BLINDING,
be_bryan	0:b74591d5ab33	475	f_rng, p_rng ) );
be_bryan	0:b74591d5ab33	476	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &DP_blind, &P1, &R ) );
be_bryan	0:b74591d5ab33	477	MBEDTLS_MPI_CHK( mbedtls_mpi_add_mpi( &DP_blind, &DP_blind,
be_bryan	0:b74591d5ab33	478	&ctx->DP ) );
be_bryan	0:b74591d5ab33	479
be_bryan	0:b74591d5ab33	480	DP = &DP_blind;
be_bryan	0:b74591d5ab33	481
be_bryan	0:b74591d5ab33	482	/*
be_bryan	0:b74591d5ab33	483	* DQ_blind = ( Q - 1 ) * R + DQ
be_bryan	0:b74591d5ab33	484	*/
be_bryan	0:b74591d5ab33	485	MBEDTLS_MPI_CHK( mbedtls_mpi_fill_random( &R, RSA_EXPONENT_BLINDING,
be_bryan	0:b74591d5ab33	486	f_rng, p_rng ) );
be_bryan	0:b74591d5ab33	487	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &DQ_blind, &Q1, &R ) );
be_bryan	0:b74591d5ab33	488	MBEDTLS_MPI_CHK( mbedtls_mpi_add_mpi( &DQ_blind, &DQ_blind,
be_bryan	0:b74591d5ab33	489	&ctx->DQ ) );
be_bryan	0:b74591d5ab33	490
be_bryan	0:b74591d5ab33	491	DQ = &DQ_blind;
be_bryan	0:b74591d5ab33	492	#endif /* MBEDTLS_RSA_NO_CRT */
be_bryan	0:b74591d5ab33	493	}
be_bryan	0:b74591d5ab33	494
be_bryan	0:b74591d5ab33	495	#if defined(MBEDTLS_RSA_NO_CRT)
be_bryan	0:b74591d5ab33	496	MBEDTLS_MPI_CHK( mbedtls_mpi_exp_mod( &T, &T, D, &ctx->N, &ctx->RN ) );
be_bryan	0:b74591d5ab33	497	#else
be_bryan	0:b74591d5ab33	498	/*
be_bryan	0:b74591d5ab33	499	* Faster decryption using the CRT
be_bryan	0:b74591d5ab33	500	*
be_bryan	0:b74591d5ab33	501	* T1 = input ^ dP mod P
be_bryan	0:b74591d5ab33	502	* T2 = input ^ dQ mod Q
be_bryan	0:b74591d5ab33	503	*/
be_bryan	0:b74591d5ab33	504	MBEDTLS_MPI_CHK( mbedtls_mpi_exp_mod( &T1, &T, DP, &ctx->P, &ctx->RP ) );
be_bryan	0:b74591d5ab33	505	MBEDTLS_MPI_CHK( mbedtls_mpi_exp_mod( &T2, &T, DQ, &ctx->Q, &ctx->RQ ) );
be_bryan	0:b74591d5ab33	506
be_bryan	0:b74591d5ab33	507	/*
be_bryan	0:b74591d5ab33	508	* T = (T1 - T2) * (Q^-1 mod P) mod P
be_bryan	0:b74591d5ab33	509	*/
be_bryan	0:b74591d5ab33	510	MBEDTLS_MPI_CHK( mbedtls_mpi_sub_mpi( &T, &T1, &T2 ) );
be_bryan	0:b74591d5ab33	511	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &T1, &T, &ctx->QP ) );
be_bryan	0:b74591d5ab33	512	MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &T, &T1, &ctx->P ) );
be_bryan	0:b74591d5ab33	513
be_bryan	0:b74591d5ab33	514	/*
be_bryan	0:b74591d5ab33	515	* T = T2 + T * Q
be_bryan	0:b74591d5ab33	516	*/
be_bryan	0:b74591d5ab33	517	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &T1, &T, &ctx->Q ) );
be_bryan	0:b74591d5ab33	518	MBEDTLS_MPI_CHK( mbedtls_mpi_add_mpi( &T, &T2, &T1 ) );
be_bryan	0:b74591d5ab33	519	#endif /* MBEDTLS_RSA_NO_CRT */
be_bryan	0:b74591d5ab33	520
be_bryan	0:b74591d5ab33	521	if( f_rng != NULL )
be_bryan	0:b74591d5ab33	522	{
be_bryan	0:b74591d5ab33	523	/*
be_bryan	0:b74591d5ab33	524	* Unblind
be_bryan	0:b74591d5ab33	525	* T = T * Vf mod N
be_bryan	0:b74591d5ab33	526	*/
be_bryan	0:b74591d5ab33	527	MBEDTLS_MPI_CHK( mbedtls_mpi_mul_mpi( &T, &T, &ctx->Vf ) );
be_bryan	0:b74591d5ab33	528	MBEDTLS_MPI_CHK( mbedtls_mpi_mod_mpi( &T, &T, &ctx->N ) );
be_bryan	0:b74591d5ab33	529	}
be_bryan	0:b74591d5ab33	530
be_bryan	0:b74591d5ab33	531	olen = ctx->len;
be_bryan	0:b74591d5ab33	532	MBEDTLS_MPI_CHK( mbedtls_mpi_write_binary( &T, output, olen ) );
be_bryan	0:b74591d5ab33	533
be_bryan	0:b74591d5ab33	534	cleanup:
be_bryan	0:b74591d5ab33	535	#if defined(MBEDTLS_THREADING_C)
be_bryan	0:b74591d5ab33	536	if( mbedtls_mutex_unlock( &ctx->mutex ) != 0 )
be_bryan	0:b74591d5ab33	537	return( MBEDTLS_ERR_THREADING_MUTEX_ERROR );
be_bryan	0:b74591d5ab33	538	#endif
be_bryan	0:b74591d5ab33	539
be_bryan	0:b74591d5ab33	540	mbedtls_mpi_free( &T ); mbedtls_mpi_free( &T1 ); mbedtls_mpi_free( &T2 );
be_bryan	0:b74591d5ab33	541	mbedtls_mpi_free( &P1 ); mbedtls_mpi_free( &Q1 ); mbedtls_mpi_free( &R );
be_bryan	0:b74591d5ab33	542
be_bryan	0:b74591d5ab33	543	if( f_rng != NULL )
be_bryan	0:b74591d5ab33	544	{
be_bryan	0:b74591d5ab33	545	#if defined(MBEDTLS_RSA_NO_CRT)
be_bryan	0:b74591d5ab33	546	mbedtls_mpi_free( &D_blind );
be_bryan	0:b74591d5ab33	547	#else
be_bryan	0:b74591d5ab33	548	mbedtls_mpi_free( &DP_blind );
be_bryan	0:b74591d5ab33	549	mbedtls_mpi_free( &DQ_blind );
be_bryan	0:b74591d5ab33	550	#endif
be_bryan	0:b74591d5ab33	551	}
be_bryan	0:b74591d5ab33	552
be_bryan	0:b74591d5ab33	553	if( ret != 0 )
be_bryan	0:b74591d5ab33	554	return( MBEDTLS_ERR_RSA_PRIVATE_FAILED + ret );
be_bryan	0:b74591d5ab33	555
be_bryan	0:b74591d5ab33	556	return( 0 );
be_bryan	0:b74591d5ab33	557	}
be_bryan	0:b74591d5ab33	558
be_bryan	0:b74591d5ab33	559	#if defined(MBEDTLS_PKCS1_V21)
be_bryan	0:b74591d5ab33	560	/**
be_bryan	0:b74591d5ab33	561	* Generate and apply the MGF1 operation (from PKCS#1 v2.1) to a buffer.
be_bryan	0:b74591d5ab33	562	*
be_bryan	0:b74591d5ab33	563	* \param dst buffer to mask
be_bryan	0:b74591d5ab33	564	* \param dlen length of destination buffer
be_bryan	0:b74591d5ab33	565	* \param src source of the mask generation
be_bryan	0:b74591d5ab33	566	* \param slen length of the source buffer
be_bryan	0:b74591d5ab33	567	* \param md_ctx message digest context to use
be_bryan	0:b74591d5ab33	568	*/
be_bryan	0:b74591d5ab33	569	static void mgf_mask( unsigned char dst, size_t dlen, unsigned char src,
be_bryan	0:b74591d5ab33	570	size_t slen, mbedtls_md_context_t *md_ctx )
be_bryan	0:b74591d5ab33	571	{
be_bryan	0:b74591d5ab33	572	unsigned char mask[MBEDTLS_MD_MAX_SIZE];
be_bryan	0:b74591d5ab33	573	unsigned char counter[4];
be_bryan	0:b74591d5ab33	574	unsigned char *p;
be_bryan	0:b74591d5ab33	575	unsigned int hlen;
be_bryan	0:b74591d5ab33	576	size_t i, use_len;
be_bryan	0:b74591d5ab33	577
be_bryan	0:b74591d5ab33	578	memset( mask, 0, MBEDTLS_MD_MAX_SIZE );
be_bryan	0:b74591d5ab33	579	memset( counter, 0, 4 );
be_bryan	0:b74591d5ab33	580
be_bryan	0:b74591d5ab33	581	hlen = mbedtls_md_get_size( md_ctx->md_info );
be_bryan	0:b74591d5ab33	582
be_bryan	0:b74591d5ab33	583	/* Generate and apply dbMask */
be_bryan	0:b74591d5ab33	584	p = dst;
be_bryan	0:b74591d5ab33	585
be_bryan	0:b74591d5ab33	586	while( dlen > 0 )
be_bryan	0:b74591d5ab33	587	{
be_bryan	0:b74591d5ab33	588	use_len = hlen;
be_bryan	0:b74591d5ab33	589	if( dlen < hlen )
be_bryan	0:b74591d5ab33	590	use_len = dlen;
be_bryan	0:b74591d5ab33	591
be_bryan	0:b74591d5ab33	592	mbedtls_md_starts( md_ctx );
be_bryan	0:b74591d5ab33	593	mbedtls_md_update( md_ctx, src, slen );
be_bryan	0:b74591d5ab33	594	mbedtls_md_update( md_ctx, counter, 4 );
be_bryan	0:b74591d5ab33	595	mbedtls_md_finish( md_ctx, mask );
be_bryan	0:b74591d5ab33	596
be_bryan	0:b74591d5ab33	597	for( i = 0; i < use_len; ++i )
be_bryan	0:b74591d5ab33	598	*p++ ^= mask[i];
be_bryan	0:b74591d5ab33	599
be_bryan	0:b74591d5ab33	600	counter[3]++;
be_bryan	0:b74591d5ab33	601
be_bryan	0:b74591d5ab33	602	dlen -= use_len;
be_bryan	0:b74591d5ab33	603	}
be_bryan	0:b74591d5ab33	604
be_bryan	0:b74591d5ab33	605	mbedtls_zeroize( mask, sizeof( mask ) );
be_bryan	0:b74591d5ab33	606	}
be_bryan	0:b74591d5ab33	607	#endif /* MBEDTLS_PKCS1_V21 */
be_bryan	0:b74591d5ab33	608
be_bryan	0:b74591d5ab33	609	#if defined(MBEDTLS_PKCS1_V21)
be_bryan	0:b74591d5ab33	610	/*
be_bryan	0:b74591d5ab33	611	* Implementation of the PKCS#1 v2.1 RSAES-OAEP-ENCRYPT function
be_bryan	0:b74591d5ab33	612	*/
be_bryan	0:b74591d5ab33	613	int mbedtls_rsa_rsaes_oaep_encrypt( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	614	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	615	void *p_rng,
be_bryan	0:b74591d5ab33	616	int mode,
be_bryan	0:b74591d5ab33	617	const unsigned char *label, size_t label_len,
be_bryan	0:b74591d5ab33	618	size_t ilen,
be_bryan	0:b74591d5ab33	619	const unsigned char *input,
be_bryan	0:b74591d5ab33	620	unsigned char *output )
be_bryan	0:b74591d5ab33	621	{
be_bryan	0:b74591d5ab33	622	size_t olen;
be_bryan	0:b74591d5ab33	623	int ret;
be_bryan	0:b74591d5ab33	624	unsigned char *p = output;
be_bryan	0:b74591d5ab33	625	unsigned int hlen;
be_bryan	0:b74591d5ab33	626	const mbedtls_md_info_t *md_info;
be_bryan	0:b74591d5ab33	627	mbedtls_md_context_t md_ctx;
be_bryan	0:b74591d5ab33	628
be_bryan	0:b74591d5ab33	629	if( mode == MBEDTLS_RSA_PRIVATE && ctx->padding != MBEDTLS_RSA_PKCS_V21 )
be_bryan	0:b74591d5ab33	630	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	631
be_bryan	0:b74591d5ab33	632	if( f_rng == NULL )
be_bryan	0:b74591d5ab33	633	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	634
be_bryan	0:b74591d5ab33	635	md_info = mbedtls_md_info_from_type( (mbedtls_md_type_t) ctx->hash_id );
be_bryan	0:b74591d5ab33	636	if( md_info == NULL )
be_bryan	0:b74591d5ab33	637	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	638
be_bryan	0:b74591d5ab33	639	olen = ctx->len;
be_bryan	0:b74591d5ab33	640	hlen = mbedtls_md_get_size( md_info );
be_bryan	0:b74591d5ab33	641
be_bryan	0:b74591d5ab33	642	/* first comparison checks for overflow */
be_bryan	0:b74591d5ab33	643	if( ilen + 2 * hlen + 2 < ilen \|\| olen < ilen + 2 * hlen + 2 )
be_bryan	0:b74591d5ab33	644	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	645
be_bryan	0:b74591d5ab33	646	memset( output, 0, olen );
be_bryan	0:b74591d5ab33	647
be_bryan	0:b74591d5ab33	648	*p++ = 0;
be_bryan	0:b74591d5ab33	649
be_bryan	0:b74591d5ab33	650	/* Generate a random octet string seed */
be_bryan	0:b74591d5ab33	651	if( ( ret = f_rng( p_rng, p, hlen ) ) != 0 )
be_bryan	0:b74591d5ab33	652	return( MBEDTLS_ERR_RSA_RNG_FAILED + ret );
be_bryan	0:b74591d5ab33	653
be_bryan	0:b74591d5ab33	654	p += hlen;
be_bryan	0:b74591d5ab33	655
be_bryan	0:b74591d5ab33	656	/* Construct DB */
be_bryan	0:b74591d5ab33	657	mbedtls_md( md_info, label, label_len, p );
be_bryan	0:b74591d5ab33	658	p += hlen;
be_bryan	0:b74591d5ab33	659	p += olen - 2 * hlen - 2 - ilen;
be_bryan	0:b74591d5ab33	660	*p++ = 1;
be_bryan	0:b74591d5ab33	661	memcpy( p, input, ilen );
be_bryan	0:b74591d5ab33	662
be_bryan	0:b74591d5ab33	663	mbedtls_md_init( &md_ctx );
be_bryan	0:b74591d5ab33	664	if( ( ret = mbedtls_md_setup( &md_ctx, md_info, 0 ) ) != 0 )
be_bryan	0:b74591d5ab33	665	{
be_bryan	0:b74591d5ab33	666	mbedtls_md_free( &md_ctx );
be_bryan	0:b74591d5ab33	667	return( ret );
be_bryan	0:b74591d5ab33	668	}
be_bryan	0:b74591d5ab33	669
be_bryan	0:b74591d5ab33	670	/* maskedDB: Apply dbMask to DB */
be_bryan	0:b74591d5ab33	671	mgf_mask( output + hlen + 1, olen - hlen - 1, output + 1, hlen,
be_bryan	0:b74591d5ab33	672	&md_ctx );
be_bryan	0:b74591d5ab33	673
be_bryan	0:b74591d5ab33	674	/* maskedSeed: Apply seedMask to seed */
be_bryan	0:b74591d5ab33	675	mgf_mask( output + 1, hlen, output + hlen + 1, olen - hlen - 1,
be_bryan	0:b74591d5ab33	676	&md_ctx );
be_bryan	0:b74591d5ab33	677
be_bryan	0:b74591d5ab33	678	mbedtls_md_free( &md_ctx );
be_bryan	0:b74591d5ab33	679
be_bryan	0:b74591d5ab33	680	return( ( mode == MBEDTLS_RSA_PUBLIC )
be_bryan	0:b74591d5ab33	681	? mbedtls_rsa_public( ctx, output, output )
be_bryan	0:b74591d5ab33	682	: mbedtls_rsa_private( ctx, f_rng, p_rng, output, output ) );
be_bryan	0:b74591d5ab33	683	}
be_bryan	0:b74591d5ab33	684	#endif /* MBEDTLS_PKCS1_V21 */
be_bryan	0:b74591d5ab33	685
be_bryan	0:b74591d5ab33	686	#if defined(MBEDTLS_PKCS1_V15)
be_bryan	0:b74591d5ab33	687	/*
be_bryan	0:b74591d5ab33	688	* Implementation of the PKCS#1 v2.1 RSAES-PKCS1-V1_5-ENCRYPT function
be_bryan	0:b74591d5ab33	689	*/
be_bryan	0:b74591d5ab33	690	int mbedtls_rsa_rsaes_pkcs1_v15_encrypt( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	691	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	692	void *p_rng,
be_bryan	0:b74591d5ab33	693	int mode, size_t ilen,
be_bryan	0:b74591d5ab33	694	const unsigned char *input,
be_bryan	0:b74591d5ab33	695	unsigned char *output )
be_bryan	0:b74591d5ab33	696	{
be_bryan	0:b74591d5ab33	697	size_t nb_pad, olen;
be_bryan	0:b74591d5ab33	698	int ret;
be_bryan	0:b74591d5ab33	699	unsigned char *p = output;
be_bryan	0:b74591d5ab33	700
be_bryan	0:b74591d5ab33	701	if( mode == MBEDTLS_RSA_PRIVATE && ctx->padding != MBEDTLS_RSA_PKCS_V15 )
be_bryan	0:b74591d5ab33	702	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	703
be_bryan	0:b74591d5ab33	704	// We don't check p_rng because it won't be dereferenced here
be_bryan	0:b74591d5ab33	705	if( f_rng == NULL \|\| input == NULL \|\| output == NULL )
be_bryan	0:b74591d5ab33	706	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	707
be_bryan	0:b74591d5ab33	708	olen = ctx->len;
be_bryan	0:b74591d5ab33	709
be_bryan	0:b74591d5ab33	710	/* first comparison checks for overflow */
be_bryan	0:b74591d5ab33	711	if( ilen + 11 < ilen \|\| olen < ilen + 11 )
be_bryan	0:b74591d5ab33	712	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	713
be_bryan	0:b74591d5ab33	714	nb_pad = olen - 3 - ilen;
be_bryan	0:b74591d5ab33	715
be_bryan	0:b74591d5ab33	716	*p++ = 0;
be_bryan	0:b74591d5ab33	717	if( mode == MBEDTLS_RSA_PUBLIC )
be_bryan	0:b74591d5ab33	718	{
be_bryan	0:b74591d5ab33	719	*p++ = MBEDTLS_RSA_CRYPT;
be_bryan	0:b74591d5ab33	720
be_bryan	0:b74591d5ab33	721	while( nb_pad-- > 0 )
be_bryan	0:b74591d5ab33	722	{
be_bryan	0:b74591d5ab33	723	int rng_dl = 100;
be_bryan	0:b74591d5ab33	724
be_bryan	0:b74591d5ab33	725	do {
be_bryan	0:b74591d5ab33	726	ret = f_rng( p_rng, p, 1 );
be_bryan	0:b74591d5ab33	727	} while( *p == 0 && --rng_dl && ret == 0 );
be_bryan	0:b74591d5ab33	728
be_bryan	0:b74591d5ab33	729	/* Check if RNG failed to generate data */
be_bryan	0:b74591d5ab33	730	if( rng_dl == 0 \|\| ret != 0 )
be_bryan	0:b74591d5ab33	731	return( MBEDTLS_ERR_RSA_RNG_FAILED + ret );
be_bryan	0:b74591d5ab33	732
be_bryan	0:b74591d5ab33	733	p++;
be_bryan	0:b74591d5ab33	734	}
be_bryan	0:b74591d5ab33	735	}
be_bryan	0:b74591d5ab33	736	else
be_bryan	0:b74591d5ab33	737	{
be_bryan	0:b74591d5ab33	738	*p++ = MBEDTLS_RSA_SIGN;
be_bryan	0:b74591d5ab33	739
be_bryan	0:b74591d5ab33	740	while( nb_pad-- > 0 )
be_bryan	0:b74591d5ab33	741	*p++ = 0xFF;
be_bryan	0:b74591d5ab33	742	}
be_bryan	0:b74591d5ab33	743
be_bryan	0:b74591d5ab33	744	*p++ = 0;
be_bryan	0:b74591d5ab33	745	memcpy( p, input, ilen );
be_bryan	0:b74591d5ab33	746
be_bryan	0:b74591d5ab33	747	return( ( mode == MBEDTLS_RSA_PUBLIC )
be_bryan	0:b74591d5ab33	748	? mbedtls_rsa_public( ctx, output, output )
be_bryan	0:b74591d5ab33	749	: mbedtls_rsa_private( ctx, f_rng, p_rng, output, output ) );
be_bryan	0:b74591d5ab33	750	}
be_bryan	0:b74591d5ab33	751	#endif /* MBEDTLS_PKCS1_V15 */
be_bryan	0:b74591d5ab33	752
be_bryan	0:b74591d5ab33	753	/*
be_bryan	0:b74591d5ab33	754	* Add the message padding, then do an RSA operation
be_bryan	0:b74591d5ab33	755	*/
be_bryan	0:b74591d5ab33	756	int mbedtls_rsa_pkcs1_encrypt( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	757	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	758	void *p_rng,
be_bryan	0:b74591d5ab33	759	int mode, size_t ilen,
be_bryan	0:b74591d5ab33	760	const unsigned char *input,
be_bryan	0:b74591d5ab33	761	unsigned char *output )
be_bryan	0:b74591d5ab33	762	{
be_bryan	0:b74591d5ab33	763	switch( ctx->padding )
be_bryan	0:b74591d5ab33	764	{
be_bryan	0:b74591d5ab33	765	#if defined(MBEDTLS_PKCS1_V15)
be_bryan	0:b74591d5ab33	766	case MBEDTLS_RSA_PKCS_V15:
be_bryan	0:b74591d5ab33	767	return mbedtls_rsa_rsaes_pkcs1_v15_encrypt( ctx, f_rng, p_rng, mode, ilen,
be_bryan	0:b74591d5ab33	768	input, output );
be_bryan	0:b74591d5ab33	769	#endif
be_bryan	0:b74591d5ab33	770
be_bryan	0:b74591d5ab33	771	#if defined(MBEDTLS_PKCS1_V21)
be_bryan	0:b74591d5ab33	772	case MBEDTLS_RSA_PKCS_V21:
be_bryan	0:b74591d5ab33	773	return mbedtls_rsa_rsaes_oaep_encrypt( ctx, f_rng, p_rng, mode, NULL, 0,
be_bryan	0:b74591d5ab33	774	ilen, input, output );
be_bryan	0:b74591d5ab33	775	#endif
be_bryan	0:b74591d5ab33	776
be_bryan	0:b74591d5ab33	777	default:
be_bryan	0:b74591d5ab33	778	return( MBEDTLS_ERR_RSA_INVALID_PADDING );
be_bryan	0:b74591d5ab33	779	}
be_bryan	0:b74591d5ab33	780	}
be_bryan	0:b74591d5ab33	781
be_bryan	0:b74591d5ab33	782	#if defined(MBEDTLS_PKCS1_V21)
be_bryan	0:b74591d5ab33	783	/*
be_bryan	0:b74591d5ab33	784	* Implementation of the PKCS#1 v2.1 RSAES-OAEP-DECRYPT function
be_bryan	0:b74591d5ab33	785	*/
be_bryan	0:b74591d5ab33	786	int mbedtls_rsa_rsaes_oaep_decrypt( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	787	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	788	void *p_rng,
be_bryan	0:b74591d5ab33	789	int mode,
be_bryan	0:b74591d5ab33	790	const unsigned char *label, size_t label_len,
be_bryan	0:b74591d5ab33	791	size_t *olen,
be_bryan	0:b74591d5ab33	792	const unsigned char *input,
be_bryan	0:b74591d5ab33	793	unsigned char *output,
be_bryan	0:b74591d5ab33	794	size_t output_max_len )
be_bryan	0:b74591d5ab33	795	{
be_bryan	0:b74591d5ab33	796	int ret;
be_bryan	0:b74591d5ab33	797	size_t ilen, i, pad_len;
be_bryan	0:b74591d5ab33	798	unsigned char *p, bad, pad_done;
be_bryan	0:b74591d5ab33	799	unsigned char buf[MBEDTLS_MPI_MAX_SIZE];
be_bryan	0:b74591d5ab33	800	unsigned char lhash[MBEDTLS_MD_MAX_SIZE];
be_bryan	0:b74591d5ab33	801	unsigned int hlen;
be_bryan	0:b74591d5ab33	802	const mbedtls_md_info_t *md_info;
be_bryan	0:b74591d5ab33	803	mbedtls_md_context_t md_ctx;
be_bryan	0:b74591d5ab33	804
be_bryan	0:b74591d5ab33	805	/*
be_bryan	0:b74591d5ab33	806	* Parameters sanity checks
be_bryan	0:b74591d5ab33	807	*/
be_bryan	0:b74591d5ab33	808	if( mode == MBEDTLS_RSA_PRIVATE && ctx->padding != MBEDTLS_RSA_PKCS_V21 )
be_bryan	0:b74591d5ab33	809	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	810
be_bryan	0:b74591d5ab33	811	ilen = ctx->len;
be_bryan	0:b74591d5ab33	812
be_bryan	0:b74591d5ab33	813	if( ilen < 16 \|\| ilen > sizeof( buf ) )
be_bryan	0:b74591d5ab33	814	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	815
be_bryan	0:b74591d5ab33	816	md_info = mbedtls_md_info_from_type( (mbedtls_md_type_t) ctx->hash_id );
be_bryan	0:b74591d5ab33	817	if( md_info == NULL )
be_bryan	0:b74591d5ab33	818	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	819
be_bryan	0:b74591d5ab33	820	hlen = mbedtls_md_get_size( md_info );
be_bryan	0:b74591d5ab33	821
be_bryan	0:b74591d5ab33	822	// checking for integer underflow
be_bryan	0:b74591d5ab33	823	if( 2 * hlen + 2 > ilen )
be_bryan	0:b74591d5ab33	824	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	825
be_bryan	0:b74591d5ab33	826	/*
be_bryan	0:b74591d5ab33	827	* RSA operation
be_bryan	0:b74591d5ab33	828	*/
be_bryan	0:b74591d5ab33	829	ret = ( mode == MBEDTLS_RSA_PUBLIC )
be_bryan	0:b74591d5ab33	830	? mbedtls_rsa_public( ctx, input, buf )
be_bryan	0:b74591d5ab33	831	: mbedtls_rsa_private( ctx, f_rng, p_rng, input, buf );
be_bryan	0:b74591d5ab33	832
be_bryan	0:b74591d5ab33	833	if( ret != 0 )
be_bryan	0:b74591d5ab33	834	goto cleanup;
be_bryan	0:b74591d5ab33	835
be_bryan	0:b74591d5ab33	836	/*
be_bryan	0:b74591d5ab33	837	* Unmask data and generate lHash
be_bryan	0:b74591d5ab33	838	*/
be_bryan	0:b74591d5ab33	839	mbedtls_md_init( &md_ctx );
be_bryan	0:b74591d5ab33	840	if( ( ret = mbedtls_md_setup( &md_ctx, md_info, 0 ) ) != 0 )
be_bryan	0:b74591d5ab33	841	{
be_bryan	0:b74591d5ab33	842	mbedtls_md_free( &md_ctx );
be_bryan	0:b74591d5ab33	843	goto cleanup;
be_bryan	0:b74591d5ab33	844	}
be_bryan	0:b74591d5ab33	845
be_bryan	0:b74591d5ab33	846
be_bryan	0:b74591d5ab33	847	/* Generate lHash */
be_bryan	0:b74591d5ab33	848	mbedtls_md( md_info, label, label_len, lhash );
be_bryan	0:b74591d5ab33	849
be_bryan	0:b74591d5ab33	850	/* seed: Apply seedMask to maskedSeed */
be_bryan	0:b74591d5ab33	851	mgf_mask( buf + 1, hlen, buf + hlen + 1, ilen - hlen - 1,
be_bryan	0:b74591d5ab33	852	&md_ctx );
be_bryan	0:b74591d5ab33	853
be_bryan	0:b74591d5ab33	854	/* DB: Apply dbMask to maskedDB */
be_bryan	0:b74591d5ab33	855	mgf_mask( buf + hlen + 1, ilen - hlen - 1, buf + 1, hlen,
be_bryan	0:b74591d5ab33	856	&md_ctx );
be_bryan	0:b74591d5ab33	857
be_bryan	0:b74591d5ab33	858	mbedtls_md_free( &md_ctx );
be_bryan	0:b74591d5ab33	859
be_bryan	0:b74591d5ab33	860	/*
be_bryan	0:b74591d5ab33	861	* Check contents, in "constant-time"
be_bryan	0:b74591d5ab33	862	*/
be_bryan	0:b74591d5ab33	863	p = buf;
be_bryan	0:b74591d5ab33	864	bad = 0;
be_bryan	0:b74591d5ab33	865
be_bryan	0:b74591d5ab33	866	bad \|= p++; / First byte must be 0 */
be_bryan	0:b74591d5ab33	867
be_bryan	0:b74591d5ab33	868	p += hlen; /* Skip seed */
be_bryan	0:b74591d5ab33	869
be_bryan	0:b74591d5ab33	870	/* Check lHash */
be_bryan	0:b74591d5ab33	871	for( i = 0; i < hlen; i++ )
be_bryan	0:b74591d5ab33	872	bad \|= lhash[i] ^ *p++;
be_bryan	0:b74591d5ab33	873
be_bryan	0:b74591d5ab33	874	/* Get zero-padding len, but always read till end of buffer
be_bryan	0:b74591d5ab33	875	* (minus one, for the 01 byte) */
be_bryan	0:b74591d5ab33	876	pad_len = 0;
be_bryan	0:b74591d5ab33	877	pad_done = 0;
be_bryan	0:b74591d5ab33	878	for( i = 0; i < ilen - 2 * hlen - 2; i++ )
be_bryan	0:b74591d5ab33	879	{
be_bryan	0:b74591d5ab33	880	pad_done \|= p[i];
be_bryan	0:b74591d5ab33	881	pad_len += ((pad_done \| (unsigned char)-pad_done) >> 7) ^ 1;
be_bryan	0:b74591d5ab33	882	}
be_bryan	0:b74591d5ab33	883
be_bryan	0:b74591d5ab33	884	p += pad_len;
be_bryan	0:b74591d5ab33	885	bad \|= *p++ ^ 0x01;
be_bryan	0:b74591d5ab33	886
be_bryan	0:b74591d5ab33	887	/*
be_bryan	0:b74591d5ab33	888	* The only information "leaked" is whether the padding was correct or not
be_bryan	0:b74591d5ab33	889	* (eg, no data is copied if it was not correct). This meets the
be_bryan	0:b74591d5ab33	890	* recommendations in PKCS#1 v2.2: an opponent cannot distinguish between
be_bryan	0:b74591d5ab33	891	* the different error conditions.
be_bryan	0:b74591d5ab33	892	*/
be_bryan	0:b74591d5ab33	893	if( bad != 0 )
be_bryan	0:b74591d5ab33	894	{
be_bryan	0:b74591d5ab33	895	ret = MBEDTLS_ERR_RSA_INVALID_PADDING;
be_bryan	0:b74591d5ab33	896	goto cleanup;
be_bryan	0:b74591d5ab33	897	}
be_bryan	0:b74591d5ab33	898
be_bryan	0:b74591d5ab33	899	if( ilen - ( p - buf ) > output_max_len )
be_bryan	0:b74591d5ab33	900	{
be_bryan	0:b74591d5ab33	901	ret = MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE;
be_bryan	0:b74591d5ab33	902	goto cleanup;
be_bryan	0:b74591d5ab33	903	}
be_bryan	0:b74591d5ab33	904
be_bryan	0:b74591d5ab33	905	*olen = ilen - (p - buf);
be_bryan	0:b74591d5ab33	906	memcpy( output, p, *olen );
be_bryan	0:b74591d5ab33	907	ret = 0;
be_bryan	0:b74591d5ab33	908
be_bryan	0:b74591d5ab33	909	cleanup:
be_bryan	0:b74591d5ab33	910	mbedtls_zeroize( buf, sizeof( buf ) );
be_bryan	0:b74591d5ab33	911	mbedtls_zeroize( lhash, sizeof( lhash ) );
be_bryan	0:b74591d5ab33	912
be_bryan	0:b74591d5ab33	913	return( ret );
be_bryan	0:b74591d5ab33	914	}
be_bryan	0:b74591d5ab33	915	#endif /* MBEDTLS_PKCS1_V21 */
be_bryan	0:b74591d5ab33	916
be_bryan	0:b74591d5ab33	917	#if defined(MBEDTLS_PKCS1_V15)
be_bryan	0:b74591d5ab33	918	/*
be_bryan	0:b74591d5ab33	919	* Implementation of the PKCS#1 v2.1 RSAES-PKCS1-V1_5-DECRYPT function
be_bryan	0:b74591d5ab33	920	*/
be_bryan	0:b74591d5ab33	921	int mbedtls_rsa_rsaes_pkcs1_v15_decrypt( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	922	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	923	void *p_rng,
be_bryan	0:b74591d5ab33	924	int mode, size_t *olen,
be_bryan	0:b74591d5ab33	925	const unsigned char *input,
be_bryan	0:b74591d5ab33	926	unsigned char *output,
be_bryan	0:b74591d5ab33	927	size_t output_max_len)
be_bryan	0:b74591d5ab33	928	{
be_bryan	0:b74591d5ab33	929	int ret;
be_bryan	0:b74591d5ab33	930	size_t ilen, pad_count = 0, i;
be_bryan	0:b74591d5ab33	931	unsigned char *p, bad, pad_done = 0;
be_bryan	0:b74591d5ab33	932	unsigned char buf[MBEDTLS_MPI_MAX_SIZE];
be_bryan	0:b74591d5ab33	933
be_bryan	0:b74591d5ab33	934	if( mode == MBEDTLS_RSA_PRIVATE && ctx->padding != MBEDTLS_RSA_PKCS_V15 )
be_bryan	0:b74591d5ab33	935	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	936
be_bryan	0:b74591d5ab33	937	ilen = ctx->len;
be_bryan	0:b74591d5ab33	938
be_bryan	0:b74591d5ab33	939	if( ilen < 16 \|\| ilen > sizeof( buf ) )
be_bryan	0:b74591d5ab33	940	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	941
be_bryan	0:b74591d5ab33	942	ret = ( mode == MBEDTLS_RSA_PUBLIC )
be_bryan	0:b74591d5ab33	943	? mbedtls_rsa_public( ctx, input, buf )
be_bryan	0:b74591d5ab33	944	: mbedtls_rsa_private( ctx, f_rng, p_rng, input, buf );
be_bryan	0:b74591d5ab33	945
be_bryan	0:b74591d5ab33	946	if( ret != 0 )
be_bryan	0:b74591d5ab33	947	goto cleanup;
be_bryan	0:b74591d5ab33	948
be_bryan	0:b74591d5ab33	949	p = buf;
be_bryan	0:b74591d5ab33	950	bad = 0;
be_bryan	0:b74591d5ab33	951
be_bryan	0:b74591d5ab33	952	/*
be_bryan	0:b74591d5ab33	953	* Check and get padding len in "constant-time"
be_bryan	0:b74591d5ab33	954	*/
be_bryan	0:b74591d5ab33	955	bad \|= p++; / First byte must be 0 */
be_bryan	0:b74591d5ab33	956
be_bryan	0:b74591d5ab33	957	/* This test does not depend on secret data */
be_bryan	0:b74591d5ab33	958	if( mode == MBEDTLS_RSA_PRIVATE )
be_bryan	0:b74591d5ab33	959	{
be_bryan	0:b74591d5ab33	960	bad \|= *p++ ^ MBEDTLS_RSA_CRYPT;
be_bryan	0:b74591d5ab33	961
be_bryan	0:b74591d5ab33	962	/* Get padding len, but always read till end of buffer
be_bryan	0:b74591d5ab33	963	* (minus one, for the 00 byte) */
be_bryan	0:b74591d5ab33	964	for( i = 0; i < ilen - 3; i++ )
be_bryan	0:b74591d5ab33	965	{
be_bryan	0:b74591d5ab33	966	pad_done \|= ((p[i] \| (unsigned char)-p[i]) >> 7) ^ 1;
be_bryan	0:b74591d5ab33	967	pad_count += ((pad_done \| (unsigned char)-pad_done) >> 7) ^ 1;
be_bryan	0:b74591d5ab33	968	}
be_bryan	0:b74591d5ab33	969
be_bryan	0:b74591d5ab33	970	p += pad_count;
be_bryan	0:b74591d5ab33	971	bad \|= p++; / Must be zero */
be_bryan	0:b74591d5ab33	972	}
be_bryan	0:b74591d5ab33	973	else
be_bryan	0:b74591d5ab33	974	{
be_bryan	0:b74591d5ab33	975	bad \|= *p++ ^ MBEDTLS_RSA_SIGN;
be_bryan	0:b74591d5ab33	976
be_bryan	0:b74591d5ab33	977	/* Get padding len, but always read till end of buffer
be_bryan	0:b74591d5ab33	978	* (minus one, for the 00 byte) */
be_bryan	0:b74591d5ab33	979	for( i = 0; i < ilen - 3; i++ )
be_bryan	0:b74591d5ab33	980	{
be_bryan	0:b74591d5ab33	981	pad_done \|= ( p[i] != 0xFF );
be_bryan	0:b74591d5ab33	982	pad_count += ( pad_done == 0 );
be_bryan	0:b74591d5ab33	983	}
be_bryan	0:b74591d5ab33	984
be_bryan	0:b74591d5ab33	985	p += pad_count;
be_bryan	0:b74591d5ab33	986	bad \|= p++; / Must be zero */
be_bryan	0:b74591d5ab33	987	}
be_bryan	0:b74591d5ab33	988
be_bryan	0:b74591d5ab33	989	bad \|= ( pad_count < 8 );
be_bryan	0:b74591d5ab33	990
be_bryan	0:b74591d5ab33	991	if( bad )
be_bryan	0:b74591d5ab33	992	{
be_bryan	0:b74591d5ab33	993	ret = MBEDTLS_ERR_RSA_INVALID_PADDING;
be_bryan	0:b74591d5ab33	994	goto cleanup;
be_bryan	0:b74591d5ab33	995	}
be_bryan	0:b74591d5ab33	996
be_bryan	0:b74591d5ab33	997	if( ilen - ( p - buf ) > output_max_len )
be_bryan	0:b74591d5ab33	998	{
be_bryan	0:b74591d5ab33	999	ret = MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE;
be_bryan	0:b74591d5ab33	1000	goto cleanup;
be_bryan	0:b74591d5ab33	1001	}
be_bryan	0:b74591d5ab33	1002
be_bryan	0:b74591d5ab33	1003	*olen = ilen - (p - buf);
be_bryan	0:b74591d5ab33	1004	memcpy( output, p, *olen );
be_bryan	0:b74591d5ab33	1005	ret = 0;
be_bryan	0:b74591d5ab33	1006
be_bryan	0:b74591d5ab33	1007	cleanup:
be_bryan	0:b74591d5ab33	1008	mbedtls_zeroize( buf, sizeof( buf ) );
be_bryan	0:b74591d5ab33	1009
be_bryan	0:b74591d5ab33	1010	return( ret );
be_bryan	0:b74591d5ab33	1011	}
be_bryan	0:b74591d5ab33	1012	#endif /* MBEDTLS_PKCS1_V15 */
be_bryan	0:b74591d5ab33	1013
be_bryan	0:b74591d5ab33	1014	/*
be_bryan	0:b74591d5ab33	1015	* Do an RSA operation, then remove the message padding
be_bryan	0:b74591d5ab33	1016	*/
be_bryan	0:b74591d5ab33	1017	int mbedtls_rsa_pkcs1_decrypt( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	1018	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	1019	void *p_rng,
be_bryan	0:b74591d5ab33	1020	int mode, size_t *olen,
be_bryan	0:b74591d5ab33	1021	const unsigned char *input,
be_bryan	0:b74591d5ab33	1022	unsigned char *output,
be_bryan	0:b74591d5ab33	1023	size_t output_max_len)
be_bryan	0:b74591d5ab33	1024	{
be_bryan	0:b74591d5ab33	1025	switch( ctx->padding )
be_bryan	0:b74591d5ab33	1026	{
be_bryan	0:b74591d5ab33	1027	#if defined(MBEDTLS_PKCS1_V15)
be_bryan	0:b74591d5ab33	1028	case MBEDTLS_RSA_PKCS_V15:
be_bryan	0:b74591d5ab33	1029	return mbedtls_rsa_rsaes_pkcs1_v15_decrypt( ctx, f_rng, p_rng, mode, olen,
be_bryan	0:b74591d5ab33	1030	input, output, output_max_len );
be_bryan	0:b74591d5ab33	1031	#endif
be_bryan	0:b74591d5ab33	1032
be_bryan	0:b74591d5ab33	1033	#if defined(MBEDTLS_PKCS1_V21)
be_bryan	0:b74591d5ab33	1034	case MBEDTLS_RSA_PKCS_V21:
be_bryan	0:b74591d5ab33	1035	return mbedtls_rsa_rsaes_oaep_decrypt( ctx, f_rng, p_rng, mode, NULL, 0,
be_bryan	0:b74591d5ab33	1036	olen, input, output,
be_bryan	0:b74591d5ab33	1037	output_max_len );
be_bryan	0:b74591d5ab33	1038	#endif
be_bryan	0:b74591d5ab33	1039
be_bryan	0:b74591d5ab33	1040	default:
be_bryan	0:b74591d5ab33	1041	return( MBEDTLS_ERR_RSA_INVALID_PADDING );
be_bryan	0:b74591d5ab33	1042	}
be_bryan	0:b74591d5ab33	1043	}
be_bryan	0:b74591d5ab33	1044
be_bryan	0:b74591d5ab33	1045	#if defined(MBEDTLS_PKCS1_V21)
be_bryan	0:b74591d5ab33	1046	/*
be_bryan	0:b74591d5ab33	1047	* Implementation of the PKCS#1 v2.1 RSASSA-PSS-SIGN function
be_bryan	0:b74591d5ab33	1048	*/
be_bryan	0:b74591d5ab33	1049	int mbedtls_rsa_rsassa_pss_sign( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	1050	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	1051	void *p_rng,
be_bryan	0:b74591d5ab33	1052	int mode,
be_bryan	0:b74591d5ab33	1053	mbedtls_md_type_t md_alg,
be_bryan	0:b74591d5ab33	1054	unsigned int hashlen,
be_bryan	0:b74591d5ab33	1055	const unsigned char *hash,
be_bryan	0:b74591d5ab33	1056	unsigned char *sig )
be_bryan	0:b74591d5ab33	1057	{
be_bryan	0:b74591d5ab33	1058	size_t olen;
be_bryan	0:b74591d5ab33	1059	unsigned char *p = sig;
be_bryan	0:b74591d5ab33	1060	unsigned char salt[MBEDTLS_MD_MAX_SIZE];
be_bryan	0:b74591d5ab33	1061	unsigned int slen, hlen, offset = 0;
be_bryan	0:b74591d5ab33	1062	int ret;
be_bryan	0:b74591d5ab33	1063	size_t msb;
be_bryan	0:b74591d5ab33	1064	const mbedtls_md_info_t *md_info;
be_bryan	0:b74591d5ab33	1065	mbedtls_md_context_t md_ctx;
be_bryan	0:b74591d5ab33	1066
be_bryan	0:b74591d5ab33	1067	if( mode == MBEDTLS_RSA_PRIVATE && ctx->padding != MBEDTLS_RSA_PKCS_V21 )
be_bryan	0:b74591d5ab33	1068	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1069
be_bryan	0:b74591d5ab33	1070	if( f_rng == NULL )
be_bryan	0:b74591d5ab33	1071	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1072
be_bryan	0:b74591d5ab33	1073	olen = ctx->len;
be_bryan	0:b74591d5ab33	1074
be_bryan	0:b74591d5ab33	1075	if( md_alg != MBEDTLS_MD_NONE )
be_bryan	0:b74591d5ab33	1076	{
be_bryan	0:b74591d5ab33	1077	/* Gather length of hash to sign */
be_bryan	0:b74591d5ab33	1078	md_info = mbedtls_md_info_from_type( md_alg );
be_bryan	0:b74591d5ab33	1079	if( md_info == NULL )
be_bryan	0:b74591d5ab33	1080	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1081
be_bryan	0:b74591d5ab33	1082	hashlen = mbedtls_md_get_size( md_info );
be_bryan	0:b74591d5ab33	1083	}
be_bryan	0:b74591d5ab33	1084
be_bryan	0:b74591d5ab33	1085	md_info = mbedtls_md_info_from_type( (mbedtls_md_type_t) ctx->hash_id );
be_bryan	0:b74591d5ab33	1086	if( md_info == NULL )
be_bryan	0:b74591d5ab33	1087	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1088
be_bryan	0:b74591d5ab33	1089	hlen = mbedtls_md_get_size( md_info );
be_bryan	0:b74591d5ab33	1090	slen = hlen;
be_bryan	0:b74591d5ab33	1091
be_bryan	0:b74591d5ab33	1092	if( olen < hlen + slen + 2 )
be_bryan	0:b74591d5ab33	1093	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1094
be_bryan	0:b74591d5ab33	1095	memset( sig, 0, olen );
be_bryan	0:b74591d5ab33	1096
be_bryan	0:b74591d5ab33	1097	/* Generate salt of length slen */
be_bryan	0:b74591d5ab33	1098	if( ( ret = f_rng( p_rng, salt, slen ) ) != 0 )
be_bryan	0:b74591d5ab33	1099	return( MBEDTLS_ERR_RSA_RNG_FAILED + ret );
be_bryan	0:b74591d5ab33	1100
be_bryan	0:b74591d5ab33	1101	/* Note: EMSA-PSS encoding is over the length of N - 1 bits */
be_bryan	0:b74591d5ab33	1102	msb = mbedtls_mpi_bitlen( &ctx->N ) - 1;
be_bryan	0:b74591d5ab33	1103	p += olen - hlen * 2 - 2;
be_bryan	0:b74591d5ab33	1104	*p++ = 0x01;
be_bryan	0:b74591d5ab33	1105	memcpy( p, salt, slen );
be_bryan	0:b74591d5ab33	1106	p += slen;
be_bryan	0:b74591d5ab33	1107
be_bryan	0:b74591d5ab33	1108	mbedtls_md_init( &md_ctx );
be_bryan	0:b74591d5ab33	1109	if( ( ret = mbedtls_md_setup( &md_ctx, md_info, 0 ) ) != 0 )
be_bryan	0:b74591d5ab33	1110	{
be_bryan	0:b74591d5ab33	1111	mbedtls_md_free( &md_ctx );
be_bryan	0:b74591d5ab33	1112	/* No need to zeroize salt: we didn't use it. */
be_bryan	0:b74591d5ab33	1113	return( ret );
be_bryan	0:b74591d5ab33	1114	}
be_bryan	0:b74591d5ab33	1115
be_bryan	0:b74591d5ab33	1116	/* Generate H = Hash( M' ) */
be_bryan	0:b74591d5ab33	1117	mbedtls_md_starts( &md_ctx );
be_bryan	0:b74591d5ab33	1118	mbedtls_md_update( &md_ctx, p, 8 );
be_bryan	0:b74591d5ab33	1119	mbedtls_md_update( &md_ctx, hash, hashlen );
be_bryan	0:b74591d5ab33	1120	mbedtls_md_update( &md_ctx, salt, slen );
be_bryan	0:b74591d5ab33	1121	mbedtls_md_finish( &md_ctx, p );
be_bryan	0:b74591d5ab33	1122	mbedtls_zeroize( salt, sizeof( salt ) );
be_bryan	0:b74591d5ab33	1123
be_bryan	0:b74591d5ab33	1124	/* Compensate for boundary condition when applying mask */
be_bryan	0:b74591d5ab33	1125	if( msb % 8 == 0 )
be_bryan	0:b74591d5ab33	1126	offset = 1;
be_bryan	0:b74591d5ab33	1127
be_bryan	0:b74591d5ab33	1128	/* maskedDB: Apply dbMask to DB */
be_bryan	0:b74591d5ab33	1129	mgf_mask( sig + offset, olen - hlen - 1 - offset, p, hlen, &md_ctx );
be_bryan	0:b74591d5ab33	1130
be_bryan	0:b74591d5ab33	1131	mbedtls_md_free( &md_ctx );
be_bryan	0:b74591d5ab33	1132
be_bryan	0:b74591d5ab33	1133	msb = mbedtls_mpi_bitlen( &ctx->N ) - 1;
be_bryan	0:b74591d5ab33	1134	sig[0] &= 0xFF >> ( olen * 8 - msb );
be_bryan	0:b74591d5ab33	1135
be_bryan	0:b74591d5ab33	1136	p += hlen;
be_bryan	0:b74591d5ab33	1137	*p++ = 0xBC;
be_bryan	0:b74591d5ab33	1138
be_bryan	0:b74591d5ab33	1139	return( ( mode == MBEDTLS_RSA_PUBLIC )
be_bryan	0:b74591d5ab33	1140	? mbedtls_rsa_public( ctx, sig, sig )
be_bryan	0:b74591d5ab33	1141	: mbedtls_rsa_private( ctx, f_rng, p_rng, sig, sig ) );
be_bryan	0:b74591d5ab33	1142	}
be_bryan	0:b74591d5ab33	1143	#endif /* MBEDTLS_PKCS1_V21 */
be_bryan	0:b74591d5ab33	1144
be_bryan	0:b74591d5ab33	1145	#if defined(MBEDTLS_PKCS1_V15)
be_bryan	0:b74591d5ab33	1146	/*
be_bryan	0:b74591d5ab33	1147	* Implementation of the PKCS#1 v2.1 RSASSA-PKCS1-V1_5-SIGN function
be_bryan	0:b74591d5ab33	1148	*/
be_bryan	0:b74591d5ab33	1149	/*
be_bryan	0:b74591d5ab33	1150	* Do an RSA operation to sign the message digest
be_bryan	0:b74591d5ab33	1151	*/
be_bryan	0:b74591d5ab33	1152	int mbedtls_rsa_rsassa_pkcs1_v15_sign( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	1153	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	1154	void *p_rng,
be_bryan	0:b74591d5ab33	1155	int mode,
be_bryan	0:b74591d5ab33	1156	mbedtls_md_type_t md_alg,
be_bryan	0:b74591d5ab33	1157	unsigned int hashlen,
be_bryan	0:b74591d5ab33	1158	const unsigned char *hash,
be_bryan	0:b74591d5ab33	1159	unsigned char *sig )
be_bryan	0:b74591d5ab33	1160	{
be_bryan	0:b74591d5ab33	1161	size_t nb_pad, olen, oid_size = 0;
be_bryan	0:b74591d5ab33	1162	unsigned char *p = sig;
be_bryan	0:b74591d5ab33	1163	const char *oid = NULL;
be_bryan	0:b74591d5ab33	1164	unsigned char sig_try = NULL, verif = NULL;
be_bryan	0:b74591d5ab33	1165	size_t i;
be_bryan	0:b74591d5ab33	1166	unsigned char diff;
be_bryan	0:b74591d5ab33	1167	volatile unsigned char diff_no_optimize;
be_bryan	0:b74591d5ab33	1168	int ret;
be_bryan	0:b74591d5ab33	1169
be_bryan	0:b74591d5ab33	1170	if( mode == MBEDTLS_RSA_PRIVATE && ctx->padding != MBEDTLS_RSA_PKCS_V15 )
be_bryan	0:b74591d5ab33	1171	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1172
be_bryan	0:b74591d5ab33	1173	olen = ctx->len;
be_bryan	0:b74591d5ab33	1174	nb_pad = olen - 3;
be_bryan	0:b74591d5ab33	1175
be_bryan	0:b74591d5ab33	1176	if( md_alg != MBEDTLS_MD_NONE )
be_bryan	0:b74591d5ab33	1177	{
be_bryan	0:b74591d5ab33	1178	const mbedtls_md_info_t *md_info = mbedtls_md_info_from_type( md_alg );
be_bryan	0:b74591d5ab33	1179	if( md_info == NULL )
be_bryan	0:b74591d5ab33	1180	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1181
be_bryan	0:b74591d5ab33	1182	if( mbedtls_oid_get_oid_by_md( md_alg, &oid, &oid_size ) != 0 )
be_bryan	0:b74591d5ab33	1183	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1184
be_bryan	0:b74591d5ab33	1185	nb_pad -= 10 + oid_size;
be_bryan	0:b74591d5ab33	1186
be_bryan	0:b74591d5ab33	1187	hashlen = mbedtls_md_get_size( md_info );
be_bryan	0:b74591d5ab33	1188	}
be_bryan	0:b74591d5ab33	1189
be_bryan	0:b74591d5ab33	1190	nb_pad -= hashlen;
be_bryan	0:b74591d5ab33	1191
be_bryan	0:b74591d5ab33	1192	if( ( nb_pad < 8 ) \|\| ( nb_pad > olen ) )
be_bryan	0:b74591d5ab33	1193	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1194
be_bryan	0:b74591d5ab33	1195	*p++ = 0;
be_bryan	0:b74591d5ab33	1196	*p++ = MBEDTLS_RSA_SIGN;
be_bryan	0:b74591d5ab33	1197	memset( p, 0xFF, nb_pad );
be_bryan	0:b74591d5ab33	1198	p += nb_pad;
be_bryan	0:b74591d5ab33	1199	*p++ = 0;
be_bryan	0:b74591d5ab33	1200
be_bryan	0:b74591d5ab33	1201	if( md_alg == MBEDTLS_MD_NONE )
be_bryan	0:b74591d5ab33	1202	{
be_bryan	0:b74591d5ab33	1203	memcpy( p, hash, hashlen );
be_bryan	0:b74591d5ab33	1204	}
be_bryan	0:b74591d5ab33	1205	else
be_bryan	0:b74591d5ab33	1206	{
be_bryan	0:b74591d5ab33	1207	/*
be_bryan	0:b74591d5ab33	1208	* DigestInfo ::= SEQUENCE {
be_bryan	0:b74591d5ab33	1209	* digestAlgorithm DigestAlgorithmIdentifier,
be_bryan	0:b74591d5ab33	1210	* digest Digest }
be_bryan	0:b74591d5ab33	1211	*
be_bryan	0:b74591d5ab33	1212	* DigestAlgorithmIdentifier ::= AlgorithmIdentifier
be_bryan	0:b74591d5ab33	1213	*
be_bryan	0:b74591d5ab33	1214	* Digest ::= OCTET STRING
be_bryan	0:b74591d5ab33	1215	*/
be_bryan	0:b74591d5ab33	1216	*p++ = MBEDTLS_ASN1_SEQUENCE \| MBEDTLS_ASN1_CONSTRUCTED;
be_bryan	0:b74591d5ab33	1217	*p++ = (unsigned char) ( 0x08 + oid_size + hashlen );
be_bryan	0:b74591d5ab33	1218	*p++ = MBEDTLS_ASN1_SEQUENCE \| MBEDTLS_ASN1_CONSTRUCTED;
be_bryan	0:b74591d5ab33	1219	*p++ = (unsigned char) ( 0x04 + oid_size );
be_bryan	0:b74591d5ab33	1220	*p++ = MBEDTLS_ASN1_OID;
be_bryan	0:b74591d5ab33	1221	*p++ = oid_size & 0xFF;
be_bryan	0:b74591d5ab33	1222	memcpy( p, oid, oid_size );
be_bryan	0:b74591d5ab33	1223	p += oid_size;
be_bryan	0:b74591d5ab33	1224	*p++ = MBEDTLS_ASN1_NULL;
be_bryan	0:b74591d5ab33	1225	*p++ = 0x00;
be_bryan	0:b74591d5ab33	1226	*p++ = MBEDTLS_ASN1_OCTET_STRING;
be_bryan	0:b74591d5ab33	1227	*p++ = hashlen;
be_bryan	0:b74591d5ab33	1228	memcpy( p, hash, hashlen );
be_bryan	0:b74591d5ab33	1229	}
be_bryan	0:b74591d5ab33	1230
be_bryan	0:b74591d5ab33	1231	if( mode == MBEDTLS_RSA_PUBLIC )
be_bryan	0:b74591d5ab33	1232	return( mbedtls_rsa_public( ctx, sig, sig ) );
be_bryan	0:b74591d5ab33	1233
be_bryan	0:b74591d5ab33	1234	/*
be_bryan	0:b74591d5ab33	1235	* In order to prevent Lenstra's attack, make the signature in a
be_bryan	0:b74591d5ab33	1236	* temporary buffer and check it before returning it.
be_bryan	0:b74591d5ab33	1237	*/
be_bryan	0:b74591d5ab33	1238	sig_try = mbedtls_calloc( 1, ctx->len );
be_bryan	0:b74591d5ab33	1239	if( sig_try == NULL )
be_bryan	0:b74591d5ab33	1240	return( MBEDTLS_ERR_MPI_ALLOC_FAILED );
be_bryan	0:b74591d5ab33	1241
be_bryan	0:b74591d5ab33	1242	verif = mbedtls_calloc( 1, ctx->len );
be_bryan	0:b74591d5ab33	1243	if( verif == NULL )
be_bryan	0:b74591d5ab33	1244	{
be_bryan	0:b74591d5ab33	1245	mbedtls_free( sig_try );
be_bryan	0:b74591d5ab33	1246	return( MBEDTLS_ERR_MPI_ALLOC_FAILED );
be_bryan	0:b74591d5ab33	1247	}
be_bryan	0:b74591d5ab33	1248
be_bryan	0:b74591d5ab33	1249	MBEDTLS_MPI_CHK( mbedtls_rsa_private( ctx, f_rng, p_rng, sig, sig_try ) );
be_bryan	0:b74591d5ab33	1250	MBEDTLS_MPI_CHK( mbedtls_rsa_public( ctx, sig_try, verif ) );
be_bryan	0:b74591d5ab33	1251
be_bryan	0:b74591d5ab33	1252	/* Compare in constant time just in case */
be_bryan	0:b74591d5ab33	1253	for( diff = 0, i = 0; i < ctx->len; i++ )
be_bryan	0:b74591d5ab33	1254	diff \|= verif[i] ^ sig[i];
be_bryan	0:b74591d5ab33	1255	diff_no_optimize = diff;
be_bryan	0:b74591d5ab33	1256
be_bryan	0:b74591d5ab33	1257	if( diff_no_optimize != 0 )
be_bryan	0:b74591d5ab33	1258	{
be_bryan	0:b74591d5ab33	1259	ret = MBEDTLS_ERR_RSA_PRIVATE_FAILED;
be_bryan	0:b74591d5ab33	1260	goto cleanup;
be_bryan	0:b74591d5ab33	1261	}
be_bryan	0:b74591d5ab33	1262
be_bryan	0:b74591d5ab33	1263	memcpy( sig, sig_try, ctx->len );
be_bryan	0:b74591d5ab33	1264
be_bryan	0:b74591d5ab33	1265	cleanup:
be_bryan	0:b74591d5ab33	1266	mbedtls_free( sig_try );
be_bryan	0:b74591d5ab33	1267	mbedtls_free( verif );
be_bryan	0:b74591d5ab33	1268
be_bryan	0:b74591d5ab33	1269	return( ret );
be_bryan	0:b74591d5ab33	1270	}
be_bryan	0:b74591d5ab33	1271	#endif /* MBEDTLS_PKCS1_V15 */
be_bryan	0:b74591d5ab33	1272
be_bryan	0:b74591d5ab33	1273	/*
be_bryan	0:b74591d5ab33	1274	* Do an RSA operation to sign the message digest
be_bryan	0:b74591d5ab33	1275	*/
be_bryan	0:b74591d5ab33	1276	int mbedtls_rsa_pkcs1_sign( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	1277	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	1278	void *p_rng,
be_bryan	0:b74591d5ab33	1279	int mode,
be_bryan	0:b74591d5ab33	1280	mbedtls_md_type_t md_alg,
be_bryan	0:b74591d5ab33	1281	unsigned int hashlen,
be_bryan	0:b74591d5ab33	1282	const unsigned char *hash,
be_bryan	0:b74591d5ab33	1283	unsigned char *sig )
be_bryan	0:b74591d5ab33	1284	{
be_bryan	0:b74591d5ab33	1285	switch( ctx->padding )
be_bryan	0:b74591d5ab33	1286	{
be_bryan	0:b74591d5ab33	1287	#if defined(MBEDTLS_PKCS1_V15)
be_bryan	0:b74591d5ab33	1288	case MBEDTLS_RSA_PKCS_V15:
be_bryan	0:b74591d5ab33	1289	return mbedtls_rsa_rsassa_pkcs1_v15_sign( ctx, f_rng, p_rng, mode, md_alg,
be_bryan	0:b74591d5ab33	1290	hashlen, hash, sig );
be_bryan	0:b74591d5ab33	1291	#endif
be_bryan	0:b74591d5ab33	1292
be_bryan	0:b74591d5ab33	1293	#if defined(MBEDTLS_PKCS1_V21)
be_bryan	0:b74591d5ab33	1294	case MBEDTLS_RSA_PKCS_V21:
be_bryan	0:b74591d5ab33	1295	return mbedtls_rsa_rsassa_pss_sign( ctx, f_rng, p_rng, mode, md_alg,
be_bryan	0:b74591d5ab33	1296	hashlen, hash, sig );
be_bryan	0:b74591d5ab33	1297	#endif
be_bryan	0:b74591d5ab33	1298
be_bryan	0:b74591d5ab33	1299	default:
be_bryan	0:b74591d5ab33	1300	return( MBEDTLS_ERR_RSA_INVALID_PADDING );
be_bryan	0:b74591d5ab33	1301	}
be_bryan	0:b74591d5ab33	1302	}
be_bryan	0:b74591d5ab33	1303
be_bryan	0:b74591d5ab33	1304	#if defined(MBEDTLS_PKCS1_V21)
be_bryan	0:b74591d5ab33	1305	/*
be_bryan	0:b74591d5ab33	1306	* Implementation of the PKCS#1 v2.1 RSASSA-PSS-VERIFY function
be_bryan	0:b74591d5ab33	1307	*/
be_bryan	0:b74591d5ab33	1308	int mbedtls_rsa_rsassa_pss_verify_ext( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	1309	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	1310	void *p_rng,
be_bryan	0:b74591d5ab33	1311	int mode,
be_bryan	0:b74591d5ab33	1312	mbedtls_md_type_t md_alg,
be_bryan	0:b74591d5ab33	1313	unsigned int hashlen,
be_bryan	0:b74591d5ab33	1314	const unsigned char *hash,
be_bryan	0:b74591d5ab33	1315	mbedtls_md_type_t mgf1_hash_id,
be_bryan	0:b74591d5ab33	1316	int expected_salt_len,
be_bryan	0:b74591d5ab33	1317	const unsigned char *sig )
be_bryan	0:b74591d5ab33	1318	{
be_bryan	0:b74591d5ab33	1319	int ret;
be_bryan	0:b74591d5ab33	1320	size_t siglen;
be_bryan	0:b74591d5ab33	1321	unsigned char *p;
be_bryan	0:b74591d5ab33	1322	unsigned char result[MBEDTLS_MD_MAX_SIZE];
be_bryan	0:b74591d5ab33	1323	unsigned char zeros[8];
be_bryan	0:b74591d5ab33	1324	unsigned int hlen;
be_bryan	0:b74591d5ab33	1325	size_t slen, msb;
be_bryan	0:b74591d5ab33	1326	const mbedtls_md_info_t *md_info;
be_bryan	0:b74591d5ab33	1327	mbedtls_md_context_t md_ctx;
be_bryan	0:b74591d5ab33	1328	unsigned char buf[MBEDTLS_MPI_MAX_SIZE];
be_bryan	0:b74591d5ab33	1329
be_bryan	0:b74591d5ab33	1330	if( mode == MBEDTLS_RSA_PRIVATE && ctx->padding != MBEDTLS_RSA_PKCS_V21 )
be_bryan	0:b74591d5ab33	1331	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1332
be_bryan	0:b74591d5ab33	1333	siglen = ctx->len;
be_bryan	0:b74591d5ab33	1334
be_bryan	0:b74591d5ab33	1335	if( siglen < 16 \|\| siglen > sizeof( buf ) )
be_bryan	0:b74591d5ab33	1336	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1337
be_bryan	0:b74591d5ab33	1338	ret = ( mode == MBEDTLS_RSA_PUBLIC )
be_bryan	0:b74591d5ab33	1339	? mbedtls_rsa_public( ctx, sig, buf )
be_bryan	0:b74591d5ab33	1340	: mbedtls_rsa_private( ctx, f_rng, p_rng, sig, buf );
be_bryan	0:b74591d5ab33	1341
be_bryan	0:b74591d5ab33	1342	if( ret != 0 )
be_bryan	0:b74591d5ab33	1343	return( ret );
be_bryan	0:b74591d5ab33	1344
be_bryan	0:b74591d5ab33	1345	p = buf;
be_bryan	0:b74591d5ab33	1346
be_bryan	0:b74591d5ab33	1347	if( buf[siglen - 1] != 0xBC )
be_bryan	0:b74591d5ab33	1348	return( MBEDTLS_ERR_RSA_INVALID_PADDING );
be_bryan	0:b74591d5ab33	1349
be_bryan	0:b74591d5ab33	1350	if( md_alg != MBEDTLS_MD_NONE )
be_bryan	0:b74591d5ab33	1351	{
be_bryan	0:b74591d5ab33	1352	/* Gather length of hash to sign */
be_bryan	0:b74591d5ab33	1353	md_info = mbedtls_md_info_from_type( md_alg );
be_bryan	0:b74591d5ab33	1354	if( md_info == NULL )
be_bryan	0:b74591d5ab33	1355	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1356
be_bryan	0:b74591d5ab33	1357	hashlen = mbedtls_md_get_size( md_info );
be_bryan	0:b74591d5ab33	1358	}
be_bryan	0:b74591d5ab33	1359
be_bryan	0:b74591d5ab33	1360	md_info = mbedtls_md_info_from_type( mgf1_hash_id );
be_bryan	0:b74591d5ab33	1361	if( md_info == NULL )
be_bryan	0:b74591d5ab33	1362	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1363
be_bryan	0:b74591d5ab33	1364	hlen = mbedtls_md_get_size( md_info );
be_bryan	0:b74591d5ab33	1365	slen = siglen - hlen - 1; /* Currently length of salt + padding */
be_bryan	0:b74591d5ab33	1366
be_bryan	0:b74591d5ab33	1367	memset( zeros, 0, 8 );
be_bryan	0:b74591d5ab33	1368
be_bryan	0:b74591d5ab33	1369	/*
be_bryan	0:b74591d5ab33	1370	* Note: EMSA-PSS verification is over the length of N - 1 bits
be_bryan	0:b74591d5ab33	1371	*/
be_bryan	0:b74591d5ab33	1372	msb = mbedtls_mpi_bitlen( &ctx->N ) - 1;
be_bryan	0:b74591d5ab33	1373
be_bryan	0:b74591d5ab33	1374	/* Compensate for boundary condition when applying mask */
be_bryan	0:b74591d5ab33	1375	if( msb % 8 == 0 )
be_bryan	0:b74591d5ab33	1376	{
be_bryan	0:b74591d5ab33	1377	p++;
be_bryan	0:b74591d5ab33	1378	siglen -= 1;
be_bryan	0:b74591d5ab33	1379	}
be_bryan	0:b74591d5ab33	1380	if( buf[0] >> ( 8 - siglen * 8 + msb ) )
be_bryan	0:b74591d5ab33	1381	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1382
be_bryan	0:b74591d5ab33	1383	mbedtls_md_init( &md_ctx );
be_bryan	0:b74591d5ab33	1384	if( ( ret = mbedtls_md_setup( &md_ctx, md_info, 0 ) ) != 0 )
be_bryan	0:b74591d5ab33	1385	{
be_bryan	0:b74591d5ab33	1386	mbedtls_md_free( &md_ctx );
be_bryan	0:b74591d5ab33	1387	return( ret );
be_bryan	0:b74591d5ab33	1388	}
be_bryan	0:b74591d5ab33	1389
be_bryan	0:b74591d5ab33	1390	mgf_mask( p, siglen - hlen - 1, p + siglen - hlen - 1, hlen, &md_ctx );
be_bryan	0:b74591d5ab33	1391
be_bryan	0:b74591d5ab33	1392	buf[0] &= 0xFF >> ( siglen * 8 - msb );
be_bryan	0:b74591d5ab33	1393
be_bryan	0:b74591d5ab33	1394	while( p < buf + siglen && *p == 0 )
be_bryan	0:b74591d5ab33	1395	p++;
be_bryan	0:b74591d5ab33	1396
be_bryan	0:b74591d5ab33	1397	if( p == buf + siglen \|\|
be_bryan	0:b74591d5ab33	1398	*p++ != 0x01 )
be_bryan	0:b74591d5ab33	1399	{
be_bryan	0:b74591d5ab33	1400	mbedtls_md_free( &md_ctx );
be_bryan	0:b74591d5ab33	1401	return( MBEDTLS_ERR_RSA_INVALID_PADDING );
be_bryan	0:b74591d5ab33	1402	}
be_bryan	0:b74591d5ab33	1403
be_bryan	0:b74591d5ab33	1404	/* Actual salt len */
be_bryan	0:b74591d5ab33	1405	slen -= p - buf;
be_bryan	0:b74591d5ab33	1406
be_bryan	0:b74591d5ab33	1407	if( expected_salt_len != MBEDTLS_RSA_SALT_LEN_ANY &&
be_bryan	0:b74591d5ab33	1408	slen != (size_t) expected_salt_len )
be_bryan	0:b74591d5ab33	1409	{
be_bryan	0:b74591d5ab33	1410	mbedtls_md_free( &md_ctx );
be_bryan	0:b74591d5ab33	1411	return( MBEDTLS_ERR_RSA_INVALID_PADDING );
be_bryan	0:b74591d5ab33	1412	}
be_bryan	0:b74591d5ab33	1413
be_bryan	0:b74591d5ab33	1414	/*
be_bryan	0:b74591d5ab33	1415	* Generate H = Hash( M' )
be_bryan	0:b74591d5ab33	1416	*/
be_bryan	0:b74591d5ab33	1417	mbedtls_md_starts( &md_ctx );
be_bryan	0:b74591d5ab33	1418	mbedtls_md_update( &md_ctx, zeros, 8 );
be_bryan	0:b74591d5ab33	1419	mbedtls_md_update( &md_ctx, hash, hashlen );
be_bryan	0:b74591d5ab33	1420	mbedtls_md_update( &md_ctx, p, slen );
be_bryan	0:b74591d5ab33	1421	mbedtls_md_finish( &md_ctx, result );
be_bryan	0:b74591d5ab33	1422
be_bryan	0:b74591d5ab33	1423	mbedtls_md_free( &md_ctx );
be_bryan	0:b74591d5ab33	1424
be_bryan	0:b74591d5ab33	1425	if( memcmp( p + slen, result, hlen ) == 0 )
be_bryan	0:b74591d5ab33	1426	return( 0 );
be_bryan	0:b74591d5ab33	1427	else
be_bryan	0:b74591d5ab33	1428	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1429	}
be_bryan	0:b74591d5ab33	1430
be_bryan	0:b74591d5ab33	1431	/*
be_bryan	0:b74591d5ab33	1432	* Simplified PKCS#1 v2.1 RSASSA-PSS-VERIFY function
be_bryan	0:b74591d5ab33	1433	*/
be_bryan	0:b74591d5ab33	1434	int mbedtls_rsa_rsassa_pss_verify( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	1435	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	1436	void *p_rng,
be_bryan	0:b74591d5ab33	1437	int mode,
be_bryan	0:b74591d5ab33	1438	mbedtls_md_type_t md_alg,
be_bryan	0:b74591d5ab33	1439	unsigned int hashlen,
be_bryan	0:b74591d5ab33	1440	const unsigned char *hash,
be_bryan	0:b74591d5ab33	1441	const unsigned char *sig )
be_bryan	0:b74591d5ab33	1442	{
be_bryan	0:b74591d5ab33	1443	mbedtls_md_type_t mgf1_hash_id = ( ctx->hash_id != MBEDTLS_MD_NONE )
be_bryan	0:b74591d5ab33	1444	? (mbedtls_md_type_t) ctx->hash_id
be_bryan	0:b74591d5ab33	1445	: md_alg;
be_bryan	0:b74591d5ab33	1446
be_bryan	0:b74591d5ab33	1447	return( mbedtls_rsa_rsassa_pss_verify_ext( ctx, f_rng, p_rng, mode,
be_bryan	0:b74591d5ab33	1448	md_alg, hashlen, hash,
be_bryan	0:b74591d5ab33	1449	mgf1_hash_id, MBEDTLS_RSA_SALT_LEN_ANY,
be_bryan	0:b74591d5ab33	1450	sig ) );
be_bryan	0:b74591d5ab33	1451
be_bryan	0:b74591d5ab33	1452	}
be_bryan	0:b74591d5ab33	1453	#endif /* MBEDTLS_PKCS1_V21 */
be_bryan	0:b74591d5ab33	1454
be_bryan	0:b74591d5ab33	1455	#if defined(MBEDTLS_PKCS1_V15)
be_bryan	0:b74591d5ab33	1456	/*
be_bryan	0:b74591d5ab33	1457	* Implementation of the PKCS#1 v2.1 RSASSA-PKCS1-v1_5-VERIFY function
be_bryan	0:b74591d5ab33	1458	*/
be_bryan	0:b74591d5ab33	1459	int mbedtls_rsa_rsassa_pkcs1_v15_verify( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	1460	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	1461	void *p_rng,
be_bryan	0:b74591d5ab33	1462	int mode,
be_bryan	0:b74591d5ab33	1463	mbedtls_md_type_t md_alg,
be_bryan	0:b74591d5ab33	1464	unsigned int hashlen,
be_bryan	0:b74591d5ab33	1465	const unsigned char *hash,
be_bryan	0:b74591d5ab33	1466	const unsigned char *sig )
be_bryan	0:b74591d5ab33	1467	{
be_bryan	0:b74591d5ab33	1468	int ret;
be_bryan	0:b74591d5ab33	1469	size_t len, siglen, asn1_len;
be_bryan	0:b74591d5ab33	1470	unsigned char p, p0, *end;
be_bryan	0:b74591d5ab33	1471	mbedtls_md_type_t msg_md_alg;
be_bryan	0:b74591d5ab33	1472	const mbedtls_md_info_t *md_info;
be_bryan	0:b74591d5ab33	1473	mbedtls_asn1_buf oid;
be_bryan	0:b74591d5ab33	1474	unsigned char buf[MBEDTLS_MPI_MAX_SIZE];
be_bryan	0:b74591d5ab33	1475
be_bryan	0:b74591d5ab33	1476	if( mode == MBEDTLS_RSA_PRIVATE && ctx->padding != MBEDTLS_RSA_PKCS_V15 )
be_bryan	0:b74591d5ab33	1477	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1478
be_bryan	0:b74591d5ab33	1479	siglen = ctx->len;
be_bryan	0:b74591d5ab33	1480
be_bryan	0:b74591d5ab33	1481	if( siglen < 16 \|\| siglen > sizeof( buf ) )
be_bryan	0:b74591d5ab33	1482	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1483
be_bryan	0:b74591d5ab33	1484	ret = ( mode == MBEDTLS_RSA_PUBLIC )
be_bryan	0:b74591d5ab33	1485	? mbedtls_rsa_public( ctx, sig, buf )
be_bryan	0:b74591d5ab33	1486	: mbedtls_rsa_private( ctx, f_rng, p_rng, sig, buf );
be_bryan	0:b74591d5ab33	1487
be_bryan	0:b74591d5ab33	1488	if( ret != 0 )
be_bryan	0:b74591d5ab33	1489	return( ret );
be_bryan	0:b74591d5ab33	1490
be_bryan	0:b74591d5ab33	1491	p = buf;
be_bryan	0:b74591d5ab33	1492
be_bryan	0:b74591d5ab33	1493	if( p++ != 0 \|\| p++ != MBEDTLS_RSA_SIGN )
be_bryan	0:b74591d5ab33	1494	return( MBEDTLS_ERR_RSA_INVALID_PADDING );
be_bryan	0:b74591d5ab33	1495
be_bryan	0:b74591d5ab33	1496	while( *p != 0 )
be_bryan	0:b74591d5ab33	1497	{
be_bryan	0:b74591d5ab33	1498	if( p >= buf + siglen - 1 \|\| *p != 0xFF )
be_bryan	0:b74591d5ab33	1499	return( MBEDTLS_ERR_RSA_INVALID_PADDING );
be_bryan	0:b74591d5ab33	1500	p++;
be_bryan	0:b74591d5ab33	1501	}
be_bryan	0:b74591d5ab33	1502	p++; /* skip 00 byte */
be_bryan	0:b74591d5ab33	1503
be_bryan	0:b74591d5ab33	1504	/* We've read: 00 01 PS 00 where PS must be at least 8 bytes */
be_bryan	0:b74591d5ab33	1505	if( p - buf < 11 )
be_bryan	0:b74591d5ab33	1506	return( MBEDTLS_ERR_RSA_INVALID_PADDING );
be_bryan	0:b74591d5ab33	1507
be_bryan	0:b74591d5ab33	1508	len = siglen - ( p - buf );
be_bryan	0:b74591d5ab33	1509
be_bryan	0:b74591d5ab33	1510	if( len == hashlen && md_alg == MBEDTLS_MD_NONE )
be_bryan	0:b74591d5ab33	1511	{
be_bryan	0:b74591d5ab33	1512	if( memcmp( p, hash, hashlen ) == 0 )
be_bryan	0:b74591d5ab33	1513	return( 0 );
be_bryan	0:b74591d5ab33	1514	else
be_bryan	0:b74591d5ab33	1515	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1516	}
be_bryan	0:b74591d5ab33	1517
be_bryan	0:b74591d5ab33	1518	md_info = mbedtls_md_info_from_type( md_alg );
be_bryan	0:b74591d5ab33	1519	if( md_info == NULL )
be_bryan	0:b74591d5ab33	1520	return( MBEDTLS_ERR_RSA_BAD_INPUT_DATA );
be_bryan	0:b74591d5ab33	1521	hashlen = mbedtls_md_get_size( md_info );
be_bryan	0:b74591d5ab33	1522
be_bryan	0:b74591d5ab33	1523	end = p + len;
be_bryan	0:b74591d5ab33	1524
be_bryan	0:b74591d5ab33	1525	/*
be_bryan	0:b74591d5ab33	1526	* Parse the ASN.1 structure inside the PKCS#1 v1.5 structure.
be_bryan	0:b74591d5ab33	1527	* Insist on 2-byte length tags, to protect against variants of
be_bryan	0:b74591d5ab33	1528	* Bleichenbacher's forgery attack against lax PKCS#1v1.5 verification.
be_bryan	0:b74591d5ab33	1529	*/
be_bryan	0:b74591d5ab33	1530	p0 = p;
be_bryan	0:b74591d5ab33	1531	if( ( ret = mbedtls_asn1_get_tag( &p, end, &asn1_len,
be_bryan	0:b74591d5ab33	1532	MBEDTLS_ASN1_CONSTRUCTED \| MBEDTLS_ASN1_SEQUENCE ) ) != 0 )
be_bryan	0:b74591d5ab33	1533	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1534	if( p != p0 + 2 \|\| asn1_len + 2 != len )
be_bryan	0:b74591d5ab33	1535	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1536
be_bryan	0:b74591d5ab33	1537	p0 = p;
be_bryan	0:b74591d5ab33	1538	if( ( ret = mbedtls_asn1_get_tag( &p, end, &asn1_len,
be_bryan	0:b74591d5ab33	1539	MBEDTLS_ASN1_CONSTRUCTED \| MBEDTLS_ASN1_SEQUENCE ) ) != 0 )
be_bryan	0:b74591d5ab33	1540	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1541	if( p != p0 + 2 \|\| asn1_len + 6 + hashlen != len )
be_bryan	0:b74591d5ab33	1542	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1543
be_bryan	0:b74591d5ab33	1544	p0 = p;
be_bryan	0:b74591d5ab33	1545	if( ( ret = mbedtls_asn1_get_tag( &p, end, &oid.len, MBEDTLS_ASN1_OID ) ) != 0 )
be_bryan	0:b74591d5ab33	1546	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1547	if( p != p0 + 2 )
be_bryan	0:b74591d5ab33	1548	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1549
be_bryan	0:b74591d5ab33	1550	oid.p = p;
be_bryan	0:b74591d5ab33	1551	p += oid.len;
be_bryan	0:b74591d5ab33	1552
be_bryan	0:b74591d5ab33	1553	if( mbedtls_oid_get_md_alg( &oid, &msg_md_alg ) != 0 )
be_bryan	0:b74591d5ab33	1554	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1555
be_bryan	0:b74591d5ab33	1556	if( md_alg != msg_md_alg )
be_bryan	0:b74591d5ab33	1557	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1558
be_bryan	0:b74591d5ab33	1559	/*
be_bryan	0:b74591d5ab33	1560	* assume the algorithm parameters must be NULL
be_bryan	0:b74591d5ab33	1561	*/
be_bryan	0:b74591d5ab33	1562	p0 = p;
be_bryan	0:b74591d5ab33	1563	if( ( ret = mbedtls_asn1_get_tag( &p, end, &asn1_len, MBEDTLS_ASN1_NULL ) ) != 0 )
be_bryan	0:b74591d5ab33	1564	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1565	if( p != p0 + 2 )
be_bryan	0:b74591d5ab33	1566	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1567
be_bryan	0:b74591d5ab33	1568	p0 = p;
be_bryan	0:b74591d5ab33	1569	if( ( ret = mbedtls_asn1_get_tag( &p, end, &asn1_len, MBEDTLS_ASN1_OCTET_STRING ) ) != 0 )
be_bryan	0:b74591d5ab33	1570	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1571	if( p != p0 + 2 \|\| asn1_len != hashlen )
be_bryan	0:b74591d5ab33	1572	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1573
be_bryan	0:b74591d5ab33	1574	if( memcmp( p, hash, hashlen ) != 0 )
be_bryan	0:b74591d5ab33	1575	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1576
be_bryan	0:b74591d5ab33	1577	p += hashlen;
be_bryan	0:b74591d5ab33	1578
be_bryan	0:b74591d5ab33	1579	if( p != end )
be_bryan	0:b74591d5ab33	1580	return( MBEDTLS_ERR_RSA_VERIFY_FAILED );
be_bryan	0:b74591d5ab33	1581
be_bryan	0:b74591d5ab33	1582	return( 0 );
be_bryan	0:b74591d5ab33	1583	}
be_bryan	0:b74591d5ab33	1584	#endif /* MBEDTLS_PKCS1_V15 */
be_bryan	0:b74591d5ab33	1585
be_bryan	0:b74591d5ab33	1586	/*
be_bryan	0:b74591d5ab33	1587	* Do an RSA operation and check the message digest
be_bryan	0:b74591d5ab33	1588	*/
be_bryan	0:b74591d5ab33	1589	int mbedtls_rsa_pkcs1_verify( mbedtls_rsa_context *ctx,
be_bryan	0:b74591d5ab33	1590	int (f_rng)(void , unsigned char *, size_t),
be_bryan	0:b74591d5ab33	1591	void *p_rng,
be_bryan	0:b74591d5ab33	1592	int mode,
be_bryan	0:b74591d5ab33	1593	mbedtls_md_type_t md_alg,
be_bryan	0:b74591d5ab33	1594	unsigned int hashlen,
be_bryan	0:b74591d5ab33	1595	const unsigned char *hash,
be_bryan	0:b74591d5ab33	1596	const unsigned char *sig )
be_bryan	0:b74591d5ab33	1597	{
be_bryan	0:b74591d5ab33	1598	switch( ctx->padding )
be_bryan	0:b74591d5ab33	1599	{
be_bryan	0:b74591d5ab33	1600	#if defined(MBEDTLS_PKCS1_V15)
be_bryan	0:b74591d5ab33	1601	case MBEDTLS_RSA_PKCS_V15:
be_bryan	0:b74591d5ab33	1602	return mbedtls_rsa_rsassa_pkcs1_v15_verify( ctx, f_rng, p_rng, mode, md_alg,
be_bryan	0:b74591d5ab33	1603	hashlen, hash, sig );
be_bryan	0:b74591d5ab33	1604	#endif
be_bryan	0:b74591d5ab33	1605
be_bryan	0:b74591d5ab33	1606	#if defined(MBEDTLS_PKCS1_V21)
be_bryan	0:b74591d5ab33	1607	case MBEDTLS_RSA_PKCS_V21:
be_bryan	0:b74591d5ab33	1608	return mbedtls_rsa_rsassa_pss_verify( ctx, f_rng, p_rng, mode, md_alg,
be_bryan	0:b74591d5ab33	1609	hashlen, hash, sig );
be_bryan	0:b74591d5ab33	1610	#endif
be_bryan	0:b74591d5ab33	1611
be_bryan	0:b74591d5ab33	1612	default:
be_bryan	0:b74591d5ab33	1613	return( MBEDTLS_ERR_RSA_INVALID_PADDING );
be_bryan	0:b74591d5ab33	1614	}
be_bryan	0:b74591d5ab33	1615	}
be_bryan	0:b74591d5ab33	1616
be_bryan	0:b74591d5ab33	1617	/*
be_bryan	0:b74591d5ab33	1618	* Copy the components of an RSA key
be_bryan	0:b74591d5ab33	1619	*/
be_bryan	0:b74591d5ab33	1620	int mbedtls_rsa_copy( mbedtls_rsa_context dst, const mbedtls_rsa_context src )
be_bryan	0:b74591d5ab33	1621	{
be_bryan	0:b74591d5ab33	1622	int ret;
be_bryan	0:b74591d5ab33	1623
be_bryan	0:b74591d5ab33	1624	dst->ver = src->ver;
be_bryan	0:b74591d5ab33	1625	dst->len = src->len;
be_bryan	0:b74591d5ab33	1626
be_bryan	0:b74591d5ab33	1627	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->N, &src->N ) );
be_bryan	0:b74591d5ab33	1628	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->E, &src->E ) );
be_bryan	0:b74591d5ab33	1629
be_bryan	0:b74591d5ab33	1630	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->D, &src->D ) );
be_bryan	0:b74591d5ab33	1631	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->P, &src->P ) );
be_bryan	0:b74591d5ab33	1632	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->Q, &src->Q ) );
be_bryan	0:b74591d5ab33	1633	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->DP, &src->DP ) );
be_bryan	0:b74591d5ab33	1634	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->DQ, &src->DQ ) );
be_bryan	0:b74591d5ab33	1635	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->QP, &src->QP ) );
be_bryan	0:b74591d5ab33	1636
be_bryan	0:b74591d5ab33	1637	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->RN, &src->RN ) );
be_bryan	0:b74591d5ab33	1638	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->RP, &src->RP ) );
be_bryan	0:b74591d5ab33	1639	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->RQ, &src->RQ ) );
be_bryan	0:b74591d5ab33	1640
be_bryan	0:b74591d5ab33	1641	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->Vi, &src->Vi ) );
be_bryan	0:b74591d5ab33	1642	MBEDTLS_MPI_CHK( mbedtls_mpi_copy( &dst->Vf, &src->Vf ) );
be_bryan	0:b74591d5ab33	1643
be_bryan	0:b74591d5ab33	1644	dst->padding = src->padding;
be_bryan	0:b74591d5ab33	1645	dst->hash_id = src->hash_id;
be_bryan	0:b74591d5ab33	1646
be_bryan	0:b74591d5ab33	1647	cleanup:
be_bryan	0:b74591d5ab33	1648	if( ret != 0 )
be_bryan	0:b74591d5ab33	1649	mbedtls_rsa_free( dst );
be_bryan	0:b74591d5ab33	1650
be_bryan	0:b74591d5ab33	1651	return( ret );
be_bryan	0:b74591d5ab33	1652	}
be_bryan	0:b74591d5ab33	1653
be_bryan	0:b74591d5ab33	1654	/*
be_bryan	0:b74591d5ab33	1655	* Free the components of an RSA key
be_bryan	0:b74591d5ab33	1656	*/
be_bryan	0:b74591d5ab33	1657	void mbedtls_rsa_free( mbedtls_rsa_context *ctx )
be_bryan	0:b74591d5ab33	1658	{
be_bryan	0:b74591d5ab33	1659	mbedtls_mpi_free( &ctx->Vi ); mbedtls_mpi_free( &ctx->Vf );
be_bryan	0:b74591d5ab33	1660	mbedtls_mpi_free( &ctx->RQ ); mbedtls_mpi_free( &ctx->RP ); mbedtls_mpi_free( &ctx->RN );
be_bryan	0:b74591d5ab33	1661	mbedtls_mpi_free( &ctx->QP ); mbedtls_mpi_free( &ctx->DQ ); mbedtls_mpi_free( &ctx->DP );
be_bryan	0:b74591d5ab33	1662	mbedtls_mpi_free( &ctx->Q ); mbedtls_mpi_free( &ctx->P ); mbedtls_mpi_free( &ctx->D );
be_bryan	0:b74591d5ab33	1663	mbedtls_mpi_free( &ctx->E ); mbedtls_mpi_free( &ctx->N );
be_bryan	0:b74591d5ab33	1664
be_bryan	0:b74591d5ab33	1665	#if defined(MBEDTLS_THREADING_C)
be_bryan	0:b74591d5ab33	1666	mbedtls_mutex_free( &ctx->mutex );
be_bryan	0:b74591d5ab33	1667	#endif
be_bryan	0:b74591d5ab33	1668	}
be_bryan	0:b74591d5ab33	1669
be_bryan	0:b74591d5ab33	1670	#if defined(MBEDTLS_SELF_TEST)
be_bryan	0:b74591d5ab33	1671
be_bryan	0:b74591d5ab33	1672	#include "mbedtls/sha1.h"
be_bryan	0:b74591d5ab33	1673
be_bryan	0:b74591d5ab33	1674	/*
be_bryan	0:b74591d5ab33	1675	* Example RSA-1024 keypair, for test purposes
be_bryan	0:b74591d5ab33	1676	*/
be_bryan	0:b74591d5ab33	1677	#define KEY_LEN 128
be_bryan	0:b74591d5ab33	1678
be_bryan	0:b74591d5ab33	1679	#define RSA_N "9292758453063D803DD603D5E777D788" \
be_bryan	0:b74591d5ab33	1680	"8ED1D5BF35786190FA2F23EBC0848AEA" \
be_bryan	0:b74591d5ab33	1681	"DDA92CA6C3D80B32C4D109BE0F36D6AE" \
be_bryan	0:b74591d5ab33	1682	"7130B9CED7ACDF54CFC7555AC14EEBAB" \
be_bryan	0:b74591d5ab33	1683	"93A89813FBF3C4F8066D2D800F7C38A8" \
be_bryan	0:b74591d5ab33	1684	"1AE31942917403FF4946B0A83D3D3E05" \
be_bryan	0:b74591d5ab33	1685	"EE57C6F5F5606FB5D4BC6CD34EE0801A" \
be_bryan	0:b74591d5ab33	1686	"5E94BB77B07507233A0BC7BAC8F90F79"
be_bryan	0:b74591d5ab33	1687
be_bryan	0:b74591d5ab33	1688	#define RSA_E "10001"
be_bryan	0:b74591d5ab33	1689
be_bryan	0:b74591d5ab33	1690	#define RSA_D "24BF6185468786FDD303083D25E64EFC" \
be_bryan	0:b74591d5ab33	1691	"66CA472BC44D253102F8B4A9D3BFA750" \
be_bryan	0:b74591d5ab33	1692	"91386C0077937FE33FA3252D28855837" \
be_bryan	0:b74591d5ab33	1693	"AE1B484A8A9A45F7EE8C0C634F99E8CD" \
be_bryan	0:b74591d5ab33	1694	"DF79C5CE07EE72C7F123142198164234" \
be_bryan	0:b74591d5ab33	1695	"CABB724CF78B8173B9F880FC86322407" \
be_bryan	0:b74591d5ab33	1696	"AF1FEDFDDE2BEB674CA15F3E81A1521E" \
be_bryan	0:b74591d5ab33	1697	"071513A1E85B5DFA031F21ECAE91A34D"
be_bryan	0:b74591d5ab33	1698
be_bryan	0:b74591d5ab33	1699	#define RSA_P "C36D0EB7FCD285223CFB5AABA5BDA3D8" \
be_bryan	0:b74591d5ab33	1700	"2C01CAD19EA484A87EA4377637E75500" \
be_bryan	0:b74591d5ab33	1701	"FCB2005C5C7DD6EC4AC023CDA285D796" \
be_bryan	0:b74591d5ab33	1702	"C3D9E75E1EFC42488BB4F1D13AC30A57"
be_bryan	0:b74591d5ab33	1703
be_bryan	0:b74591d5ab33	1704	#define RSA_Q "C000DF51A7C77AE8D7C7370C1FF55B69" \
be_bryan	0:b74591d5ab33	1705	"E211C2B9E5DB1ED0BF61D0D9899620F4" \
be_bryan	0:b74591d5ab33	1706	"910E4168387E3C30AA1E00C339A79508" \
be_bryan	0:b74591d5ab33	1707	"8452DD96A9A5EA5D9DCA68DA636032AF"
be_bryan	0:b74591d5ab33	1708
be_bryan	0:b74591d5ab33	1709	#define RSA_DP "C1ACF567564274FB07A0BBAD5D26E298" \
be_bryan	0:b74591d5ab33	1710	"3C94D22288ACD763FD8E5600ED4A702D" \
be_bryan	0:b74591d5ab33	1711	"F84198A5F06C2E72236AE490C93F07F8" \
be_bryan	0:b74591d5ab33	1712	"3CC559CD27BC2D1CA488811730BB5725"
be_bryan	0:b74591d5ab33	1713
be_bryan	0:b74591d5ab33	1714	#define RSA_DQ "4959CBF6F8FEF750AEE6977C155579C7" \
be_bryan	0:b74591d5ab33	1715	"D8AAEA56749EA28623272E4F7D0592AF" \
be_bryan	0:b74591d5ab33	1716	"7C1F1313CAC9471B5C523BFE592F517B" \
be_bryan	0:b74591d5ab33	1717	"407A1BD76C164B93DA2D32A383E58357"
be_bryan	0:b74591d5ab33	1718
be_bryan	0:b74591d5ab33	1719	#define RSA_QP "9AE7FBC99546432DF71896FC239EADAE" \
be_bryan	0:b74591d5ab33	1720	"F38D18D2B2F0E2DD275AA977E2BF4411" \
be_bryan	0:b74591d5ab33	1721	"F5A3B2A5D33605AEBBCCBA7FEB9F2D2F" \
be_bryan	0:b74591d5ab33	1722	"A74206CEC169D74BF5A8C50D6F48EA08"
be_bryan	0:b74591d5ab33	1723
be_bryan	0:b74591d5ab33	1724	#define PT_LEN 24
be_bryan	0:b74591d5ab33	1725	#define RSA_PT "\xAA\xBB\xCC\x03\x02\x01\x00\xFF\xFF\xFF\xFF\xFF" \
be_bryan	0:b74591d5ab33	1726	"\x11\x22\x33\x0A\x0B\x0C\xCC\xDD\xDD\xDD\xDD\xDD"
be_bryan	0:b74591d5ab33	1727
be_bryan	0:b74591d5ab33	1728	#if defined(MBEDTLS_PKCS1_V15)
be_bryan	0:b74591d5ab33	1729	static int myrand( void rng_state, unsigned char output, size_t len )
be_bryan	0:b74591d5ab33	1730	{
be_bryan	0:b74591d5ab33	1731	#if !defined(__OpenBSD__)
be_bryan	0:b74591d5ab33	1732	size_t i;
be_bryan	0:b74591d5ab33	1733
be_bryan	0:b74591d5ab33	1734	if( rng_state != NULL )
be_bryan	0:b74591d5ab33	1735	rng_state = NULL;
be_bryan	0:b74591d5ab33	1736
be_bryan	0:b74591d5ab33	1737	for( i = 0; i < len; ++i )
be_bryan	0:b74591d5ab33	1738	output[i] = rand();
be_bryan	0:b74591d5ab33	1739	#else
be_bryan	0:b74591d5ab33	1740	if( rng_state != NULL )
be_bryan	0:b74591d5ab33	1741	rng_state = NULL;
be_bryan	0:b74591d5ab33	1742
be_bryan	0:b74591d5ab33	1743	arc4random_buf( output, len );
be_bryan	0:b74591d5ab33	1744	#endif /* !OpenBSD */
be_bryan	0:b74591d5ab33	1745
be_bryan	0:b74591d5ab33	1746	return( 0 );
be_bryan	0:b74591d5ab33	1747	}
be_bryan	0:b74591d5ab33	1748	#endif /* MBEDTLS_PKCS1_V15 */
be_bryan	0:b74591d5ab33	1749
be_bryan	0:b74591d5ab33	1750	/*
be_bryan	0:b74591d5ab33	1751	* Checkup routine
be_bryan	0:b74591d5ab33	1752	*/
be_bryan	0:b74591d5ab33	1753	int mbedtls_rsa_self_test( int verbose )
be_bryan	0:b74591d5ab33	1754	{
be_bryan	0:b74591d5ab33	1755	int ret = 0;
be_bryan	0:b74591d5ab33	1756	#if defined(MBEDTLS_PKCS1_V15)
be_bryan	0:b74591d5ab33	1757	size_t len;
be_bryan	0:b74591d5ab33	1758	mbedtls_rsa_context rsa;
be_bryan	0:b74591d5ab33	1759	unsigned char rsa_plaintext[PT_LEN];
be_bryan	0:b74591d5ab33	1760	unsigned char rsa_decrypted[PT_LEN];
be_bryan	0:b74591d5ab33	1761	unsigned char rsa_ciphertext[KEY_LEN];
be_bryan	0:b74591d5ab33	1762	#if defined(MBEDTLS_SHA1_C)
be_bryan	0:b74591d5ab33	1763	unsigned char sha1sum[20];
be_bryan	0:b74591d5ab33	1764	#endif
be_bryan	0:b74591d5ab33	1765
be_bryan	0:b74591d5ab33	1766	mbedtls_rsa_init( &rsa, MBEDTLS_RSA_PKCS_V15, 0 );
be_bryan	0:b74591d5ab33	1767
be_bryan	0:b74591d5ab33	1768	rsa.len = KEY_LEN;
be_bryan	0:b74591d5ab33	1769	MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &rsa.N , 16, RSA_N ) );
be_bryan	0:b74591d5ab33	1770	MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &rsa.E , 16, RSA_E ) );
be_bryan	0:b74591d5ab33	1771	MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &rsa.D , 16, RSA_D ) );
be_bryan	0:b74591d5ab33	1772	MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &rsa.P , 16, RSA_P ) );
be_bryan	0:b74591d5ab33	1773	MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &rsa.Q , 16, RSA_Q ) );
be_bryan	0:b74591d5ab33	1774	MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &rsa.DP, 16, RSA_DP ) );
be_bryan	0:b74591d5ab33	1775	MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &rsa.DQ, 16, RSA_DQ ) );
be_bryan	0:b74591d5ab33	1776	MBEDTLS_MPI_CHK( mbedtls_mpi_read_string( &rsa.QP, 16, RSA_QP ) );
be_bryan	0:b74591d5ab33	1777
be_bryan	0:b74591d5ab33	1778	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1779	mbedtls_printf( " RSA key validation: " );
be_bryan	0:b74591d5ab33	1780
be_bryan	0:b74591d5ab33	1781	if( mbedtls_rsa_check_pubkey( &rsa ) != 0 \|\|
be_bryan	0:b74591d5ab33	1782	mbedtls_rsa_check_privkey( &rsa ) != 0 )
be_bryan	0:b74591d5ab33	1783	{
be_bryan	0:b74591d5ab33	1784	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1785	mbedtls_printf( "failed\n" );
be_bryan	0:b74591d5ab33	1786
be_bryan	0:b74591d5ab33	1787	return( 1 );
be_bryan	0:b74591d5ab33	1788	}
be_bryan	0:b74591d5ab33	1789
be_bryan	0:b74591d5ab33	1790	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1791	mbedtls_printf( "passed\n PKCS#1 encryption : " );
be_bryan	0:b74591d5ab33	1792
be_bryan	0:b74591d5ab33	1793	memcpy( rsa_plaintext, RSA_PT, PT_LEN );
be_bryan	0:b74591d5ab33	1794
be_bryan	0:b74591d5ab33	1795	if( mbedtls_rsa_pkcs1_encrypt( &rsa, myrand, NULL, MBEDTLS_RSA_PUBLIC, PT_LEN,
be_bryan	0:b74591d5ab33	1796	rsa_plaintext, rsa_ciphertext ) != 0 )
be_bryan	0:b74591d5ab33	1797	{
be_bryan	0:b74591d5ab33	1798	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1799	mbedtls_printf( "failed\n" );
be_bryan	0:b74591d5ab33	1800
be_bryan	0:b74591d5ab33	1801	return( 1 );
be_bryan	0:b74591d5ab33	1802	}
be_bryan	0:b74591d5ab33	1803
be_bryan	0:b74591d5ab33	1804	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1805	mbedtls_printf( "passed\n PKCS#1 decryption : " );
be_bryan	0:b74591d5ab33	1806
be_bryan	0:b74591d5ab33	1807	if( mbedtls_rsa_pkcs1_decrypt( &rsa, myrand, NULL, MBEDTLS_RSA_PRIVATE, &len,
be_bryan	0:b74591d5ab33	1808	rsa_ciphertext, rsa_decrypted,
be_bryan	0:b74591d5ab33	1809	sizeof(rsa_decrypted) ) != 0 )
be_bryan	0:b74591d5ab33	1810	{
be_bryan	0:b74591d5ab33	1811	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1812	mbedtls_printf( "failed\n" );
be_bryan	0:b74591d5ab33	1813
be_bryan	0:b74591d5ab33	1814	return( 1 );
be_bryan	0:b74591d5ab33	1815	}
be_bryan	0:b74591d5ab33	1816
be_bryan	0:b74591d5ab33	1817	if( memcmp( rsa_decrypted, rsa_plaintext, len ) != 0 )
be_bryan	0:b74591d5ab33	1818	{
be_bryan	0:b74591d5ab33	1819	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1820	mbedtls_printf( "failed\n" );
be_bryan	0:b74591d5ab33	1821
be_bryan	0:b74591d5ab33	1822	return( 1 );
be_bryan	0:b74591d5ab33	1823	}
be_bryan	0:b74591d5ab33	1824
be_bryan	0:b74591d5ab33	1825	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1826	mbedtls_printf( "passed\n" );
be_bryan	0:b74591d5ab33	1827
be_bryan	0:b74591d5ab33	1828	#if defined(MBEDTLS_SHA1_C)
be_bryan	0:b74591d5ab33	1829	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1830	mbedtls_printf( " PKCS#1 data sign : " );
be_bryan	0:b74591d5ab33	1831
be_bryan	0:b74591d5ab33	1832	mbedtls_sha1( rsa_plaintext, PT_LEN, sha1sum );
be_bryan	0:b74591d5ab33	1833
be_bryan	0:b74591d5ab33	1834	if( mbedtls_rsa_pkcs1_sign( &rsa, myrand, NULL, MBEDTLS_RSA_PRIVATE, MBEDTLS_MD_SHA1, 0,
be_bryan	0:b74591d5ab33	1835	sha1sum, rsa_ciphertext ) != 0 )
be_bryan	0:b74591d5ab33	1836	{
be_bryan	0:b74591d5ab33	1837	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1838	mbedtls_printf( "failed\n" );
be_bryan	0:b74591d5ab33	1839
be_bryan	0:b74591d5ab33	1840	return( 1 );
be_bryan	0:b74591d5ab33	1841	}
be_bryan	0:b74591d5ab33	1842
be_bryan	0:b74591d5ab33	1843	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1844	mbedtls_printf( "passed\n PKCS#1 sig. verify: " );
be_bryan	0:b74591d5ab33	1845
be_bryan	0:b74591d5ab33	1846	if( mbedtls_rsa_pkcs1_verify( &rsa, NULL, NULL, MBEDTLS_RSA_PUBLIC, MBEDTLS_MD_SHA1, 0,
be_bryan	0:b74591d5ab33	1847	sha1sum, rsa_ciphertext ) != 0 )
be_bryan	0:b74591d5ab33	1848	{
be_bryan	0:b74591d5ab33	1849	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1850	mbedtls_printf( "failed\n" );
be_bryan	0:b74591d5ab33	1851
be_bryan	0:b74591d5ab33	1852	return( 1 );
be_bryan	0:b74591d5ab33	1853	}
be_bryan	0:b74591d5ab33	1854
be_bryan	0:b74591d5ab33	1855	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1856	mbedtls_printf( "passed\n" );
be_bryan	0:b74591d5ab33	1857	#endif /* MBEDTLS_SHA1_C */
be_bryan	0:b74591d5ab33	1858
be_bryan	0:b74591d5ab33	1859	if( verbose != 0 )
be_bryan	0:b74591d5ab33	1860	mbedtls_printf( "\n" );
be_bryan	0:b74591d5ab33	1861
be_bryan	0:b74591d5ab33	1862	cleanup:
be_bryan	0:b74591d5ab33	1863	mbedtls_rsa_free( &rsa );
be_bryan	0:b74591d5ab33	1864	#else /* MBEDTLS_PKCS1_V15 */
be_bryan	0:b74591d5ab33	1865	((void) verbose);
be_bryan	0:b74591d5ab33	1866	#endif /* MBEDTLS_PKCS1_V15 */
be_bryan	0:b74591d5ab33	1867	return( ret );
be_bryan	0:b74591d5ab33	1868	}
be_bryan	0:b74591d5ab33	1869
be_bryan	0:b74591d5ab33	1870	#endif /* MBEDTLS_SELF_TEST */
be_bryan	0:b74591d5ab33	1871
be_bryan	0:b74591d5ab33	1872	#endif /* MBEDTLS_RSA_C */

Repository toolbox

Export to desktop IDE

Repository details

Type:	Library
Created:	12 Dec 2017
Imports:	1018
Forks:	0
Commits:	1
Dependents:	14
Dependencies:	0
Followers:	23

features/mbedtls/src/rsa.c@0:b74591d5ab33, 2017-12-11 (annotated)

Who changed what in which revision?

Repository toolbox

Repository details

Important Information for this Arm website

Access Warning