AutoIt Bot Community

Quellcode

#include <math.h>
#include <stdio.h>
#include <assert.h>


long qe2(long x, long y, long n)   /* berechne x^y mod n */
{
    long s, t, u;

    s = 1, t = x, u = y;

    while (u) {
        if (u & 1) s = (s * t) % n;
        u >>= 1;
        t = (t * t) % n;
    }

    return s;
}

void extended_euclid(long a, long b, long *x, long *y, long *d)   /* erweiterter Euklid */
{
    long q, r, x1 = 0, x2 = 1, y1 = 1, y2 = 0;

    if (b == 0) {
        *d = a;
        *x = 1;
        *y = 0;
        return;
    }

    while (b > 0) {
        q = a / b;
        r = a - q * b;
        *x = x2 - q * x1;
        *y = y2 - q * y1;
        a = b;
        b = r;
        x2 = x1;
        x1  = *x;
        y2 = y1;
        y1 = *y;
    }

    *d = a;
    *x = x2;
    *y = y2;
}

long inverse(long a, long n)
{
    long d, x, y;

    extended_euclid(a, n, &x, &y, &d);
    if (d == 1) return x;

    return 0;
}

extern "C" long __declspec(dllexport) rsa_genkey(long p, long q, long e)
{
    return inverse(e, (p-1)*(q-1));
}

extern "C" long __declspec(dllexport) rsa_encrypt(long m, long e, long n)
{
    assert(m < n);        /* m muss kleiner als n sein */
    return qe2(m, e, n);
}
               
extern "C" long __declspec(dllexport) rsa_decrypt(long c, long d, long n)
{
    assert(c < n);        /* c muss kleiner als n sein */
    return qe2(c, d, n);
}

AutoIt-QuellCode

$p = 11
$q = 13
$e = 23

$result = DllCall("RSAautoit.dll", "long:cdecl", "rsa_genkey", "long", $p, "long", $q, "long", $e)
MsgBox(0, "", @error)