asked 7 years ago
This post is a wiki. Anyone with karma >750 is welcome to improve it.
how to use NTL library to perform fast GCD computation over finite field.
(I am continuously losing comments... "This comment is forbidden...)
It seems that the C++ NTL library is called by default from sage.
http://doc.sagemath.org/html/en/constructions/polynomials.html
(There is an incomplete sentence using the abbreviation NTL.)
For instance, no my machine, the following code
R.<x> = PolynomialRing( GF(2) ) f = x^15910 + x^7 + x^2 + 1 print "f =", f for k in range( 1, 100 ): for l in range( k, 100 ): g = x^k + x^l + 1 if f.gcd(g) != 1: print "g = %s (f,g) = %s" % ( g, f.gcd(g) )
gives a quick result.
Please start posting anonymously - your entry will be published after you log in or create a new account.
Add Answer
subscribe to rss feed
Asked: 7 years ago
Seen: 232 times
Last updated: Jun 24 '17
(I am continuously losing comments... "This comment is forbidden...)
It seems that the C++ NTL library is called by default from sage.
http://doc.sagemath.org/html/en/constructions/polynomials.html
(There is an incomplete sentence using the abbreviation NTL.)
For instance, no my machine, the following code
gives a quick result.