Initial checking of the Montgomery Reduced Residue Number System (Monty BuRNS)
New prime factorization methods.
Code cleanup.
Pollard-Brent is the fastest factorisation by far, remove the other methods.
Implemented Brent-Pollard integer factorisation. This should be fast enough.
Added a small template function to print vector<>s to ostreams.
Added deterministic O(n) modulo 2^62 calculation.
Modular algorithms and multiplication benchmark.
Cleanup of monty.{h,cpp} and Makefile.
monty: Added discrete logarithm boilerplate
monty: Added a function for powers of the generator using lookup tables
Added a cache for calculated monty and burns objects.
monty: faster get and set functions
monty: Made the class smaller so it fits the cache better. I should factor out the
discrete logarithm related code to a separate class
burns: Added mixed radix converters and compare function
BuRNS: Fixed and optimized the mixed radix converters
BuRNS: Minor improvements in mixed radix converters
Burns: Fixed fraction, faster algo
Monty: Added 2^-1 mod m variable
Uncommited improvements
Merge remote-tracking branch 'repo2/master'

Conflicts:
	.gitignore