libmdrsa

libmdrsa is a toy RSA implementation in C using Accelerate for fast arithmetic operations.

Author

Mert Dumenci [email protected]

Disclaimer

Do not use libmdrsa for encryption. I only built it to understand RSA better, and it's probably broken in a million ways that can be destructive in any serious usage.

Usage

// Generate a key pair
MDRSAKeyPair keyPair;
MDRSAGenerateKeys(&keyPair);

char *stringPayload = "Hello world!";

// Encrypt the payload using the generated public key
MDRSAEncryptedPayload encrypted = MDRSAEncrypt(&payload,
                                               &keyPair.publicKey,
                                               &stringPayload,
                                               strlen(stringPayload) + 1);

// Decrypt the encrypted payload using the private key
char *decryptedString;
MDRSADecrypt(&encrypted, &keyPair, &decryptedString);

// `stringPayload` should equal `decryptedString`!

Internals

libmdrsa uses the Fermat (Probabilistic) Primality Test in its key generation step. Check prime.h for detailed documentation (and why I used this primality test over better alternatives). It can handle primes as big as 512-bit (~150 digit) in a very fast way thanks to the vectorized arithmetic operations provided by the Accelerate framework.

Notes

Key generation (50-digit, ~160-bit), the encryption and decryption of the string "Hello world, this is something bigger. Chunking should handle this relatively long payload." takes ~0.06s on my MacBook Pro (2012, 2.3 GHz i7).

I found virtually no documentation about Accelerate's bignum types (vBigNum.h) and ended up figuring out a lot about these very useful types and their hardware accelerated arithmetic operations. Check bignum.c if you're curious/want to learn more about them!