/usr/include/beecrypt/rsakp.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 | /*
* Copyright (c) 2000, 2001, 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 rsakp.h
* \brief RSA keypair, headers.
* \author Bob Deblier <bob.deblier@telenet.be>
* \ingroup IF_m IF_rsa_m
*/
#ifndef _RSAKP_H
#define _RSAKP_H
#include "beecrypt/rsapk.h"
/*!\brief RSA keypair.
* \ingroup IF_rsa_m
*/
#ifdef __cplusplus
struct BEECRYPTAPI rsakp
#else
struct _rsakp
#endif
{
/*!\var n
* \brief The modulus.
*
* \f$n=pq\f$
*/
mpbarrett n;
/*!\var e
* \brief The public exponent.
*/
mpnumber e;
/*!\var d
* \brief The private exponent.
*/
mpnumber d;
/*!\var p
* \brief The first prime factor of the modulus.
*/
mpbarrett p;
/*!\var q
* \brief The second prime factor of the modulus.
*/
mpbarrett q;
/*!\var dp
* \brief the first prime coefficient.
* \f$dp=d\ \textrm{mod}\ (p-1)\f$
*/
mpnumber dp;
/*!\var dq
* \brief the second prime coefficient.
* \f$dq=d\ \textrm{mod}\ (q-1)\f$
*/
mpnumber dq;
/*!\var qi
* \brief the crt coefficient.
* \f$qi=q^{-1}\ \textrm{mod}\ p\f$
*/
mpnumber qi;
#ifdef __cplusplus
rsakp();
rsakp(const rsakp&);
~rsakp();
#endif
};
#ifndef __cplusplus
typedef struct _rsakp rsakp;
#endif
#ifdef __cplusplus
extern "C" {
#endif
BEECRYPTAPI
int rsakpMake(rsakp*, randomGeneratorContext*, size_t);
BEECRYPTAPI
int rsakpInit(rsakp*);
BEECRYPTAPI
int rsakpFree(rsakp*);
BEECRYPTAPI
int rsakpCopy(rsakp*, const rsakp*);
#ifdef __cplusplus
}
#endif
#endif
|