1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
/*
* Copyright (c) 2000, 2002 Virtual Unlimited B.V.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
/*!\file rsa.h
* \brief RSA algorithm, headers.
* \author Bob Deblier <bob.deblier@pandora.be>
* \ingroup IF_m IF_rsa_m
*/
#ifndef _RSA_H
#define _RSA_H
#include "rsakp.h"
#ifdef __cplusplus
extern "C" {
#endif
/**
* The raw RSA public key operation.
*
* This function can be used for encryption and verifying.
*
* It performs the following operation:
* \li \f$c=m^{e}\ \textrm{mod}\ n\f$
*
* @param pk RSA public key
* @param m message
* @param c ciphertext
* @retval 0 on success, -1 on failure
*/
int rsapub(const rsapk* pk, const mpnumber* m, mpnumber* c)
/*@modifies c */;
/**
* The raw RSA private key operation.
*
* This function can be used for decryption and signing.
*
* It performs the operation:
* \li \f$m=c^{d}\ \textrm{mod}\ n\f$
*
* @param kp RSA keypair
* @param c ciphertext
* @param m message
* @retval 0 on success, -1 on failure
*/
BEECRYPTAPI /*@unused@*/
int rsapri (const rsakp* kp, const mpnumber* c, mpnumber* m)
/*@modifies m */;
/**
* The raw RSA private key operation, with Chinese Remainder Theorem.
*
* It performs the operation:
* \li \f$j_1=c^{d_1}\ \textrm{mod}\ p\f$
* \li \f$j_2=c^{d_2}\ \textrm{mod}\ q\f$
* \li \f$h=c \cdot (j_1-j_2)\ \textrm{mod}\ p\f$
* \li \f$m=j_2+hq\f$
*
* @param kp RSA keypair
* @param c ciphertext
* @param m message
* @retval 0 on success, -1 on failure.
*/
BEECRYPTAPI /*@unused@*/
int rsapricrt(const rsakp* kp, const mpnumber* c, mpnumber* m)
/*@modifies m */;
/**
* Verify if ciphertext \e c was encrypted from cleartext \e m
* with the private key matching the given public key \e pk.
*
* @warning The return type of this function should be a boolean, but since
* that type isn't as portable, an int is used.
*
* @param pk RSA public key
* @param m cleartext message
* @param c ciphertext message
* @retval 1 on success, 0 on failure
*/
BEECRYPTAPI /*@unused@*/
int rsavrfy (const rsapk* pk, const mpnumber* m, const mpnumber* c)
/*@*/;
#ifdef __cplusplus
}
#endif
#endif
|
