Re: [sage-support] Irreducibility of polynomials

2014-05-08 Thread Silke Johler 
Hi Martin,

danke für die schnelle Rückmeldung. So wie es scheint basiert der Test auf 
DDF, was vermutlich langsamer ist im Vergleich zu Rabins Test wenn grad(f) 
= p = prim. Im allgemeinen Fall aber die schnellere Variante.

Danke nochmal,

viele Grüße



Am Mittwoch, 7. Mai 2014 15:35:45 UTC+2 schrieb Martin Albrecht:

 Here's how to find out: 

 sage: P.x = GF(2)[] 
 sage: f = P.random_element() 
 sage: f.is_irreducible?? 
 snip 
 if 0 == GF2X_IterIrredTest(self.x): 
 return False 
 else: 
 return True 

 Okay, what's GF2X_IterIrredTest? 

 sage: search_src(GF2X_IterIrredTest) 
 libs/ntl/ntl_GF2X_decl.pxd:62:long GF2X_IterIrredTest IterIrredTest 
 (GF2X_c f) 

 This leads us to NTL's IterIrredTest, searching for it leads to: 

 http://www.shoup.net/ntl/doc/GF2XFactoring.txt 

 long IterIrredTest(const GF2X f); 

 // performs an iterative deterministic irreducibility test, based on 
 // DDF.  Fast on average (when f has a small factor). 

 Gruß, 
 Martin 

 On Wednesday 07 May 2014 05:51:11 Silke Johler wrote: 
  Hi everyone, 
  
  I would like to know which test Sage uses to test irreducibility of a 
  polynomial over GF(2). Is it Rabin`s Test? How to compute the first 
  condition? I am not asking for the command, just the 
  techniquehttp://www.dict.cc/englisch-deutsch/technique.html . 
  
  Thanks.

-- 
You received this message because you are subscribed to the Google Groups 
sage-support group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to sage-support+unsubscr...@googlegroups.com.
To post to this group, send email to sage-support@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.

[sage-support] Irreducibility of polynomials

2014-05-07 Thread Silke Johler 
Hi everyone,

I would like to know which test Sage uses to test irreducibility of a 
polynomial over GF(2). Is it Rabin`s Test? How to compute the first 
condition? I am not asking for the command, just the 
techniquehttp://www.dict.cc/englisch-deutsch/technique.html
.

Thanks.



-- 
You received this message because you are subscribed to the Google Groups 
sage-support group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to sage-support+unsubscr...@googlegroups.com.
To post to this group, send email to sage-support@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.

Re: [sage-support] Irreducibility of polynomials

2014-05-07 Thread Martin Albrecht 
Here's how to find out:

sage: P.x = GF(2)[]
sage: f = P.random_element()
sage: f.is_irreducible??
snip
if 0 == GF2X_IterIrredTest(self.x):
return False
else:
return True

Okay, what's GF2X_IterIrredTest?

sage: search_src(GF2X_IterIrredTest)
libs/ntl/ntl_GF2X_decl.pxd:62:long GF2X_IterIrredTest IterIrredTest 
(GF2X_c f)

This leads us to NTL's IterIrredTest, searching for it leads to:

http://www.shoup.net/ntl/doc/GF2XFactoring.txt

long IterIrredTest(const GF2X f);

// performs an iterative deterministic irreducibility test, based on
// DDF.  Fast on average (when f has a small factor).

Gruß,
Martin

On Wednesday 07 May 2014 05:51:11 Silke Johler wrote:
 Hi everyone,
 
 I would like to know which test Sage uses to test irreducibility of a
 polynomial over GF(2). Is it Rabin`s Test? How to compute the first
 condition? I am not asking for the command, just the
 techniquehttp://www.dict.cc/englisch-deutsch/technique.html .
 
 Thanks.

signature.asc
Description: This is a digitally signed message part.