View Single Post
Old 2008-06-16, 10:57   #1
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

2×7×461 Posts
Default Very basic question about Wiedemann methods

I can see (and have checked by experiment in python and written up in wikipedia) roughly how the Coppersmith algorithm works - we know that there exists a minimal polynomial for the matrix which will annihilate the sequence y M^i x, we know a polynomial that annihilates the sequence y M^i x, we can use the second as if it were the first and generally err only by some small polynomial factor.

But I can't understand how I can obtain a vector annihilated by a matrix if I know the minimal polynomial of the matrix.
fivemack is offline   Reply With Quote