[sage-devel] extending Sage concerning boolean functions

Hi, I'm a student in my final year of civil engineering and doing a thesis concerning Sage and cryptography. As a part of my thesis I would like to extend Sage and it's capabilities concerning boolean functions. Right now I'm looking into making some representations available (truth table, ANF, W

[sage-devel] how to extend the linbox wrapper?

Hi, I would like to have the block massey implementation from linbox available in Sage. I'm looking into on how to do this but I have no idea on how to make adjustments to linbox so they will be reflected in Sage. So I probably want to extend the linbox-sage.c/h files from linbox with a function

[sage-devel] smith normal form slow for a matrix over polynomial ring over GF(2)

Hi, Consider matrices containing univariate polynomials over GF(2): is it normal that calculating the smith normal form for such a matrix is extremely slow? this takes a while: P. = GF(2)['x'] d,u,v = random_matrix(P,11,11).smith_form() this doesn't seem to end: P. = GF(2)['x'] d,u,v = random

[sage-devel] Re: smith normal form slow for a matrix over polynomial ring over GF(2)

PM, Christophe Oosterlynck > > > > wrote: > > > Hi, > > > Consider matrices containing univariate polynomials over GF(2): is it > > normal that calculating the smith normal form for such a matrix is > > extremely slow? > > > this takes a while: &