[ntl] NTL performance for finding inverse in GF2E

[ishtiaq shah]

Dear All,                I am a Master student at TU Darmstadt and I am using NTL library in Visual C++ 2008.I have to take the inverse of very large matrix 2730*2730 in GF(2^8).But with this library I am unable to find the inverse in 1 hour.Can body tell me how I can find the inverse efficiently with this library or I have to shift to another library.I have also appended my code in this email.
Thanks in advance.
Cheers,Ishtiaq

#include <NTL/GF2XFactoring.h>#include <NTL/GF2EXFactoring.h>#include <NTL/GF2X.h>#include <NTL/matrix.h>#include <NTL/vec_vec_GF2E.h>#include <NTL/GF2E.h>#include <NTL/vector.h>#include <NTL/mat_GF2E.h>


NTL_OPEN_NNS


NTL_CLOSE_NNS
NTL_CLIENT
int main(){     GF2X p;   BuildIrred(p,8);    GF2E::init(p);
     mat_GF2E A,X;   A.SetDims(2730,2730);   for(int i=1;i<=2730;i++)	   for(int j=1;j<=2730;j++)		random(A(i,j));
     inv(X,A); system("pause");   return 0;}  		 	   		  
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://shoup.net/pipermail/ntl_shoup.net/attachments/20110507/ac78e9f2/attachment.html>