NTL library

asked 7 years ago

this post is marked as community wiki

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.

Preview: (hide)

Comments

(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.)

dan_fulea gravatar imagedan_fulea ( 7 years ago )
1

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.

dan_fulea gravatar imagedan_fulea ( 7 years ago )