Pokey, the pocket monster
Tuffy, the thirsty dog
CSC 222, Data Structures and Algorithms II
Welcome to Menehune's GMP page. GMP is Gnu's multi-precision
library. It enables exact computation with integers and
rational numbers which exceed the limiations of 32-bit
and 64-bit integers. Use apt-get to install GMP on your
Here is a list of resources for getting started:
An example of RSA Encryption
Here are a set of files:
- Example public key
The first number is the modulus, N. The second number
is the exponent, e.
The numbers N and e are written in base 10 in this file.
- Example private key
The first number is the modulus N. The second number
is the exponent, d, which is the inverse of e modulo (p-1)*(q-1).
The numbers N and d are written in base 10 in this file.
- Example cipher text
The encrypted numbers, (x^e modulo N) are limited
in size to fit into 8 byte chunks.
Each number (8 bytes of cipher text) is represented
by 16 hexadecimal (base 16) digits. Leading zeros
are not printed, so if you find a number listed with
only 15 hexadecimal digits, it means that number is
a little smaller than the others. No big deal, it
just came out that way.
There is one space between each 8 byte encrypted chunk.