On Saturday, February 9, 2013 4:40:00 PM UTC+2, David Joyner wrote: > Do the docstrings in lfsr help? > http://hg.sagemath.org/sage-main/file/ec1fb07db6e2/sage/crypto/lfsr.py#l1
Hello, Thanks for pointing the docs, the following site does also implement B/M over GF(2). http://bma.bozhu.me/ Interesting enough, it gives me: x^19 + x^18 + x^17 + x^14 + x^13 + x^10 + x^9 + x^8 + x^6 + x^3 + x^2 + 1 Wow! A degree 19 polynomial. As far as I recall, B/M cannot generate a polynomial degree > (sequence length / 2). My seq. has length 36. So, max degree can be 18. It seems their implementation is a bit off. I still have no clue about my question:( Tried decimating the sequence of the lfsr, yet no luck. Thanks, evrim. -- 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?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
