odzhan

/**
Find involutory exponents for a modulus like a Mersenne prime: 2^31-1
Uses brute force
Very fast for small numbers, very slow for anything more than 16-bits.

gcc -O2 find_exp.c -ofind_exp -lcrypto
*/
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>

odzhan

/*
** Demo Public Key OpenSSL Echo Client
**
** Connects to an PK Echo Server. Generates RSA Key and
** sends encoded public key to server.  Response is a
** session key encoded with the public key.  Sends client 
** request, encoded with session key, consisting of 
** header and text to be echo'd between lines 'BEGIN'
** and 'END' (inclusive).  Reads server response, also
** encoded with session key, consisting of header and 

odzhan

//#include "x64/Debug/mscorlib.tlh"
#import "C:\Windows\Microsoft.NET\Framework64\v4.0.30319\mscorlib.tlb"   rename("or", "or2") rename("ReportEvent", "ReportEvent2") no_namespace raw_interfaces_only
#include <iostream>
#define __IObjectHandle_INTERFACE_DEFINED__
#include <MScorEE.h>
#include <MetaHost.h>
#include <shlwapi.h>
#include <vector>
#include <fstream>
#include "objbase.h"