[bigint] Question/Bug Report

[Denivy Ruck]

Hey Matt! I'm a brazilian guy and i'm studying Computer Science.

So, i have a project about RSA Criptography, and my professor told us to
look for some BigInteger libraries. All he want us to implement is any
algorithm to verify prime numbers and modulum inverse.

For this prime numbers algorithm, i was going to use your "modexp"
function. However, i got some trouble in converting from BigInteger to
BigUnsigned. Is there any way to convert between these 2 types? Or maybe
i'm missing something haha.

Thank you very much for your time!

Best regards, Denivy Rück
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mattmccutchen.net/mailman/archives/bigint/attachments/20131102/b8ed2f78/attachment.html>