Helios-vmg

#include "EasyBigNum.h"
#include <iomanip>

const unsigned rsa_bits = 1024;

struct rsa_info{
    EasyBigNum p1, p2, n, totient, e, d;
};

EasyBigNum generate_rsa_prime(std::mt19937 &source, unsigned rsa_bits) {

Helios-vmg

#include <cstdint>

class Crc32{
    std::uint32_t crc32;
    static std::uint32_t lookup[];
public:
    Crc32(){
        this->clear();
    }
    void clear(){

Helios-vmg

#include <iostream>
#include <typeinfo>

bool is_prime(unsigned n, unsigned i){
	if (i * i >= n)
		return true;
	if (n % i == 0)
		return false;
	return is_prime(n, i + 2);
}

Helios-vmg

//Returns an integer in [0;max], where max <= RAND_MAX
int unbiased_rand(int max){
    const int rand_max = RAND_MAX - (RAND_MAX + 1) % (max + 1);
    int r;
    do
        r = rand();
    while (r > rand_max);
    return r % (max + 1);
}

Helios-vmg

#include <iostream>
#include <queue>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <limits>

template <typename Float>
struct float_info{};