What is a convenient base for a bignum library & primality testing algorithm?
Posted
by nn
on Stack Overflow
See other posts from Stack Overflow
or by nn
Published on 2010-04-18T22:21:52Z
Indexed on
2010/04/18
22:23 UTC
Read the original article
Hit count: 347
Hi,
I am to program the Solovay-Strassen primality test presented in the original paper on RSA.
Additionally I will need to write a small bignum library, and so when searching for a convenient representation for bignum I came across this [specification][1]:
struct {
int sign;
int size;
int *tab;
} bignum;
I will also be writing a multiplication routine using the Karatsuba method.
So, for my question:
What base would be convenient to store integer data in the bignum struct?
Note: I am not allowed to use third party or built-in implementations for bignum such as GMP.
Thank you.
© Stack Overflow or respective owner