-
Notifications
You must be signed in to change notification settings - Fork 3
/
Utils.h
62 lines (54 loc) · 1.88 KB
/
Utils.h
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
//
// Utils.h
// RSA
//
// Created by ivan sarno on 21/08/15.
// Copyright (c) 2015 ivan sarno
/*
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License. */
//Version V.4.1
#ifndef __RSA__Utils__
#define __RSA__Utils__
#include <gmpxx.h>
#include <stdlib.h>
#include <random>
namespace RSA
{
namespace Utils
{
typedef mpz_class BigInteger;
BigInteger pow(BigInteger base, BigInteger exp);
BigInteger mod_pow(BigInteger base, BigInteger exp, const BigInteger &mod);
BigInteger inverse(const BigInteger &number, const BigInteger &modulus, unsigned int size);
bool coprime (BigInteger a, BigInteger b);
BigInteger byte2biginteger(uint8_t *byte, unsigned int size);
unsigned bitSize(const BigInteger &number);
class Generator
{
public:
virtual BigInteger getBig(unsigned int size)=0;//return a positive BigInteger of size bit
};
class TestGenerator: public Generator
{
private:
gmp_randstate_t rstate;
mpz_t rand;
unsigned long long seed;
public:
TestGenerator();
TestGenerator(unsigned long long seed);
~TestGenerator();
BigInteger getBig(unsigned int size);
unsigned long long getInt();//return a positive BigInteger of size bit
};
}
}
#endif /* defined(__RSA__Utils__) */