blob: 90c667b5beebc86868131f101cd6d9a14b9475f8 [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
Hanno Becker750e8b42017-08-25 07:54:27 +0100189 * - A non-zero error code otherwise.
Hanno Beckera3ebec22017-08-23 14:06:24 +0100190 *
191 * \note The function can be used with a restricted set of arguments
192 * to perform specific checks only. E.g., calling it with
193 * (-,P,-,-,-) and a PRNG amounts to a primality check for P.
Hanno Beckera3ebec22017-08-23 14:06:24 +0100194 */
Hanno Becker750e8b42017-08-25 07:54:27 +0100195int mbedtls_rsa_validate_params( const mbedtls_mpi *N, const mbedtls_mpi *P,
196 const mbedtls_mpi *Q, const mbedtls_mpi *D,
197 const mbedtls_mpi *E,
198 int (*f_rng)(void *, unsigned char *, size_t),
199 void *p_rng );
Hanno Beckera3ebec22017-08-23 14:06:24 +0100200
201/**
202 * Implementation of RSA interface
203 */
204
Hanno Beckerab377312017-08-23 16:24:51 +0100205#if !defined(MBEDTLS_RSA_ALT)
206
Hanno Beckera3ebec22017-08-23 14:06:24 +0100207/**
Paul Bakker5121ce52009-01-03 21:22:43 +0000208 * \brief RSA context structure
209 */
210typedef struct
211{
212 int ver; /*!< always 0 */
Paul Bakker23986e52011-04-24 08:57:21 +0000213 size_t len; /*!< size(N) in chars */
Paul Bakker5121ce52009-01-03 21:22:43 +0000214
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200215 mbedtls_mpi N; /*!< public modulus */
216 mbedtls_mpi E; /*!< public exponent */
Paul Bakker5121ce52009-01-03 21:22:43 +0000217
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200218 mbedtls_mpi D; /*!< private exponent */
219 mbedtls_mpi P; /*!< 1st prime factor */
220 mbedtls_mpi Q; /*!< 2nd prime factor */
Hanno Becker1a59e792017-08-23 07:41:10 +0100221
222#if !defined(MBEDTLS_RSA_NO_CRT)
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200223 mbedtls_mpi DP; /*!< D % (P - 1) */
224 mbedtls_mpi DQ; /*!< D % (Q - 1) */
225 mbedtls_mpi QP; /*!< 1 / (Q % P) */
Hanno Becker1a59e792017-08-23 07:41:10 +0100226#endif /* MBEDTLS_RSA_NO_CRT */
Paul Bakker5121ce52009-01-03 21:22:43 +0000227
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200228 mbedtls_mpi RN; /*!< cached R^2 mod N */
Hanno Becker1a59e792017-08-23 07:41:10 +0100229
230#if !defined(MBEDTLS_RSA_NO_CRT)
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200231 mbedtls_mpi RP; /*!< cached R^2 mod P */
232 mbedtls_mpi RQ; /*!< cached R^2 mod Q */
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 Vi; /*!< cached blinding value */
236 mbedtls_mpi Vf; /*!< cached un-blinding value */
Manuel Pégourié-Gonnardea53a552013-09-10 13:29:30 +0200237
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200238 int padding; /*!< MBEDTLS_RSA_PKCS_V15 for 1.5 padding and
Hanno Becker8fd55482017-08-23 14:07:48 +0100239 MBEDTLS_RSA_PKCS_v21 for OAEP/PSS */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200240 int hash_id; /*!< Hash identifier of mbedtls_md_type_t as
241 specified in the mbedtls_md.h header file
Paul Bakker9dcc3222011-03-08 14:16:06 +0000242 for the EME-OAEP and EMSA-PSS
243 encoding */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200244#if defined(MBEDTLS_THREADING_C)
245 mbedtls_threading_mutex_t mutex; /*!< Thread-safety mutex */
Paul Bakkerc9965dc2013-09-29 14:58:17 +0200246#endif
Paul Bakker5121ce52009-01-03 21:22:43 +0000247}
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200248mbedtls_rsa_context;
Paul Bakker5121ce52009-01-03 21:22:43 +0000249
Hanno Beckerab377312017-08-23 16:24:51 +0100250#else
251
252#include "rsa_alt.h"
253
254#endif /* MBEDTLS_RSA_ALT */
255
Paul Bakker5121ce52009-01-03 21:22:43 +0000256/**
257 * \brief Initialize an RSA context
258 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200259 * Note: Set padding to MBEDTLS_RSA_PKCS_V21 for the RSAES-OAEP
Paul Bakker9a736322012-11-14 12:39:52 +0000260 * encryption scheme and the RSASSA-PSS signature scheme.
261 *
Paul Bakker5121ce52009-01-03 21:22:43 +0000262 * \param ctx RSA context to be initialized
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200263 * \param padding MBEDTLS_RSA_PKCS_V15 or MBEDTLS_RSA_PKCS_V21
264 * \param hash_id MBEDTLS_RSA_PKCS_V21 hash identifier
Paul Bakker5121ce52009-01-03 21:22:43 +0000265 *
266 * \note The hash_id parameter is actually ignored
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200267 * when using MBEDTLS_RSA_PKCS_V15 padding.
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200268 *
269 * \note Choice of padding mode is strictly enforced for private key
270 * operations, since there might be security concerns in
271 * mixing padding modes. For public key operations it's merely
272 * a default value, which can be overriden by calling specific
273 * rsa_rsaes_xxx or rsa_rsassa_xxx functions.
274 *
275 * \note The chosen hash is always used for OEAP encryption.
276 * For PSS signatures, it's always used for making signatures,
277 * but can be overriden (and always is, if set to
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200278 * MBEDTLS_MD_NONE) for verifying them.
Paul Bakker5121ce52009-01-03 21:22:43 +0000279 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200280void mbedtls_rsa_init( mbedtls_rsa_context *ctx,
Hanno Becker8fd55482017-08-23 14:07:48 +0100281 int padding,
282 int hash_id);
Paul Bakker5121ce52009-01-03 21:22:43 +0000283
Hanno Beckercbb59bc2017-08-23 14:11:08 +0100284
285/**
286 * \brief Import a set of core parameters into an RSA context
287 *
288 * \param ctx Initialized RSA context to store parameters
289 * \param N RSA modulus, or NULL
290 * \param P First prime factor of N, or NULL
291 * \param Q Second prime factor of N, or NULL
292 * \param D Private exponent, or NULL
293 * \param E Public exponent, or NULL
294 *
295 * \note This function can be called multiple times for successive
296 * imports if the parameters are not simultaneously present.
297 * Any sequence of calls to this function should be followed
298 * by a call to \c mbedtls_rsa_complete which will check
299 * and complete the provided information to a ready-for-use
300 * public or private RSA key.
301 *
302 * \return 0 if successful, non-zero error code on failure.
303 */
304int mbedtls_rsa_import( mbedtls_rsa_context *ctx,
305 const mbedtls_mpi *N,
306 const mbedtls_mpi *P, const mbedtls_mpi *Q,
307 const mbedtls_mpi *D, const mbedtls_mpi *E );
308
309/**
310 * \brief Import core RSA parameters in raw big-endian
311 * binary format into an RSA context
312 *
313 * \param ctx Initialized RSA context to store parameters
314 * \param N RSA modulus, or NULL
315 * \param N_len Byte length of N, ignored if N == NULL
316 * \param P First prime factor of N, or NULL
317 * \param P_len Byte length of P, ignored if P == NULL
318 * \param Q Second prime factor of N, or NULL
319 * \param Q_len Byte length of Q, ignored if Q == NULL
320 * \param D Private exponent, or NULL
321 * \param D_len Byte length of D, ignored if D == NULL
322 * \param E Public exponent, or NULL
323 * \param E_len Byte length of E, ignored if E == NULL
324 *
325 * \note This function can be called multiple times for successive
326 * imports if the parameters are not simultaneously present.
327 * Any sequence of calls to this function should be followed
328 * by a call to \c mbedtls_rsa_complete which will check
329 * and complete the provided information to a ready-for-use
330 * public or private RSA key.
331 *
332 * \return 0 if successful, non-zero error code on failure.
333 */
334
335int mbedtls_rsa_import_raw( mbedtls_rsa_context *ctx,
336 unsigned char *N, size_t N_len,
337 unsigned char *P, size_t P_len,
338 unsigned char *Q, size_t Q_len,
339 unsigned char *D, size_t D_len,
340 unsigned char *E, size_t E_len );
341
342/**
343 * \brief Attempt to complete an RSA context from
344 * a set of imported core parameters.
345 *
346 * \param ctx Initialized RSA context to store parameters
347 * \param f_rng RNG function,
348 * \param p_rng RNG parameter
349 *
350 * To setup an RSA public key, precisely N and E
351 * must have been imported.
352 *
353 * To setup an RSA private key, enough information must be
354 * present for the other parameters to be efficiently derivable.
355 *
356 * The default implementation supports the following:
357 * (a) Derive P, Q from N, D, E
358 * (b) Derive N, D from P, Q, E.
359 *
360 * Alternative implementations need not support these
361 * and may return MBEDTLS_ERR_RSA_BAD_INPUT_DATA instead.
362 *
363 * \note The PRNG is used for probabilistic algorithms
364 * like the derivation of P, Q from N, D, E, as
365 * well as primality checks.
366 *
367 * \return - 0 if successful. In this case, all core parameters
368 * as well as other internally needed parameters have
369 * been generated, and it is guaranteed that they are
Hanno Becker750e8b42017-08-25 07:54:27 +0100370 * sane in the sense of \c mbedtls_rsa_validate_params
Hanno Beckercbb59bc2017-08-23 14:11:08 +0100371 * (with primality of P, Q checked if a PRNG is given).
372 * - MBEDTLS_ERR_RSA_BAD_INPUT_DATA if the attempted
373 * derivations failed.
374 */
375int mbedtls_rsa_complete( mbedtls_rsa_context *ctx,
376 int (*f_rng)(void *, unsigned char *, size_t),
377 void *p_rng );
378
379/**
380 * \brief Check if CRT-parameters match core parameters
381 *
382 * \param ctx Complete RSA private key context
383 * \param DP Private exponent modulo P-1, or NULL
384 * \param DQ Private exponent modulo Q-1, or NULL
385 * \param QP Modular inverse of Q modulo P, or NULL
386 *
387 * \return 0 if successful, testifying that the non-NULL optional
388 * parameters provided are in accordance with the core
389 * RSA parameters. Non-zero error code otherwise.
390 *
391 * \note This function performs in-place computations on the
392 * parameters DP, DQ and QP. If modification cannot be
393 * tolerated, you should make copies with mbedtls_mpi_copy
394 * before calling this function.
395 *
396 */
397int mbedtls_rsa_check_crt( mbedtls_rsa_context *ctx,
398 mbedtls_mpi *DP,
399 mbedtls_mpi *DQ,
400 mbedtls_mpi *QP );
401
402/**
403 * \brief Export core parameters of an RSA key
404 *
405 * \param ctx Initialized RSA context
406 * \param N MPI to hold the RSA modulus, or NULL
407 * \param P MPI to hold the first prime factor of N, or NULL
408 * \param Q MPI to hold the second prime factor of N, or NULL
409 * \param D MPI to hold the private exponent, or NULL
410 * \param E MPI to hold the public exponent, or NULL
411 *
412 * \return 0 if successful, non-zero error code otherwise.
413 *
414 */
415int mbedtls_rsa_export( const mbedtls_rsa_context *ctx,
416 mbedtls_mpi *N, mbedtls_mpi *P, mbedtls_mpi *Q,
417 mbedtls_mpi *D, mbedtls_mpi *E );
418
419/**
420 * \brief Export core parameters of an RSA key
421 * in raw big-endian binary format
422 *
423 * \param ctx Initialized RSA context
424 * \param N Byte array to store the RSA modulus, or NULL
425 * \param N_len Size of buffer for modulus
426 * \param P Byte array to hold the first prime factor of N, or NULL
427 * \param P_len Size of buffer for first prime factor
428 * \param Q Byte array to hold the second prime factor of N, or NULL
429 * \param Q_len Size of buffer for second prime factor
430 * \param D Byte array to hold the private exponent, or NULL
431 * \param D_len Size of buffer for private exponent
432 * \param E Byte array to hold the public exponent, or NULL
433 * \param E_len Size of buffer for public exponent
434 *
435 * \note The length fields are ignored if the corresponding
436 * buffer pointers are NULL.
437 *
438 * \return 0 if successful. In this case, the non-NULL buffers
439 * pointed to by N, P, Q, D, E are fully written, with
440 * additional unused space filled leading by 0-bytes.
441 *
442 */
443int mbedtls_rsa_export_raw( const mbedtls_rsa_context *ctx,
444 unsigned char *N, size_t N_len,
445 unsigned char *P, size_t P_len,
446 unsigned char *Q, size_t Q_len,
447 unsigned char *D, size_t D_len,
448 unsigned char *E, size_t E_len );
449
450/**
451 * \brief Export CRT parameters of a private RSA key
452 *
453 * \param ctx Initialized RSA context
454 * \param DP MPI to hold D modulo P-1, or NULL
455 * \param DQ MPI to hold D modulo Q-1, or NULL
456 * \param QP MPI to hold modular inverse of Q modulo P, or NULL
457 *
458 * \return 0 if successful, non-zero error code otherwise.
459 *
460 * \note Alternative RSA implementations not using CRT-parameters
461 * internally can implement this function using based on
462 * \c mbedtls_rsa_deduce_opt.
463 *
464 */
465int mbedtls_rsa_export_crt( const mbedtls_rsa_context *ctx,
466 mbedtls_mpi *DP, mbedtls_mpi *DQ, mbedtls_mpi *QP );
467
Paul Bakker5121ce52009-01-03 21:22:43 +0000468/**
Manuel Pégourié-Gonnard844a4c02014-03-10 21:55:35 +0100469 * \brief Set padding for an already initialized RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200470 * See \c mbedtls_rsa_init() for details.
Manuel Pégourié-Gonnard844a4c02014-03-10 21:55:35 +0100471 *
472 * \param ctx RSA context to be set
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200473 * \param padding MBEDTLS_RSA_PKCS_V15 or MBEDTLS_RSA_PKCS_V21
474 * \param hash_id MBEDTLS_RSA_PKCS_V21 hash identifier
Manuel Pégourié-Gonnard844a4c02014-03-10 21:55:35 +0100475 */
Hanno Becker8fd55482017-08-23 14:07:48 +0100476void mbedtls_rsa_set_padding( mbedtls_rsa_context *ctx, int padding,
477 int hash_id);
Manuel Pégourié-Gonnard844a4c02014-03-10 21:55:35 +0100478
479/**
Hanno Beckercbb59bc2017-08-23 14:11:08 +0100480 * \brief Get length of RSA modulus in bytes
481 *
482 * \param ctx Initialized RSA context
483 *
484 * \return Length of RSA modulus, in bytes.
485 *
486 */
487size_t mbedtls_rsa_get_len( const mbedtls_rsa_context *ctx );
488
489/**
Paul Bakker5121ce52009-01-03 21:22:43 +0000490 * \brief Generate an RSA keypair
491 *
492 * \param ctx RSA context that will hold the key
Paul Bakker21eb2802010-08-16 11:10:02 +0000493 * \param f_rng RNG function
494 * \param p_rng RNG parameter
Paul Bakker5121ce52009-01-03 21:22:43 +0000495 * \param nbits size of the public key in bits
496 * \param exponent public exponent (e.g., 65537)
497 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200498 * \note mbedtls_rsa_init() must be called beforehand to setup
Paul Bakker21eb2802010-08-16 11:10:02 +0000499 * the RSA context.
Paul Bakker5121ce52009-01-03 21:22:43 +0000500 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200501 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000502 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200503int mbedtls_rsa_gen_key( mbedtls_rsa_context *ctx,
Hanno Becker8fd55482017-08-23 14:07:48 +0100504 int (*f_rng)(void *, unsigned char *, size_t),
505 void *p_rng,
506 unsigned int nbits, int exponent );
Paul Bakker5121ce52009-01-03 21:22:43 +0000507
508/**
Hanno Becker8fd55482017-08-23 14:07:48 +0100509 * \brief Check if a context contains an RSA public key
Paul Bakker5121ce52009-01-03 21:22:43 +0000510 *
511 * \param ctx RSA context to be checked
512 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200513 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000514 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200515int mbedtls_rsa_check_pubkey( const mbedtls_rsa_context *ctx );
Paul Bakker5121ce52009-01-03 21:22:43 +0000516
517/**
Hanno Becker8fd55482017-08-23 14:07:48 +0100518 * \brief Check if a context contains a complete
519 * and valid RSA private key.
Paul Bakker5121ce52009-01-03 21:22:43 +0000520 *
521 * \param ctx RSA context to be checked
522 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200523 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000524 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200525int mbedtls_rsa_check_privkey( const mbedtls_rsa_context *ctx );
Paul Bakker5121ce52009-01-03 21:22:43 +0000526
527/**
Manuel Pégourié-Gonnard2f8d1f92014-11-06 14:02:51 +0100528 * \brief Check a public-private RSA key pair.
529 * Check each of the contexts, and make sure they match.
530 *
531 * \param pub RSA context holding the public key
532 * \param prv RSA context holding the private key
533 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200534 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Manuel Pégourié-Gonnard2f8d1f92014-11-06 14:02:51 +0100535 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200536int mbedtls_rsa_check_pub_priv( const mbedtls_rsa_context *pub, const mbedtls_rsa_context *prv );
Manuel Pégourié-Gonnard2f8d1f92014-11-06 14:02:51 +0100537
538/**
Paul Bakker5121ce52009-01-03 21:22:43 +0000539 * \brief Do an RSA public key operation
540 *
541 * \param ctx RSA context
542 * \param input input buffer
543 * \param output output buffer
544 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200545 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000546 *
547 * \note This function does NOT take care of message
Brian J Murray2adecba2016-11-06 04:45:15 -0800548 * padding. Also, be sure to set input[0] = 0 or ensure that
Paul Bakker619467a2009-03-28 23:26:51 +0000549 * input is smaller than N.
Paul Bakker5121ce52009-01-03 21:22:43 +0000550 *
551 * \note The input and output buffers must be large
552 * enough (eg. 128 bytes if RSA-1024 is used).
553 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200554int mbedtls_rsa_public( mbedtls_rsa_context *ctx,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000555 const unsigned char *input,
Paul Bakker5121ce52009-01-03 21:22:43 +0000556 unsigned char *output );
557
558/**
559 * \brief Do an RSA private key operation
560 *
561 * \param ctx RSA context
Paul Bakker548957d2013-08-30 10:30:02 +0200562 * \param f_rng RNG function (Needed for blinding)
563 * \param p_rng RNG parameter
Paul Bakker5121ce52009-01-03 21:22:43 +0000564 * \param input input buffer
565 * \param output output buffer
566 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200567 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000568 *
569 * \note The input and output buffers must be large
570 * enough (eg. 128 bytes if RSA-1024 is used).
571 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200572int mbedtls_rsa_private( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200573 int (*f_rng)(void *, unsigned char *, size_t),
574 void *p_rng,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000575 const unsigned char *input,
Paul Bakker5121ce52009-01-03 21:22:43 +0000576 unsigned char *output );
577
578/**
Paul Bakkerb3869132013-02-28 17:21:01 +0100579 * \brief Generic wrapper to perform a PKCS#1 encryption using the
580 * mode from the context. Add the message padding, then do an
581 * RSA operation.
Paul Bakker5121ce52009-01-03 21:22:43 +0000582 *
583 * \param ctx RSA context
Paul Bakker548957d2013-08-30 10:30:02 +0200584 * \param f_rng RNG function (Needed for padding and PKCS#1 v2.1 encoding
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200585 * and MBEDTLS_RSA_PRIVATE)
Paul Bakker21eb2802010-08-16 11:10:02 +0000586 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200587 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakker592457c2009-04-01 19:01:43 +0000588 * \param ilen contains the plaintext length
Paul Bakker5121ce52009-01-03 21:22:43 +0000589 * \param input buffer holding the data to be encrypted
590 * \param output buffer that will hold the ciphertext
591 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200592 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000593 *
594 * \note The output buffer must be as large as the size
595 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
596 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200597int mbedtls_rsa_pkcs1_encrypt( mbedtls_rsa_context *ctx,
Paul Bakkera3d195c2011-11-27 21:07:34 +0000598 int (*f_rng)(void *, unsigned char *, size_t),
Paul Bakker21eb2802010-08-16 11:10:02 +0000599 void *p_rng,
Paul Bakker23986e52011-04-24 08:57:21 +0000600 int mode, size_t ilen,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000601 const unsigned char *input,
Paul Bakker5121ce52009-01-03 21:22:43 +0000602 unsigned char *output );
603
604/**
Paul Bakkerb3869132013-02-28 17:21:01 +0100605 * \brief Perform a PKCS#1 v1.5 encryption (RSAES-PKCS1-v1_5-ENCRYPT)
606 *
607 * \param ctx RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200608 * \param f_rng RNG function (Needed for padding and MBEDTLS_RSA_PRIVATE)
Paul Bakkerb3869132013-02-28 17:21:01 +0100609 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200610 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakkerb3869132013-02-28 17:21:01 +0100611 * \param ilen contains the plaintext length
612 * \param input buffer holding the data to be encrypted
613 * \param output buffer that will hold the ciphertext
614 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200615 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100616 *
617 * \note The output buffer must be as large as the size
618 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
619 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200620int mbedtls_rsa_rsaes_pkcs1_v15_encrypt( mbedtls_rsa_context *ctx,
Paul Bakkerb3869132013-02-28 17:21:01 +0100621 int (*f_rng)(void *, unsigned char *, size_t),
622 void *p_rng,
623 int mode, size_t ilen,
624 const unsigned char *input,
625 unsigned char *output );
626
627/**
628 * \brief Perform a PKCS#1 v2.1 OAEP encryption (RSAES-OAEP-ENCRYPT)
629 *
630 * \param ctx RSA context
Paul Bakker548957d2013-08-30 10:30:02 +0200631 * \param f_rng RNG function (Needed for padding and PKCS#1 v2.1 encoding
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200632 * and MBEDTLS_RSA_PRIVATE)
Paul Bakkerb3869132013-02-28 17:21:01 +0100633 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200634 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakkera43231c2013-02-28 17:33:49 +0100635 * \param label buffer holding the custom label to use
636 * \param label_len contains the label length
Paul Bakkerb3869132013-02-28 17:21:01 +0100637 * \param ilen contains the plaintext length
638 * \param input buffer holding the data to be encrypted
639 * \param output buffer that will hold the ciphertext
640 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200641 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100642 *
643 * \note The output buffer must be as large as the size
644 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
645 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200646int mbedtls_rsa_rsaes_oaep_encrypt( mbedtls_rsa_context *ctx,
Paul Bakkerb3869132013-02-28 17:21:01 +0100647 int (*f_rng)(void *, unsigned char *, size_t),
648 void *p_rng,
Paul Bakkera43231c2013-02-28 17:33:49 +0100649 int mode,
650 const unsigned char *label, size_t label_len,
651 size_t ilen,
Paul Bakkerb3869132013-02-28 17:21:01 +0100652 const unsigned char *input,
653 unsigned char *output );
654
655/**
656 * \brief Generic wrapper to perform a PKCS#1 decryption using the
657 * mode from the context. Do an RSA operation, then remove
658 * the message padding
Paul Bakker5121ce52009-01-03 21:22:43 +0000659 *
660 * \param ctx RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200661 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200662 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200663 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakker4d8ca702011-08-09 10:31:05 +0000664 * \param olen will contain the plaintext length
Paul Bakker5121ce52009-01-03 21:22:43 +0000665 * \param input buffer holding the encrypted data
666 * \param output buffer that will hold the plaintext
Paul Bakker23986e52011-04-24 08:57:21 +0000667 * \param output_max_len maximum length of the output buffer
Paul Bakker5121ce52009-01-03 21:22:43 +0000668 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200669 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000670 *
Hanno Becker248ae6d2017-05-04 11:27:39 +0100671 * \note The output buffer length \c output_max_len should be
672 * as large as the size ctx->len of ctx->N (eg. 128 bytes
673 * if RSA-1024 is used) to be able to hold an arbitrary
674 * decrypted message. If it is not large enough to hold
Hanno Beckercbb59bc2017-08-23 14:11:08 +0100675 * the decryption of the particular ciphertext provided,
Hanno Becker248ae6d2017-05-04 11:27:39 +0100676 * the function will return MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE.
677 *
678 * \note The input buffer must be as large as the size
679 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
Paul Bakker5121ce52009-01-03 21:22:43 +0000680 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200681int mbedtls_rsa_pkcs1_decrypt( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200682 int (*f_rng)(void *, unsigned char *, size_t),
683 void *p_rng,
Paul Bakker23986e52011-04-24 08:57:21 +0000684 int mode, size_t *olen,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000685 const unsigned char *input,
Paul Bakker060c5682009-01-12 21:48:39 +0000686 unsigned char *output,
Paul Bakker23986e52011-04-24 08:57:21 +0000687 size_t output_max_len );
Paul Bakker5121ce52009-01-03 21:22:43 +0000688
689/**
Paul Bakkerb3869132013-02-28 17:21:01 +0100690 * \brief Perform a PKCS#1 v1.5 decryption (RSAES-PKCS1-v1_5-DECRYPT)
691 *
692 * \param ctx RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200693 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200694 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200695 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakkerb3869132013-02-28 17:21:01 +0100696 * \param olen will contain the plaintext length
697 * \param input buffer holding the encrypted data
698 * \param output buffer that will hold the plaintext
699 * \param output_max_len maximum length of the output buffer
700 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200701 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100702 *
Hanno Becker248ae6d2017-05-04 11:27:39 +0100703 * \note The output buffer length \c output_max_len should be
704 * as large as the size ctx->len of ctx->N (eg. 128 bytes
705 * if RSA-1024 is used) to be able to hold an arbitrary
706 * decrypted message. If it is not large enough to hold
Hanno Beckercbb59bc2017-08-23 14:11:08 +0100707 * the decryption of the particular ciphertext provided,
Hanno Becker248ae6d2017-05-04 11:27:39 +0100708 * the function will return MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE.
709 *
710 * \note The input buffer must be as large as the size
711 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
Paul Bakkerb3869132013-02-28 17:21:01 +0100712 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200713int mbedtls_rsa_rsaes_pkcs1_v15_decrypt( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200714 int (*f_rng)(void *, unsigned char *, size_t),
715 void *p_rng,
Paul Bakkerb3869132013-02-28 17:21:01 +0100716 int mode, size_t *olen,
717 const unsigned char *input,
718 unsigned char *output,
719 size_t output_max_len );
720
721/**
722 * \brief Perform a PKCS#1 v2.1 OAEP decryption (RSAES-OAEP-DECRYPT)
723 *
724 * \param ctx RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200725 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200726 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200727 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
Paul Bakkera43231c2013-02-28 17:33:49 +0100728 * \param label buffer holding the custom label to use
729 * \param label_len contains the label length
Paul Bakkerb3869132013-02-28 17:21:01 +0100730 * \param olen will contain the plaintext length
731 * \param input buffer holding the encrypted data
732 * \param output buffer that will hold the plaintext
733 * \param output_max_len maximum length of the output buffer
734 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200735 * \return 0 if successful, or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100736 *
Hanno Becker248ae6d2017-05-04 11:27:39 +0100737 * \note The output buffer length \c output_max_len should be
738 * as large as the size ctx->len of ctx->N (eg. 128 bytes
739 * if RSA-1024 is used) to be able to hold an arbitrary
740 * decrypted message. If it is not large enough to hold
Hanno Becker8fd55482017-08-23 14:07:48 +0100741 * the decryption of the particular ciphertext provided,
Hanno Becker248ae6d2017-05-04 11:27:39 +0100742 * the function will return MBEDTLS_ERR_RSA_OUTPUT_TOO_LARGE.
743 *
Hanno Becker8fd55482017-08-23 14:07:48 +0100744 * \note The input buffer must be as large as the size
Hanno Becker248ae6d2017-05-04 11:27:39 +0100745 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
Paul Bakkerb3869132013-02-28 17:21:01 +0100746 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200747int mbedtls_rsa_rsaes_oaep_decrypt( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200748 int (*f_rng)(void *, unsigned char *, size_t),
749 void *p_rng,
Paul Bakkera43231c2013-02-28 17:33:49 +0100750 int mode,
751 const unsigned char *label, size_t label_len,
752 size_t *olen,
Paul Bakkerb3869132013-02-28 17:21:01 +0100753 const unsigned char *input,
754 unsigned char *output,
755 size_t output_max_len );
756
757/**
758 * \brief Generic wrapper to perform a PKCS#1 signature using the
759 * mode from the context. Do a private RSA operation to sign
760 * a message digest
Paul Bakker5121ce52009-01-03 21:22:43 +0000761 *
762 * \param ctx RSA context
Paul Bakker548957d2013-08-30 10:30:02 +0200763 * \param f_rng RNG function (Needed for PKCS#1 v2.1 encoding and for
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200764 * MBEDTLS_RSA_PRIVATE)
Paul Bakker9dcc3222011-03-08 14:16:06 +0000765 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200766 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
767 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
768 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakker5121ce52009-01-03 21:22:43 +0000769 * \param hash buffer holding the message digest
770 * \param sig buffer that will hold the ciphertext
771 *
772 * \return 0 if the signing operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200773 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000774 *
775 * \note The "sig" buffer must be as large as the size
776 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
Paul Bakker9dcc3222011-03-08 14:16:06 +0000777 *
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200778 * \note In case of PKCS#1 v2.1 encoding, see comments on
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200779 * \note \c mbedtls_rsa_rsassa_pss_sign() for details on md_alg and hash_id.
Paul Bakker5121ce52009-01-03 21:22:43 +0000780 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200781int mbedtls_rsa_pkcs1_sign( mbedtls_rsa_context *ctx,
Paul Bakkera3d195c2011-11-27 21:07:34 +0000782 int (*f_rng)(void *, unsigned char *, size_t),
Paul Bakker9dcc3222011-03-08 14:16:06 +0000783 void *p_rng,
Paul Bakker5121ce52009-01-03 21:22:43 +0000784 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200785 mbedtls_md_type_t md_alg,
Paul Bakker23986e52011-04-24 08:57:21 +0000786 unsigned int hashlen,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000787 const unsigned char *hash,
Paul Bakker5121ce52009-01-03 21:22:43 +0000788 unsigned char *sig );
789
790/**
Paul Bakkerb3869132013-02-28 17:21:01 +0100791 * \brief Perform a PKCS#1 v1.5 signature (RSASSA-PKCS1-v1_5-SIGN)
792 *
793 * \param ctx RSA context
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200794 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200795 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200796 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
797 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
798 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakkerb3869132013-02-28 17:21:01 +0100799 * \param hash buffer holding the message digest
800 * \param sig buffer that will hold the ciphertext
801 *
802 * \return 0 if the signing operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200803 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100804 *
805 * \note The "sig" buffer must be as large as the size
806 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
807 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200808int mbedtls_rsa_rsassa_pkcs1_v15_sign( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200809 int (*f_rng)(void *, unsigned char *, size_t),
810 void *p_rng,
Paul Bakkerb3869132013-02-28 17:21:01 +0100811 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200812 mbedtls_md_type_t md_alg,
Paul Bakkerb3869132013-02-28 17:21:01 +0100813 unsigned int hashlen,
814 const unsigned char *hash,
815 unsigned char *sig );
816
817/**
818 * \brief Perform a PKCS#1 v2.1 PSS signature (RSASSA-PSS-SIGN)
819 *
820 * \param ctx RSA context
Paul Bakker548957d2013-08-30 10:30:02 +0200821 * \param f_rng RNG function (Needed for PKCS#1 v2.1 encoding and for
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200822 * MBEDTLS_RSA_PRIVATE)
Paul Bakkerb3869132013-02-28 17:21:01 +0100823 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200824 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
825 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
826 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakkerb3869132013-02-28 17:21:01 +0100827 * \param hash buffer holding the message digest
828 * \param sig buffer that will hold the ciphertext
829 *
830 * \return 0 if the signing operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200831 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100832 *
833 * \note The "sig" buffer must be as large as the size
834 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
835 *
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200836 * \note The hash_id in the RSA context is the one used for the
837 * encoding. md_alg in the function call is the type of hash
Paul Bakkerb3869132013-02-28 17:21:01 +0100838 * that is encoded. According to RFC 3447 it is advised to
839 * keep both hashes the same.
840 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200841int mbedtls_rsa_rsassa_pss_sign( mbedtls_rsa_context *ctx,
Paul Bakkerb3869132013-02-28 17:21:01 +0100842 int (*f_rng)(void *, unsigned char *, size_t),
843 void *p_rng,
844 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200845 mbedtls_md_type_t md_alg,
Paul Bakkerb3869132013-02-28 17:21:01 +0100846 unsigned int hashlen,
847 const unsigned char *hash,
848 unsigned char *sig );
849
850/**
851 * \brief Generic wrapper to perform a PKCS#1 verification using the
852 * mode from the context. Do a public RSA operation and check
853 * the message digest
Paul Bakker5121ce52009-01-03 21:22:43 +0000854 *
855 * \param ctx points to an RSA public key
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200856 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200857 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200858 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
859 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
860 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakker5121ce52009-01-03 21:22:43 +0000861 * \param hash buffer holding the message digest
862 * \param sig buffer holding the ciphertext
863 *
864 * \return 0 if the verify operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200865 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakker5121ce52009-01-03 21:22:43 +0000866 *
867 * \note The "sig" buffer must be as large as the size
868 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
Paul Bakker9dcc3222011-03-08 14:16:06 +0000869 *
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200870 * \note In case of PKCS#1 v2.1 encoding, see comments on
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200871 * \c mbedtls_rsa_rsassa_pss_verify() about md_alg and hash_id.
Paul Bakker5121ce52009-01-03 21:22:43 +0000872 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200873int mbedtls_rsa_pkcs1_verify( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200874 int (*f_rng)(void *, unsigned char *, size_t),
875 void *p_rng,
Paul Bakker5121ce52009-01-03 21:22:43 +0000876 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200877 mbedtls_md_type_t md_alg,
Paul Bakker23986e52011-04-24 08:57:21 +0000878 unsigned int hashlen,
Paul Bakkerff60ee62010-03-16 21:09:09 +0000879 const unsigned char *hash,
Manuel Pégourié-Gonnardcc0a9d02013-08-12 11:34:35 +0200880 const unsigned char *sig );
Paul Bakker5121ce52009-01-03 21:22:43 +0000881
882/**
Paul Bakkerb3869132013-02-28 17:21:01 +0100883 * \brief Perform a PKCS#1 v1.5 verification (RSASSA-PKCS1-v1_5-VERIFY)
884 *
885 * \param ctx points to an RSA public key
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200886 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200887 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200888 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
889 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
890 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakkerb3869132013-02-28 17:21:01 +0100891 * \param hash buffer holding the message digest
892 * \param sig buffer holding the ciphertext
893 *
894 * \return 0 if the verify operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200895 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100896 *
897 * \note The "sig" buffer must be as large as the size
898 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
899 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200900int mbedtls_rsa_rsassa_pkcs1_v15_verify( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200901 int (*f_rng)(void *, unsigned char *, size_t),
902 void *p_rng,
Paul Bakkerb3869132013-02-28 17:21:01 +0100903 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200904 mbedtls_md_type_t md_alg,
Paul Bakkerb3869132013-02-28 17:21:01 +0100905 unsigned int hashlen,
906 const unsigned char *hash,
Manuel Pégourié-Gonnardcc0a9d02013-08-12 11:34:35 +0200907 const unsigned char *sig );
Paul Bakkerb3869132013-02-28 17:21:01 +0100908
909/**
910 * \brief Perform a PKCS#1 v2.1 PSS verification (RSASSA-PSS-VERIFY)
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200911 * (This is the "simple" version.)
Paul Bakkerb3869132013-02-28 17:21:01 +0100912 *
913 * \param ctx points to an RSA public key
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200914 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Paul Bakker548957d2013-08-30 10:30:02 +0200915 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200916 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
917 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
918 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Paul Bakkerb3869132013-02-28 17:21:01 +0100919 * \param hash buffer holding the message digest
920 * \param sig buffer holding the ciphertext
921 *
922 * \return 0 if the verify operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200923 * or an MBEDTLS_ERR_RSA_XXX error code
Paul Bakkerb3869132013-02-28 17:21:01 +0100924 *
925 * \note The "sig" buffer must be as large as the size
926 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
927 *
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200928 * \note The hash_id in the RSA context is the one used for the
929 * verification. md_alg in the function call is the type of
Paul Bakkerb9e4e2c2014-05-01 14:18:25 +0200930 * hash that is verified. According to RFC 3447 it is advised to
Manuel Pégourié-Gonnarde6d1d822014-06-02 16:47:02 +0200931 * keep both hashes the same. If hash_id in the RSA context is
932 * unset, the md_alg from the function call is used.
Paul Bakkerb3869132013-02-28 17:21:01 +0100933 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200934int mbedtls_rsa_rsassa_pss_verify( mbedtls_rsa_context *ctx,
Paul Bakker548957d2013-08-30 10:30:02 +0200935 int (*f_rng)(void *, unsigned char *, size_t),
936 void *p_rng,
Paul Bakkerb3869132013-02-28 17:21:01 +0100937 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200938 mbedtls_md_type_t md_alg,
Paul Bakkerb3869132013-02-28 17:21:01 +0100939 unsigned int hashlen,
940 const unsigned char *hash,
Manuel Pégourié-Gonnardcc0a9d02013-08-12 11:34:35 +0200941 const unsigned char *sig );
Paul Bakkerb3869132013-02-28 17:21:01 +0100942
943/**
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200944 * \brief Perform a PKCS#1 v2.1 PSS verification (RSASSA-PSS-VERIFY)
945 * (This is the version with "full" options.)
946 *
947 * \param ctx points to an RSA public key
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200948 * \param f_rng RNG function (Only needed for MBEDTLS_RSA_PRIVATE)
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200949 * \param p_rng RNG parameter
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200950 * \param mode MBEDTLS_RSA_PUBLIC or MBEDTLS_RSA_PRIVATE
951 * \param md_alg a MBEDTLS_MD_XXX (use MBEDTLS_MD_NONE for signing raw data)
952 * \param hashlen message digest length (for MBEDTLS_MD_NONE only)
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200953 * \param hash buffer holding the message digest
954 * \param mgf1_hash_id message digest used for mask generation
955 * \param expected_salt_len Length of the salt used in padding, use
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200956 * MBEDTLS_RSA_SALT_LEN_ANY to accept any salt length
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200957 * \param sig buffer holding the ciphertext
958 *
959 * \return 0 if the verify operation was successful,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200960 * or an MBEDTLS_ERR_RSA_XXX error code
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200961 *
962 * \note The "sig" buffer must be as large as the size
963 * of ctx->N (eg. 128 bytes if RSA-1024 is used).
964 *
965 * \note The hash_id in the RSA context is ignored.
966 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200967int mbedtls_rsa_rsassa_pss_verify_ext( mbedtls_rsa_context *ctx,
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200968 int (*f_rng)(void *, unsigned char *, size_t),
969 void *p_rng,
970 int mode,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200971 mbedtls_md_type_t md_alg,
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200972 unsigned int hashlen,
973 const unsigned char *hash,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200974 mbedtls_md_type_t mgf1_hash_id,
Manuel Pégourié-Gonnard5ec628a2014-06-03 11:44:06 +0200975 int expected_salt_len,
976 const unsigned char *sig );
977
978/**
Manuel Pégourié-Gonnard3053f5b2013-08-14 13:39:57 +0200979 * \brief Copy the components of an RSA context
980 *
981 * \param dst Destination context
982 * \param src Source context
983 *
Manuel Pégourié-Gonnard81abefd2015-05-29 12:53:47 +0200984 * \return 0 on success,
Manuel Pégourié-Gonnard6a8ca332015-05-28 09:33:39 +0200985 * MBEDTLS_ERR_MPI_ALLOC_FAILED on memory allocation failure
Manuel Pégourié-Gonnard3053f5b2013-08-14 13:39:57 +0200986 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200987int mbedtls_rsa_copy( mbedtls_rsa_context *dst, const mbedtls_rsa_context *src );
Manuel Pégourié-Gonnard3053f5b2013-08-14 13:39:57 +0200988
989/**
Paul Bakker5121ce52009-01-03 21:22:43 +0000990 * \brief Free the components of an RSA key
Paul Bakker13e2dfe2009-07-28 07:18:38 +0000991 *
992 * \param ctx RSA Context to free
Paul Bakker5121ce52009-01-03 21:22:43 +0000993 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200994void mbedtls_rsa_free( mbedtls_rsa_context *ctx );
Paul Bakker5121ce52009-01-03 21:22:43 +0000995
996/**
997 * \brief Checkup routine
998 *
999 * \return 0 if successful, or 1 if the test failed
1000 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02001001int mbedtls_rsa_self_test( int verbose );
Paul Bakker5121ce52009-01-03 21:22:43 +00001002
1003#ifdef __cplusplus
1004}
1005#endif
1006
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +02001007#endif /* MBEDTLS_RSA_C */
Paul Bakkered27a042013-04-18 22:46:23 +02001008
Paul Bakker5121ce52009-01-03 21:22:43 +00001009#endif /* rsa.h */