[ntl] Question about super large numbers

[Shouwei Li]

Hi all,

I come across a problem with NTL now. I have to calculate this polynomial
(X+a)^n and all the coefficients will modulo "n". Since "n" is a super
large number (around 1024 bits), my program always killed by the OS. I
tried some small numbers of "n", around 512 bits, it works fine.

I guess the problem should be NTL does not support a so big intermediate
result, so the program crashed. How can I change the source code in order
to support larger numbers than by default? Or is there any other solutions?

Thank you very much!
-- 
Best Regards!
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://shoup.net/pipermail/ntl_shoup.net/attachments/20130810/05bff4ec/attachment.html>