Name: Anonymous 2010-11-12 21:43
Alright, I'm taking a Cryptography class at my college. It's offered through the math department, not the Computer Science department, so the majority of the class has been number theory, but we finally covered the Three-Pass-Protocol and RSA algorithms.
I've implemented the underlying concepts in C++, using unsigned long long int. but it looks like that'll only get me up to about 10^19. An actual RSA implementation requires primes of about 10^150. We haven't covered primality testing algorithms yet, so over the weekend I'd like to come up with an implementation of integers of arbitrary length.
Can anyone point me to something that explains popular methodologies of really large integers?
I've implemented the underlying concepts in C++, using unsigned long long int. but it looks like that'll only get me up to about 10^19. An actual RSA implementation requires primes of about 10^150. We haven't covered primality testing algorithms yet, so over the weekend I'd like to come up with an implementation of integers of arbitrary length.
Can anyone point me to something that explains popular methodologies of really large integers?