/usr/include/beecrypt/rsa.h is in libbeecrypt-dev 4.2.1-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 | /*
* Copyright (c) 2000, 2002 X-Way Rights BV
*
* 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.
* \author Bob Deblier <bob.deblier@telenet.be>
* \ingroup IF_m IF_rsa_m
*/
#ifndef _RSA_H
#define _RSA_H
#include "beecrypt/rsakp.h"
#ifdef __cplusplus
extern "C" {
#endif
/*!\fn int rsapub(const mpbarrett* n, const mpnumber* e, const mpnumber* m, mpnumber* c)
* \brief This function performs a 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 n The RSA modulus.
* \param e The RSA public exponent.
* \param m The message.
* \param c The ciphertext.
* \retval 0 on success.
* \retval -1 on failure.
*/
BEECRYPTAPI
int rsapub(const mpbarrett* n, const mpnumber* e,
const mpnumber* m, mpnumber* c);
/*!\fn int rsapri(const mpbarrett* n, const mpnumber* d, const mpnumber* c, mpnumber* m)
* \brief This function performs a 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 n The modulus.
* \param d The private exponent.
* \param c The ciphertext.
* \param m The message.
* \retval 0 on success.
* \retval -1 on failure.
*/
BEECRYPTAPI
int rsapri(const mpbarrett* n, const mpnumber* d,
const mpnumber* c, mpnumber* m);
/*!\fn int rsapricrt(const mpbarrett* n, const mpbarrett* p, const mpbarrett* q, const mpnumber* dp, const mpnumber* dq, const mpnumber* qi, const mpnumber* c, mpnumber* m)
*
* \brief This function performs a raw RSA private key operation, with
* application of the Chinese Remainder Theorem.
*
* It performs the operation:
* \li \f$j_1=c^{dp}\ \textrm{mod}\ p\f$
* \li \f$j_2=c^{dq}\ \textrm{mod}\ q\f$
* \li \f$h=qi \cdot (j_1-j_2)\ \textrm{mod}\ p\f$
* \li \f$m=j_2+hq\f$
*
* \param n The modulus.
* \param p The first prime factor.
* \param q The second prime factor.
* \param dp The private exponent d mod (p-1).
* \param dq The private exponent d (q-1).
* \param qi The inverse of q mod p.
* \param c The ciphertext.
* \param m The message.
* \retval 0 on success.
* \retval -1 on failure.
*/
BEECRYPTAPI
int rsapricrt(const mpbarrett* n, const mpbarrett* p, const mpbarrett* q,
const mpnumber* dp, const mpnumber* dq, const mpnumber* qi,
const mpnumber* c, mpnumber* m);
/*!\fn int rsavrfy(const mpbarrett* n, const mpnumber* e, const mpnumber* m, const mpnumber* c)
* \brief This function performs a raw RSA verification.
*
* It verifies if ciphertext \a c was encrypted from cleartext \a m
* with the private key matching the given public key \a (n, e).
*
* \param n The modulus.
* \param e The public exponent.
* \param m The cleartext message.
* \param c The ciphertext message.
* \retval 1 on success.
* \retval 0 on failure.
*/
BEECRYPTAPI
int rsavrfy(const mpbarrett* n, const mpnumber* e,
const mpnumber* m, const mpnumber* c);
#ifdef __cplusplus
}
#endif
#endif
|