Hello, this is my first post to the list.
I am trying to use B/M algo included in Sage. Now,
berlekamp_massey([GF(2)(0),0,1,0,1,0,0,1,0,1,1,1,0,0,1,1,0,0,0,0,1,0,1,1,0,1,0,1,0,0,0,1,1,1,1,0])
evals to f(x)=x^5 + x^3 + x^2 + x + 1 which is the minimal poly.
Also, I know that when I take the
On Sat, Feb 9, 2013 at 9:34 AM, evrim evrim...@gmail.com wrote:
Hello, this is my first post to the list.
I am trying to use B/M algo included in Sage. Now,
berlekamp_massey([GF(2)(0),0,1,0,1,0,0,1,0,1,1,1,0,0,1,1,0,0,0,0,1,0,1,1,0,1,0,1,0,0,0,1,1,1,1,0])
evals to f(x)=x^5 + x^3 + x^2 + x +
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/
