blob: 6e07bfd606a28a8175abc99c7932d1c74dcf5e69 [file] [log] [blame]
Paul Bakker5121ce52009-01-03 21:22:43 +00001/**
2 * \file rsa.h
Paul Bakkere0ccd0a2009-01-04 16:27:10 +00003 *
Paul Bakker37ca75d2011-01-06 12:28:03 +00004 * \brief The RSA public-key cryptosystem
5 *
Manuel Pégourié-Gonnard6fb81872015-07-27 11:11:48 +02006 * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved
Manuel Pégourié-Gonnard37ff1402015-09-04 14:21:07 +02007 * SPDX-License-Identifier: Apache-2.0
8 *
9 * Licensed under the Apache License, Version 2.0 (the "License"); you may
10 * not use this file except in compliance with the License.
11 * You may obtain a copy of the License at
12 *
13 * http://www.apache.org/licenses/LICENSE-2.0
14 *
15 * Unless required by applicable law or agreed to in writing, software
16 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
17 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
18 * See the License for the specific language governing permissions and
19 * limitations under the License.
Paul Bakkerb96f1542010-07-18 20:36:00 +000020 *
Manuel Pégourié-Gonnardfe446432015-03-06 13:17:10 +000021 * This file is part of mbed TLS (https://tls.mbed.org)
Paul Bakker5121ce52009-01-03 21:22:43 +000022 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020023#ifndef MBEDTLS_RSA_H
24#define MBEDTLS_RSA_H
Paul Bakker5121ce52009-01-03 21:22:43 +000025
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020026#if !defined(MBEDTLS_CONFIG_FILE)
Paul Bakkered27a042013-04-18 22:46:23 +020027#include "config.h"
Manuel Pégourié-Gonnardcef4ad22014-04-29 12:39:06 +020028#else
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020029#include MBEDTLS_CONFIG_FILE
Manuel Pégourié-Gonnardcef4ad22014-04-29 12:39:06 +020030#endif
Paul Bakkered27a042013-04-18 22:46:23 +020031
Paul Bakker314052f2011-08-15 09:07:52 +000032#include "bignum.h"
Paul Bakkerc70b9822013-04-07 22:00:46 +020033#include "md.h"
Paul Bakker5121ce52009-01-03 21:22:43 +000034
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020035#if defined(MBEDTLS_THREADING_C)
Paul Bakkerc9965dc2013-09-29 14:58:17 +020036#include "threading.h"
37#endif
38
Paul Bakker13e2dfe2009-07-28 07:18:38 +000039/*
40 * RSA Error codes
41 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020042#define MBEDTLS_ERR_RSA_BAD_INPUT_DATA -0x4080 /**< Bad input parameters to function. */
43#define MBEDTLS_ERR_RSA_INVALID_PADDING -0x4100 /**< Input data contains invalid padding and is rejected. */
44#define MBEDTLS_ERR_RSA_KEY_GEN_FAILED -0x4180 /**< Something failed during generation of a key. */
Manuel Pégourié-Gonnardeecb43c2015-05-12 12:56:41 +020045#define MBEDTLS_ERR_RSA_KEY_CHECK_FAILED -0x4200 /**< Key failed to pass the library's validity check. */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020046#define MBEDTLS_ERR_RSA_PUBLIC_FAILED -0x4280 /**< The public key operation failed. */
47#define MBEDTLS_ERR_RSA_PRIVATE_FAILED -0x4300 /**< The private key operation failed. */
48#define MBEDTLS_ERR_RSA_VERIFY_FAILED -0x4380 /**< The PKCS#1 verification failed. */
49#define MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE -0x4400 /**< The output buffer for decryption is not large enough. */
50#define MBEDTLS_ERR_RSA_RNG_FAILED -0x4480 /**< The random generator failed to generate non-zeros. */
Paul Bakker5121ce52009-01-03 21:22:43 +000051
52/*
Paul Bakkerc70b9822013-04-07 22:00:46 +020053 * RSA constants
Paul Bakker5121ce52009-01-03 21:22:43 +000054 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020055#define MBEDTLS_RSA_PUBLIC 0
56#define MBEDTLS_RSA_PRIVATE 1
Paul Bakker5121ce52009-01-03 21:22:43 +000057
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020058#define MBEDTLS_RSA_PKCS_V15 0
59#define MBEDTLS_RSA_PKCS_V21 1
Paul Bakker5121ce52009-01-03 21:22:43 +000060
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020061#define MBEDTLS_RSA_SIGN 1
62#define MBEDTLS_RSA_CRYPT 2
Paul Bakker5121ce52009-01-03 21:22:43 +000063
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020064#define MBEDTLS_RSA_SALT_LEN_ANY -1
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +020065
Manuel Pégourié-Gonnarde511ffc2013-08-22 17:33:21 +020066/*
67 * The above constants may be used even if the RSA module is compile out,
68 * eg for alternative (PKCS#11) RSA implemenations in the PK layers.
69 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020070#if defined(MBEDTLS_RSA_C)
Manuel Pégourié-Gonnarde511ffc2013-08-22 17:33:21 +020071
Paul Bakker407a0da2013-06-27 14:29:21 +020072#ifdef __cplusplus
73extern "C" {
74#endif
75
Paul Bakker5121ce52009-01-03 21:22:43 +000076/**
Hanno Beckera3ebec22017-08-23 14:06:24 +010077 * Helper functions for RSA-related operations on MPI's.
78 */
79
80/**
81 * \brief Compute RSA prime moduli P, Q from public modulus N=PQ
Hanno Beckerb0c5edc2017-08-23 22:16:10 +010082 * and a pair of private and public key.
Hanno Beckera3ebec22017-08-23 14:06:24 +010083 *
84 * \note This is a 'static' helper function not operating on
85 * an RSA context. Alternative implementations need not
86 * overwrite it.
87 *
88 * \param N RSA modulus N = PQ, with P, Q to be found
89 * \param D RSA private exponent
90 * \param E RSA public exponent
91 * \param f_rng PRNG to be used for randomization, or NULL
92 * \param p_rng PRNG context for f_rng, or NULL
93 * \param P Pointer to MPI holding first prime factor of N on success
94 * \param Q Pointer to MPI holding second prime factor of N on success
95 *
96 * \return - 0 if successful. In this case, P and Q constitute a
97 * factorization of N, and it is guaranteed that D and E
98 * are indeed modular inverses modulo P-1 and modulo Q-1.
99 * The values of N, D and E are unchanged. It is checked
100 * that P, Q are prime if a PRNG is provided.
101 * - A non-zero error code otherwise. In this case, the values
102 * of N, D, E are undefined.
103 *
104 * \note The input MPI's are deliberately not declared as constant
105 * and may therefore be used for in-place calculations by
106 * the implementation. In particular, their values can be
107 * corrupted when the function fails. If the user cannot
108 * tolerate this, he has to make copies of the MPI's prior
109 * to calling this function. See \c mbedtls_mpi_copy for this.
110 */
111int mbedtls_rsa_deduce_moduli( mbedtls_mpi *N, mbedtls_mpi *D, mbedtls_mpi *E,
112 int (*f_rng)(void *, unsigned char *, size_t), void *p_rng,
113 mbedtls_mpi *P, mbedtls_mpi *Q );
114
115/**
116 * \brief Compute RSA private exponent from
117 * prime moduli and public key.
118 *
119 * \note This is a 'static' helper function not operating on
120 * an RSA context. Alternative implementations need not
121 * overwrite it.
122 *
123 * \param P First prime factor of RSA modulus
124 * \param Q Second prime factor of RSA modulus
125 * \param E RSA public exponent
126 * \param D Pointer to MPI holding the private exponent on success.
127 *
128 * \note This function does not check whether P and Q are primes.
129 *
130 * \return - 0 if successful. In this case, D is set to a simultaneous
131 * modular inverse of E modulo both P-1 and Q-1.
132 * - A non-zero error code otherwise. In this case, the values
133 * of P, Q, E are undefined.
134 *
135 * \note The input MPI's are deliberately not declared as constant
136 * and may therefore be used for in-place calculations by
137 * the implementation. In particular, their values can be
138 * corrupted when the function fails. If the user cannot
139 * tolerate this, he has to make copies of the MPI's prior
140 * to calling this function. See \c mbedtls_mpi_copy for this.
141 */
142int mbedtls_rsa_deduce_private( mbedtls_mpi *P, mbedtls_mpi *Q, mbedtls_mpi *E,
143 mbedtls_mpi *D );
144
145
146/**
147 * \brief Generate RSA-CRT parameters
148 *
149 * \note This is a 'static' helper function not operating on
150 * an RSA context. Alternative implementations need not
151 * overwrite it.
152 *
153 * \param P First prime factor of N
154 * \param Q Second prime factor of N
155 * \param D RSA private exponent
156 * \param DP Output variable for D modulo P-1
157 * \param DQ Output variable for D modulo Q-1
158 * \param QP Output variable for the modular inverse of Q modulo P.
159 *
160 * \return 0 on success, non-zero error code otherwise.
161 *
162 */
163int mbedtls_rsa_deduce_crt( const mbedtls_mpi *P, const mbedtls_mpi *Q,
164 const mbedtls_mpi *D, mbedtls_mpi *DP,
165 mbedtls_mpi *DQ, mbedtls_mpi *QP );
166
167
168/**
169 * \brief Check validity of core RSA parameters
170 *
171 * \note This is a 'static' helper function not operating on
172 * an RSA context. Alternative implementations need not
173 * overwrite it.
174 *
175 * \param N RSA modulus N = PQ
176 * \param P First prime factor of N
177 * \param Q Second prime factor of N
178 * \param D RSA private exponent
179 * \param E RSA public exponent
180 * \param f_rng PRNG to be used for randomization, or NULL
181 * \param p_rng PRNG context for f_rng, or NULL
182 *
183 * \return - 0 if the following conditions are satisfied:
184 * - N = PQ if N,P,Q != NULL
185 * - D and E are modular inverses modulo P-1 and Q-1
186 * if D,E,P,Q != NULL
187 * - P prime if f_rng, P != NULL
188 * - Q prime if f_rng, Q != NULL
189 * - A non-zero error code otherwise. In this case, the values
190 * of N, P, Q, D, E are undefined.
191 *
192 * \note The function can be used with a restricted set of arguments
193 * to perform specific checks only. E.g., calling it with
194 * (-,P,-,-,-) and a PRNG amounts to a primality check for P.
195 *
196 * \note The input MPI's are deliberately not declared as constant
197 * and may therefore be used for in-place calculations by
198 * the implementation. In particular, their values can be
199 * corrupted when the function fails. If the user cannot
200 * tolerate this, he has to make copies of the MPI's prior
201 * to calling this function. See \c mbedtls_mpi_copy for this.
202 */
203int mbedtls_rsa_check_params( mbedtls_mpi *N, mbedtls_mpi *P, mbedtls_mpi *Q,
204 mbedtls_mpi *D, mbedtls_mpi *E,
205 int (*f_rng)(void *, unsigned char *, size_t),
206 void *p_rng );
207
208/**
209 * Implementation of RSA interface
210 */
211
Hanno Beckerab377312017-08-23 16:24:51 +0100212#if !defined(MBEDTLS_RSA_ALT)
213
Hanno Beckera3ebec22017-08-23 14:06:24 +0100214/**
Paul Bakker5121ce52009-01-03 21:22:43 +0000215 * \brief RSA context structure
216 */
217typedef struct
218{
219 int ver; /*!< always 0 */
Paul Bakker23986e52011-04-24 08:57:21 +0000220 size_t len; /*!< size(N) in chars */
Paul Bakker5121ce52009-01-03 21:22:43 +0000221
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200222 mbedtls_mpi N; /*!< public modulus */
223 mbedtls_mpi E; /*!< public exponent */
Paul Bakker5121ce52009-01-03 21:22:43 +0000224
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200225 mbedtls_mpi D; /*!< private exponent */
226 mbedtls_mpi P; /*!< 1st prime factor */
227 mbedtls_mpi Q; /*!< 2nd prime factor */
Hanno Becker1a59e792017-08-23 07:41:10 +0100228
229#if !defined(MBEDTLS_RSA_NO_CRT)
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200230 mbedtls_mpi DP; /*!< D % (P - 1) */
231 mbedtls_mpi DQ; /*!< D % (Q - 1) */
232 mbedtls_mpi QP; /*!< 1 / (Q % P) */
Hanno Becker1a59e792017-08-23 07:41:10 +0100233#endif /* MBEDTLS_RSA_NO_CRT */
Paul Bakker5121ce52009-01-03 21:22:43 +0000234
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200235 mbedtls_mpi RN; /*!< cached R^2 mod N */
Hanno Becker1a59e792017-08-23 07:41:10 +0100236
237#if !defined(MBEDTLS_RSA_NO_CRT)
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200238 mbedtls_mpi RP; /*!< cached R^2 mod P */
239 mbedtls_mpi RQ; /*!< cached R^2 mod Q */
Hanno Becker1a59e792017-08-23 07:41:10 +0100240#endif /* MBEDTLS_RSA_NO_CRT */
Paul Bakker5121ce52009-01-03 21:22:43 +0000241
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200242 mbedtls_mpi Vi; /*!< cached blinding value */
243 mbedtls_mpi Vf; /*!< cached un-blinding value */
Manuel Pégourié-Gonnardea53a552013-09-10 13:29:30 +0200244
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200245 int padding; /*!< MBEDTLS_RSA_PKCS_V15 for 1.5 padding and
Hanno Becker8fd55482017-08-23 14:07:48 +0100246 MBEDTLS_RSA_PKCS_v21 for OAEP/PSS */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200247 int hash_id; /*!< Hash identifier of mbedtls_md_type_t as
248 specified in the mbedtls_md.h header file
Paul Bakker9dcc3222011-03-08 14:16:06 +0000249 for the EME-OAEP and EMSA-PSS
250 encoding */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200251#if defined(MBEDTLS_THREADING_C)
252 mbedtls_threading_mutex_t mutex; /*!< Thread-safety mutex */
Paul Bakkerc9965dc2013-09-29 14:58:17 +0200253#endif
Paul Bakker5121ce52009-01-03 21:22:43 +0000254}
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200255mbedtls_rsa_context;
Paul Bakker5121ce52009-01-03 21:22:43 +0000256
Hanno Beckerab377312017-08-23 16:24:51 +0100257#else
258
259#include "rsa_alt.h"
260
261#endif /* MBEDTLS_RSA_ALT */
262
Paul Bakker5121ce52009-01-03 21:22:43 +0000263/**
264 * \brief Initialize an RSA context
265 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200266 * Note: Set padding to MBEDTLS_RSA_PKCS_V21 for the RSAES-OAEP
Paul Bakker9a736322012-11-14 12:39:52 +0000267 * encryption scheme and the RSASSA-PSS signature scheme.
268 *
Paul Bakker5121ce52009-01-03 21:22:43 +0000269 * \param ctx RSA context to be initialized
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200270 * \param padding MBEDTLS_RSA_PKCS_V15 or MBEDTLS_RSA_PKCS_V21
271 * \param hash_id MBEDTLS_RSA_PKCS_V21 hash identifier
Paul Bakker5121ce52009-01-03 21:22:43 +0000272 *
273 * \note The hash_id parameter is actually ignored
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200274 * when using MBEDTLS_RSA_PKCS_V15 padding.
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200275 *
276 * \note Choice of padding mode is strictly enforced for private key
277 * operations, since there might be security concerns in
278 * mixing padding modes. For public key operations it's merely
279 * a default value, which can be overriden by calling specific
280 * rsa_rsaes_xxx or rsa_rsassa_xxx functions.
281 *
282 * \note The chosen hash is always used for OEAP encryption.
283 * For PSS signatures, it's always used for making signatures,
284 * but can be overriden (and always is, if set to
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200285 * MBEDTLS_MD_NONE) for verifying them.
Paul Bakker5121ce52009-01-03 21:22:43 +0000286 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200287void mbedtls_rsa_init( mbedtls_rsa_context *ctx,
Hanno Becker8fd55482017-08-23 14:07:48 +0100288 int padding,
289 int hash_id);
Paul Bakker5121ce52009-01-03 21:22:43 +0000290
Hanno Beckercbb59bc2017-08-23 14:11:08 +0100291
292/**
293 * \brief Import a set of core parameters into an RSA context
294 *
295 * \param ctx Initialized RSA context to store parameters
296 * \param N RSA modulus, or NULL
297 * \param P First prime factor of N, or NULL
298 * \param Q Second prime factor of N, or NULL
299 * \param D Private exponent, or NULL
300 * \param E Public exponent, or NULL
301 *
302 * \note This function can be called multiple times for successive
303 * imports if the parameters are not simultaneously present.
304 * Any sequence of calls to this function should be followed
305 * by a call to \c mbedtls_rsa_complete which will check
306 * and complete the provided information to a ready-for-use
307 * public or private RSA key.
308 *
309 * \return 0 if successful, non-zero error code on failure.
310 */
311int mbedtls_rsa_import( mbedtls_rsa_context *ctx,
312 const mbedtls_mpi *N,
313 const mbedtls_mpi *P, const mbedtls_mpi *Q,
314 const mbedtls_mpi *D, const mbedtls_mpi *E );
315
316/**
317 * \brief Import core RSA parameters in raw big-endian
318 * binary format into an RSA context
319 *
320 * \param ctx Initialized RSA context to store parameters
321 * \param N RSA modulus, or NULL
322 * \param N_len Byte length of N, ignored if N == NULL
323 * \param P First prime factor of N, or NULL
324 * \param P_len Byte length of P, ignored if P == NULL
325 * \param Q Second prime factor of N, or NULL
326 * \param Q_len Byte length of Q, ignored if Q == NULL
327 * \param D Private exponent, or NULL
328 * \param D_len Byte length of D, ignored if D == NULL
329 * \param E Public exponent, or NULL
330 * \param E_len Byte length of E, ignored if E == NULL
331 *
332 * \note This function can be called multiple times for successive
333 * imports if the parameters are not simultaneously present.
334 * Any sequence of calls to this function should be followed
335 * by a call to \c mbedtls_rsa_complete which will check
336 * and complete the provided information to a ready-for-use
337 * public or private RSA key.
338 *
339 * \return 0 if successful, non-zero error code on failure.
340 */
341
342int mbedtls_rsa_import_raw( mbedtls_rsa_context *ctx,
343 unsigned char *N, size_t N_len,
344 unsigned char *P, size_t P_len,
345 unsigned char *Q, size_t Q_len,
346 unsigned char *D, size_t D_len,
347 unsigned char *E, size_t E_len );
348
349/**
350 * \brief Attempt to complete an RSA context from
351 * a set of imported core parameters.
352 *
353 * \param ctx Initialized RSA context to store parameters
354 * \param f_rng RNG function,
355 * \param p_rng RNG parameter
356 *
357 * To setup an RSA public key, precisely N and E
358 * must have been imported.
359 *
360 * To setup an RSA private key, enough information must be
361 * present for the other parameters to be efficiently derivable.
362 *
363 * The default implementation supports the following:
364 * (a) Derive P, Q from N, D, E
365 * (b) Derive N, D from P, Q, E.
366 *
367 * Alternative implementations need not support these
368 * and may return MBEDTLS_ERR_RSA_BAD_INPUT_DATA instead.
369 *
370 * \note The PRNG is used for probabilistic algorithms
371 * like the derivation of P, Q from N, D, E, as
372 * well as primality checks.
373 *
374 * \return - 0 if successful. In this case, all core parameters
375 * as well as other internally needed parameters have
376 * been generated, and it is guaranteed that they are
377 * sane in the sense of \c mbedtls_rsa_check_params
378 * (with primality of P, Q checked if a PRNG is given).
379 * - MBEDTLS_ERR_RSA_BAD_INPUT_DATA if the attempted
380 * derivations failed.
381 */
382int mbedtls_rsa_complete( mbedtls_rsa_context *ctx,
383 int (*f_rng)(void *, unsigned char *, size_t),
384 void *p_rng );
385
386/**
387 * \brief Check if CRT-parameters match core parameters
388 *
389 * \param ctx Complete RSA private key context
390 * \param DP Private exponent modulo P-1, or NULL
391 * \param DQ Private exponent modulo Q-1, or NULL
392 * \param QP Modular inverse of Q modulo P, or NULL
393 *
394 * \return 0 if successful, testifying that the non-NULL optional
395 * parameters provided are in accordance with the core
396 * RSA parameters. Non-zero error code otherwise.
397 *
398 * \note This function performs in-place computations on the
399 * parameters DP, DQ and QP. If modification cannot be
400 * tolerated, you should make copies with mbedtls_mpi_copy
401 * before calling this function.
402 *
403 */
404int mbedtls_rsa_check_crt( mbedtls_rsa_context *ctx,
405 mbedtls_mpi *DP,
406 mbedtls_mpi *DQ,
407 mbedtls_mpi *QP );
408
409/**
410 * \brief Export core parameters of an RSA key
411 *
412 * \param ctx Initialized RSA context
413 * \param N MPI to hold the RSA modulus, or NULL
414 * \param P MPI to hold the first prime factor of N, or NULL
415 * \param Q MPI to hold the second prime factor of N, or NULL
416 * \param D MPI to hold the private exponent, or NULL
417 * \param E MPI to hold the public exponent, or NULL
418 *
419 * \return 0 if successful, non-zero error code otherwise.
420 *
421 */
422int mbedtls_rsa_export( const mbedtls_rsa_context *ctx,
423 mbedtls_mpi *N, mbedtls_mpi *P, mbedtls_mpi *Q,
424 mbedtls_mpi *D, mbedtls_mpi *E );
425
426/**
427 * \brief Export core parameters of an RSA key
428 * in raw big-endian binary format
429 *
430 * \param ctx Initialized RSA context
431 * \param N Byte array to store the RSA modulus, or NULL
432 * \param N_len Size of buffer for modulus
433 * \param P Byte array to hold the first prime factor of N, or NULL
434 * \param P_len Size of buffer for first prime factor
435 * \param Q Byte array to hold the second prime factor of N, or NULL
436 * \param Q_len Size of buffer for second prime factor
437 * \param D Byte array to hold the private exponent, or NULL
438 * \param D_len Size of buffer for private exponent
439 * \param E Byte array to hold the public exponent, or NULL
440 * \param E_len Size of buffer for public exponent
441 *
442 * \note The length fields are ignored if the corresponding
443 * buffer pointers are NULL.
444 *
445 * \return 0 if successful. In this case, the non-NULL buffers
446 * pointed to by N, P, Q, D, E are fully written, with
447 * additional unused space filled leading by 0-bytes.
448 *
449 */
450int mbedtls_rsa_export_raw( const mbedtls_rsa_context *ctx,
451 unsigned char *N, size_t N_len,
452 unsigned char *P, size_t P_len,
453 unsigned char *Q, size_t Q_len,
454 unsigned char *D, size_t D_len,
455 unsigned char *E, size_t E_len );
456
457/**
458 * \brief Export CRT parameters of a private RSA key
459 *
460 * \param ctx Initialized RSA context
461 * \param DP MPI to hold D modulo P-1, or NULL
462 * \param DQ MPI to hold D modulo Q-1, or NULL
463 * \param QP MPI to hold modular inverse of Q modulo P, or NULL
464 *
465 * \return 0 if successful, non-zero error code otherwise.
466 *
467 * \note Alternative RSA implementations not using CRT-parameters
468 * internally can implement this function using based on
469 * \c mbedtls_rsa_deduce_opt.
470 *
471 */
472int mbedtls_rsa_export_crt( const mbedtls_rsa_context *ctx,
473 mbedtls_mpi *DP, mbedtls_mpi *DQ, mbedtls_mpi *QP );
474
Paul Bakker5121ce52009-01-03 21:22:43 +0000475/**
Manuel Pégourié-Gonnard844a4c02014-03-10 21:55:35 +0100476 * \brief Set padding for an already initialized RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200477 * See \c mbedtls_rsa_init() for details.
Manuel Pégourié-Gonnard844a4c02014-03-10 21:55:35 +0100478 *
479 * \param ctx RSA context to be set
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200480 * \param padding MBEDTLS_RSA_PKCS_V15 or MBEDTLS_RSA_PKCS_V21
481 * \param hash_id MBEDTLS_RSA_PKCS_V21 hash identifier
Manuel Pégourié-Gonnard844a4c02014-03-10 21:55:35 +0100482 */
Hanno Becker8fd55482017-08-23 14:07:48 +0100483void mbedtls_rsa_set_padding( mbedtls_rsa_context *ctx, int padding,
484 int hash_id);
Manuel Pégourié-Gonnard844a4c02014-03-10 21:55:35 +0100485
486/**
Hanno Beckercbb59bc2017-08-23 14:11:08 +0100487 * \brief Get length of RSA modulus in bytes
488 *
489 * \param ctx Initialized RSA context
490 *
491 * \return Length of RSA modulus, in bytes.
492 *
493 */
494size_t mbedtls_rsa_get_len( const mbedtls_rsa_context *ctx );
495
496/**
Paul Bakker5121ce52009-01-03 21:22:43 +0000497 * \brief Generate an RSA keypair
498 *
499 * \param ctx RSA context that will hold the key
Paul Bakker21eb2802010-08-16 11:10:02 +0000500 * \param f_rng RNG function
501 * \param p_rng RNG parameter
Paul Bakker5121ce52009-01-03 21:22:43 +0000502 * \param nbits size of the public key in bits
503 * \param exponent public exponent (e.g., 65537)
504 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200505 * \note mbedtls_rsa_init() must be called beforehand to setup
Paul Bakker21eb2802010-08-16 11:10:02 +0000506 * the RSA context.
Paul Bakker5121ce52009-01-03 21:22:43 +0000507 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200508 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000509 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200510int mbedtls_rsa_gen_key( mbedtls_rsa_context *ctx,
Hanno Becker8fd55482017-08-23 14:07:48 +0100511 int (*f_rng)(void *, unsigned char *, size_t),
512 void *p_rng,
513 unsigned int nbits, int exponent );
Paul Bakker5121ce52009-01-03 21:22:43 +0000514
515/**
Hanno Becker8fd55482017-08-23 14:07:48 +0100516 * \brief Check if a context contains an RSA public key
Paul Bakker5121ce52009-01-03 21:22:43 +0000517 *
518 * \param ctx RSA context to be checked
519 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200520 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000521 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200522int mbedtls_rsa_check_pubkey( const mbedtls_rsa_context *ctx );
Paul Bakker5121ce52009-01-03 21:22:43 +0000523
524/**
Hanno Becker8fd55482017-08-23 14:07:48 +0100525 * \brief Check if a context contains a complete
526 * and valid RSA private key.
Paul Bakker5121ce52009-01-03 21:22:43 +0000527 *
528 * \param ctx RSA context to be checked
529 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200530 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000531 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200532int mbedtls_rsa_check_privkey( const mbedtls_rsa_context *ctx );
Paul Bakker5121ce52009-01-03 21:22:43 +0000533
534/**
Manuel Pégourié-Gonnard2f8d1f92014-11-06 14:02:51 +0100535 * \brief Check a public-private RSA key pair.
536 * Check each of the contexts, and make sure they match.
537 *
538 * \param pub RSA context holding the public key
539 * \param prv RSA context holding the private key
540 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200541 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Manuel Pégourié-Gonnard2f8d1f92014-11-06 14:02:51 +0100542 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200543int mbedtls_rsa_check_pub_priv( const mbedtls_rsa_context *pub, const mbedtls_rsa_context *prv );
Manuel Pégourié-Gonnard2f8d1f92014-11-06 14:02:51 +0100544
545/**
Paul Bakker5121ce52009-01-03 21:22:43 +0000546 * \brief Do an RSA public key operation
547 *
548 * \param ctx RSA context
549 * \param input input buffer
550 * \param output output buffer
551 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200552 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000553 *
554 * \note This function does NOT take care of message
Brian J Murray2adecba2016-11-06 04:45:15 -0800555 * padding. Also, be sure to set input[0] = 0 or ensure that
Paul Bakker619467a2009-03-28 23:26:51 +0000556 * input is smaller than N.
Paul Bakker5121ce52009-01-03 21:22:43 +0000557 *
558 * \note The input and output buffers must be large
559 * enough (eg. 128 bytes if RSA-1024 is used).
560 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200561int mbedtls_rsa_public( mbedtls_rsa_context *ctx,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000562 const unsigned char *input,
Paul Bakker5121ce52009-01-03 21:22:43 +0000563 unsigned char *output );
564
565/**
566 * \brief Do an RSA private key operation
567 *
568 * \param ctx RSA context
Paul Bakker548957d2013-08-30 10:30:02 +0200569 * \param f_rng RNG function (Needed for blinding)
570 * \param p_rng RNG parameter
Paul Bakker5121ce52009-01-03 21:22:43 +0000571 * \param input input buffer
572 * \param output output buffer
573 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200574 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000575 *
576 * \note The input and output buffers must be large
577 * enough (eg. 128 bytes if RSA-1024 is used).
578 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200579int mbedtls_rsa_private( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200580 int (*f_rng)(void *, unsigned char *, size_t),
581 void *p_rng,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000582 const unsigned char *input,
Paul Bakker5121ce52009-01-03 21:22:43 +0000583 unsigned char *output );
584
585/**
Paul Bakkerb3869132013-02-28 17:21:01 +0100586 * \brief Generic wrapper to perform a PKCS#1 encryption using the
587 * mode from the context. Add the message padding, then do an
588 * RSA operation.
Paul Bakker5121ce52009-01-03 21:22:43 +0000589 *
590 * \param ctx RSA context
Paul Bakker548957d2013-08-30 10:30:02 +0200591 * \param f_rng RNG function (Needed for padding and PKCS#1 v2.1 encoding
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200592 * and MBEDTLS_RSA_PRIVATE)
Paul Bakker21eb2802010-08-16 11:10:02 +0000593 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200594 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakker592457c2009-04-01 19:01:43 +0000595 * \param ilen contains the plaintext length
Paul Bakker5121ce52009-01-03 21:22:43 +0000596 * \param input buffer holding the data to be encrypted
597 * \param output buffer that will hold the ciphertext
598 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200599 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000600 *
601 * \note The output buffer must be as large as the size
602 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
603 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200604int mbedtls_rsa_pkcs1_encrypt( mbedtls_rsa_context *ctx,
Paul Bakkera3d195c2011-11-27 21:07:34 +0000605 int (*f_rng)(void *, unsigned char *, size_t),
Paul Bakker21eb2802010-08-16 11:10:02 +0000606 void *p_rng,
Paul Bakker23986e52011-04-24 08:57:21 +0000607 int mode, size_t ilen,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000608 const unsigned char *input,
Paul Bakker5121ce52009-01-03 21:22:43 +0000609 unsigned char *output );
610
611/**
Paul Bakkerb3869132013-02-28 17:21:01 +0100612 * \brief Perform a PKCS#1 v1.5 encryption (RSAES-PKCS1-v1_5-ENCRYPT)
613 *
614 * \param ctx RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200615 * \param f_rng RNG function (Needed for padding and MBEDTLS_RSA_PRIVATE)
Paul Bakkerb3869132013-02-28 17:21:01 +0100616 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200617 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakkerb3869132013-02-28 17:21:01 +0100618 * \param ilen contains the plaintext length
619 * \param input buffer holding the data to be encrypted
620 * \param output buffer that will hold the ciphertext
621 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200622 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100623 *
624 * \note The output buffer must be as large as the size
625 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
626 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200627int mbedtls_rsa_rsaes_pkcs1_v15_encrypt( mbedtls_rsa_context *ctx,
Paul Bakkerb3869132013-02-28 17:21:01 +0100628 int (*f_rng)(void *, unsigned char *, size_t),
629 void *p_rng,
630 int mode, size_t ilen,
631 const unsigned char *input,
632 unsigned char *output );
633
634/**
635 * \brief Perform a PKCS#1 v2.1 OAEP encryption (RSAES-OAEP-ENCRYPT)
636 *
637 * \param ctx RSA context
Paul Bakker548957d2013-08-30 10:30:02 +0200638 * \param f_rng RNG function (Needed for padding and PKCS#1 v2.1 encoding
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200639 * and MBEDTLS_RSA_PRIVATE)
Paul Bakkerb3869132013-02-28 17:21:01 +0100640 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200641 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakkera43231c2013-02-28 17:33:49 +0100642 * \param label buffer holding the custom label to use
643 * \param label_len contains the label length
Paul Bakkerb3869132013-02-28 17:21:01 +0100644 * \param ilen contains the plaintext length
645 * \param input buffer holding the data to be encrypted
646 * \param output buffer that will hold the ciphertext
647 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200648 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100649 *
650 * \note The output buffer must be as large as the size
651 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
652 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200653int mbedtls_rsa_rsaes_oaep_encrypt( mbedtls_rsa_context *ctx,
Paul Bakkerb3869132013-02-28 17:21:01 +0100654 int (*f_rng)(void *, unsigned char *, size_t),
655 void *p_rng,
Paul Bakkera43231c2013-02-28 17:33:49 +0100656 int mode,
657 const unsigned char *label, size_t label_len,
658 size_t ilen,
Paul Bakkerb3869132013-02-28 17:21:01 +0100659 const unsigned char *input,
660 unsigned char *output );
661
662/**
663 * \brief Generic wrapper to perform a PKCS#1 decryption using the
664 * mode from the context. Do an RSA operation, then remove
665 * the message padding
Paul Bakker5121ce52009-01-03 21:22:43 +0000666 *
667 * \param ctx RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200668 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200669 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200670 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakker4d8ca702011-08-09 10:31:05 +0000671 * \param olen will contain the plaintext length
Paul Bakker5121ce52009-01-03 21:22:43 +0000672 * \param input buffer holding the encrypted data
673 * \param output buffer that will hold the plaintext
Paul Bakker23986e52011-04-24 08:57:21 +0000674 * \param output_max_len maximum length of the output buffer
Paul Bakker5121ce52009-01-03 21:22:43 +0000675 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200676 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000677 *
Hanno Becker248ae6d2017-05-04 11:27:39 +0100678 * \note The output buffer length \c output_max_len should be
679 * as large as the size ctx->len of ctx->N (eg. 128 bytes
680 * if RSA-1024 is used) to be able to hold an arbitrary
681 * decrypted message. If it is not large enough to hold
Hanno Beckercbb59bc2017-08-23 14:11:08 +0100682 * the decryption of the particular ciphertext provided,
Hanno Becker248ae6d2017-05-04 11:27:39 +0100683 * the function will return MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE.
684 *
685 * \note The input buffer must be as large as the size
686 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
Paul Bakker5121ce52009-01-03 21:22:43 +0000687 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200688int mbedtls_rsa_pkcs1_decrypt( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200689 int (*f_rng)(void *, unsigned char *, size_t),
690 void *p_rng,
Paul Bakker23986e52011-04-24 08:57:21 +0000691 int mode, size_t *olen,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000692 const unsigned char *input,
Paul Bakker060c5682009-01-12 21:48:39 +0000693 unsigned char *output,
Paul Bakker23986e52011-04-24 08:57:21 +0000694 size_t output_max_len );
Paul Bakker5121ce52009-01-03 21:22:43 +0000695
696/**
Paul Bakkerb3869132013-02-28 17:21:01 +0100697 * \brief Perform a PKCS#1 v1.5 decryption (RSAES-PKCS1-v1_5-DECRYPT)
698 *
699 * \param ctx RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200700 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200701 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200702 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakkerb3869132013-02-28 17:21:01 +0100703 * \param olen will contain the plaintext length
704 * \param input buffer holding the encrypted data
705 * \param output buffer that will hold the plaintext
706 * \param output_max_len maximum length of the output buffer
707 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200708 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100709 *
Hanno Becker248ae6d2017-05-04 11:27:39 +0100710 * \note The output buffer length \c output_max_len should be
711 * as large as the size ctx->len of ctx->N (eg. 128 bytes
712 * if RSA-1024 is used) to be able to hold an arbitrary
713 * decrypted message. If it is not large enough to hold
Hanno Beckercbb59bc2017-08-23 14:11:08 +0100714 * the decryption of the particular ciphertext provided,
Hanno Becker248ae6d2017-05-04 11:27:39 +0100715 * the function will return MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE.
716 *
717 * \note The input buffer must be as large as the size
718 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
Paul Bakkerb3869132013-02-28 17:21:01 +0100719 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200720int mbedtls_rsa_rsaes_pkcs1_v15_decrypt( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200721 int (*f_rng)(void *, unsigned char *, size_t),
722 void *p_rng,
Paul Bakkerb3869132013-02-28 17:21:01 +0100723 int mode, size_t *olen,
724 const unsigned char *input,
725 unsigned char *output,
726 size_t output_max_len );
727
728/**
729 * \brief Perform a PKCS#1 v2.1 OAEP decryption (RSAES-OAEP-DECRYPT)
730 *
731 * \param ctx RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200732 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200733 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200734 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakkera43231c2013-02-28 17:33:49 +0100735 * \param label buffer holding the custom label to use
736 * \param label_len contains the label length
Paul Bakkerb3869132013-02-28 17:21:01 +0100737 * \param olen will contain the plaintext length
738 * \param input buffer holding the encrypted data
739 * \param output buffer that will hold the plaintext
740 * \param output_max_len maximum length of the output buffer
741 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200742 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100743 *
Hanno Becker248ae6d2017-05-04 11:27:39 +0100744 * \note The output buffer length \c output_max_len should be
745 * as large as the size ctx->len of ctx->N (eg. 128 bytes
746 * if RSA-1024 is used) to be able to hold an arbitrary
747 * decrypted message. If it is not large enough to hold
Hanno Becker8fd55482017-08-23 14:07:48 +0100748 * the decryption of the particular ciphertext provided,
Hanno Becker248ae6d2017-05-04 11:27:39 +0100749 * the function will return MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE.
750 *
Hanno Becker8fd55482017-08-23 14:07:48 +0100751 * \note The input buffer must be as large as the size
Hanno Becker248ae6d2017-05-04 11:27:39 +0100752 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
Paul Bakkerb3869132013-02-28 17:21:01 +0100753 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200754int mbedtls_rsa_rsaes_oaep_decrypt( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200755 int (*f_rng)(void *, unsigned char *, size_t),
756 void *p_rng,
Paul Bakkera43231c2013-02-28 17:33:49 +0100757 int mode,
758 const unsigned char *label, size_t label_len,
759 size_t *olen,
Paul Bakkerb3869132013-02-28 17:21:01 +0100760 const unsigned char *input,
761 unsigned char *output,
762 size_t output_max_len );
763
764/**
765 * \brief Generic wrapper to perform a PKCS#1 signature using the
766 * mode from the context. Do a private RSA operation to sign
767 * a message digest
Paul Bakker5121ce52009-01-03 21:22:43 +0000768 *
769 * \param ctx RSA context
Paul Bakker548957d2013-08-30 10:30:02 +0200770 * \param f_rng RNG function (Needed for PKCS#1 v2.1 encoding and for
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200771 * MBEDTLS_RSA_PRIVATE)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000772 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200773 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
774 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
775 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakker5121ce52009-01-03 21:22:43 +0000776 * \param hash buffer holding the message digest
777 * \param sig buffer that will hold the ciphertext
778 *
779 * \return 0 if the signing operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200780 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000781 *
782 * \note The "sig" buffer must be as large as the size
783 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
Paul Bakker9dcc3222011-03-08 14:16:06 +0000784 *
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200785 * \note In case of PKCS#1 v2.1 encoding, see comments on
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200786 * \note \c mbedtls_rsa_rsassa_pss_sign() for details on md_alg and hash_id.
Paul Bakker5121ce52009-01-03 21:22:43 +0000787 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200788int mbedtls_rsa_pkcs1_sign( mbedtls_rsa_context *ctx,
Paul Bakkera3d195c2011-11-27 21:07:34 +0000789 int (*f_rng)(void *, unsigned char *, size_t),
Paul Bakker9dcc3222011-03-08 14:16:06 +0000790 void *p_rng,
Paul Bakker5121ce52009-01-03 21:22:43 +0000791 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200792 mbedtls_md_type_t md_alg,
Paul Bakker23986e52011-04-24 08:57:21 +0000793 unsigned int hashlen,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000794 const unsigned char *hash,
Paul Bakker5121ce52009-01-03 21:22:43 +0000795 unsigned char *sig );
796
797/**
Paul Bakkerb3869132013-02-28 17:21:01 +0100798 * \brief Perform a PKCS#1 v1.5 signature (RSASSA-PKCS1-v1_5-SIGN)
799 *
800 * \param ctx RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200801 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200802 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200803 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
804 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
805 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakkerb3869132013-02-28 17:21:01 +0100806 * \param hash buffer holding the message digest
807 * \param sig buffer that will hold the ciphertext
808 *
809 * \return 0 if the signing operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200810 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100811 *
812 * \note The "sig" buffer must be as large as the size
813 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
814 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200815int mbedtls_rsa_rsassa_pkcs1_v15_sign( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200816 int (*f_rng)(void *, unsigned char *, size_t),
817 void *p_rng,
Paul Bakkerb3869132013-02-28 17:21:01 +0100818 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200819 mbedtls_md_type_t md_alg,
Paul Bakkerb3869132013-02-28 17:21:01 +0100820 unsigned int hashlen,
821 const unsigned char *hash,
822 unsigned char *sig );
823
824/**
825 * \brief Perform a PKCS#1 v2.1 PSS signature (RSASSA-PSS-SIGN)
826 *
827 * \param ctx RSA context
Paul Bakker548957d2013-08-30 10:30:02 +0200828 * \param f_rng RNG function (Needed for PKCS#1 v2.1 encoding and for
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200829 * MBEDTLS_RSA_PRIVATE)
Paul Bakkerb3869132013-02-28 17:21:01 +0100830 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200831 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
832 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
833 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakkerb3869132013-02-28 17:21:01 +0100834 * \param hash buffer holding the message digest
835 * \param sig buffer that will hold the ciphertext
836 *
837 * \return 0 if the signing operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200838 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100839 *
840 * \note The "sig" buffer must be as large as the size
841 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
842 *
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200843 * \note The hash_id in the RSA context is the one used for the
844 * encoding. md_alg in the function call is the type of hash
Paul Bakkerb3869132013-02-28 17:21:01 +0100845 * that is encoded. According to RFC 3447 it is advised to
846 * keep both hashes the same.
847 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200848int mbedtls_rsa_rsassa_pss_sign( mbedtls_rsa_context *ctx,
Paul Bakkerb3869132013-02-28 17:21:01 +0100849 int (*f_rng)(void *, unsigned char *, size_t),
850 void *p_rng,
851 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200852 mbedtls_md_type_t md_alg,
Paul Bakkerb3869132013-02-28 17:21:01 +0100853 unsigned int hashlen,
854 const unsigned char *hash,
855 unsigned char *sig );
856
857/**
858 * \brief Generic wrapper to perform a PKCS#1 verification using the
859 * mode from the context. Do a public RSA operation and check
860 * the message digest
Paul Bakker5121ce52009-01-03 21:22:43 +0000861 *
862 * \param ctx points to an RSA public key
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200863 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200864 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200865 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
866 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
867 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakker5121ce52009-01-03 21:22:43 +0000868 * \param hash buffer holding the message digest
869 * \param sig buffer holding the ciphertext
870 *
871 * \return 0 if the verify operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200872 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000873 *
874 * \note The "sig" buffer must be as large as the size
875 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
Paul Bakker9dcc3222011-03-08 14:16:06 +0000876 *
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200877 * \note In case of PKCS#1 v2.1 encoding, see comments on
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200878 * \c mbedtls_rsa_rsassa_pss_verify() about md_alg and hash_id.
Paul Bakker5121ce52009-01-03 21:22:43 +0000879 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200880int mbedtls_rsa_pkcs1_verify( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200881 int (*f_rng)(void *, unsigned char *, size_t),
882 void *p_rng,
Paul Bakker5121ce52009-01-03 21:22:43 +0000883 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200884 mbedtls_md_type_t md_alg,
Paul Bakker23986e52011-04-24 08:57:21 +0000885 unsigned int hashlen,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000886 const unsigned char *hash,
Manuel Pégourié-Gonnardcc0a9d02013-08-12 11:34:35 +0200887 const unsigned char *sig );
Paul Bakker5121ce52009-01-03 21:22:43 +0000888
889/**
Paul Bakkerb3869132013-02-28 17:21:01 +0100890 * \brief Perform a PKCS#1 v1.5 verification (RSASSA-PKCS1-v1_5-VERIFY)
891 *
892 * \param ctx points to an RSA public key
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200893 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200894 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200895 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
896 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
897 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakkerb3869132013-02-28 17:21:01 +0100898 * \param hash buffer holding the message digest
899 * \param sig buffer holding the ciphertext
900 *
901 * \return 0 if the verify operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200902 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100903 *
904 * \note The "sig" buffer must be as large as the size
905 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
906 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200907int mbedtls_rsa_rsassa_pkcs1_v15_verify( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200908 int (*f_rng)(void *, unsigned char *, size_t),
909 void *p_rng,
Paul Bakkerb3869132013-02-28 17:21:01 +0100910 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200911 mbedtls_md_type_t md_alg,
Paul Bakkerb3869132013-02-28 17:21:01 +0100912 unsigned int hashlen,
913 const unsigned char *hash,
Manuel Pégourié-Gonnardcc0a9d02013-08-12 11:34:35 +0200914 const unsigned char *sig );
Paul Bakkerb3869132013-02-28 17:21:01 +0100915
916/**
917 * \brief Perform a PKCS#1 v2.1 PSS verification (RSASSA-PSS-VERIFY)
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200918 * (This is the "simple" version.)
Paul Bakkerb3869132013-02-28 17:21:01 +0100919 *
920 * \param ctx points to an RSA public key
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200921 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200922 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200923 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
924 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
925 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakkerb3869132013-02-28 17:21:01 +0100926 * \param hash buffer holding the message digest
927 * \param sig buffer holding the ciphertext
928 *
929 * \return 0 if the verify operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200930 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100931 *
932 * \note The "sig" buffer must be as large as the size
933 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
934 *
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200935 * \note The hash_id in the RSA context is the one used for the
936 * verification. md_alg in the function call is the type of
Paul Bakkerb9e4e2c2014-05-01 14:18:25 +0200937 * hash that is verified. According to RFC 3447 it is advised to
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200938 * keep both hashes the same. If hash_id in the RSA context is
939 * unset, the md_alg from the function call is used.
Paul Bakkerb3869132013-02-28 17:21:01 +0100940 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200941int mbedtls_rsa_rsassa_pss_verify( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200942 int (*f_rng)(void *, unsigned char *, size_t),
943 void *p_rng,
Paul Bakkerb3869132013-02-28 17:21:01 +0100944 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200945 mbedtls_md_type_t md_alg,
Paul Bakkerb3869132013-02-28 17:21:01 +0100946 unsigned int hashlen,
947 const unsigned char *hash,
Manuel Pégourié-Gonnardcc0a9d02013-08-12 11:34:35 +0200948 const unsigned char *sig );
Paul Bakkerb3869132013-02-28 17:21:01 +0100949
950/**
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200951 * \brief Perform a PKCS#1 v2.1 PSS verification (RSASSA-PSS-VERIFY)
952 * (This is the version with "full" options.)
953 *
954 * \param ctx points to an RSA public key
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200955 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200956 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200957 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
958 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
959 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200960 * \param hash buffer holding the message digest
961 * \param mgf1_hash_id message digest used for mask generation
962 * \param expected_salt_len Length of the salt used in padding, use
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200963 * MBEDTLS_RSA_SALT_LEN_ANY to accept any salt length
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200964 * \param sig buffer holding the ciphertext
965 *
966 * \return 0 if the verify operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200967 * or an MBEDTLS_ERR_RSA_XXX error code
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200968 *
969 * \note The "sig" buffer must be as large as the size
970 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
971 *
972 * \note The hash_id in the RSA context is ignored.
973 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200974int mbedtls_rsa_rsassa_pss_verify_ext( mbedtls_rsa_context *ctx,
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200975 int (*f_rng)(void *, unsigned char *, size_t),
976 void *p_rng,
977 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200978 mbedtls_md_type_t md_alg,
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200979 unsigned int hashlen,
980 const unsigned char *hash,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200981 mbedtls_md_type_t mgf1_hash_id,
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200982 int expected_salt_len,
983 const unsigned char *sig );
984
985/**
Manuel Pégourié-Gonnard3053f5b2013-08-14 13:39:57 +0200986 * \brief Copy the components of an RSA context
987 *
988 * \param dst Destination context
989 * \param src Source context
990 *
Manuel Pégourié-Gonnard81abefd2015-05-29 12:53:47 +0200991 * \return 0 on success,
Manuel Pégourié-Gonnard6a8ca332015-05-28 09:33:39 +0200992 * MBEDTLS_ERR_MPI_ALLOC_FAILED on memory allocation failure
Manuel Pégourié-Gonnard3053f5b2013-08-14 13:39:57 +0200993 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200994int mbedtls_rsa_copy( mbedtls_rsa_context *dst, const mbedtls_rsa_context *src );
Manuel Pégourié-Gonnard3053f5b2013-08-14 13:39:57 +0200995
996/**
Paul Bakker5121ce52009-01-03 21:22:43 +0000997 * \brief Free the components of an RSA key
Paul Bakker13e2dfe2009-07-28 07:18:38 +0000998 *
999 * \param ctx RSA Context to free
Paul Bakker5121ce52009-01-03 21:22:43 +00001000 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02001001void mbedtls_rsa_free( mbedtls_rsa_context *ctx );
Paul Bakker5121ce52009-01-03 21:22:43 +00001002
1003/**
1004 * \brief Checkup routine
1005 *
1006 * \return 0 if successful, or 1 if the test failed
1007 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02001008int mbedtls_rsa_self_test( int verbose );
Paul Bakker5121ce52009-01-03 21:22:43 +00001009
1010#ifdef __cplusplus
1011}
1012#endif
1013
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02001014#endif /* MBEDTLS_RSA_C */
Paul Bakkered27a042013-04-18 22:46:23 +02001015
Paul Bakker5121ce52009-01-03 21:22:43 +00001016#endif /* rsa.h */