2008-06-16, 10:57 | #1 |
(loop (#_fork))
Feb 2006
Cambridge, England
14357_{8} Posts |
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. |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Question regarding basic routines being used in Yafu. | storflyt32 | YAFU | 2 | 2015-06-29 23:25 |
basic question for assignment | wong8888 | Information & Answers | 5 | 2015-03-22 12:15 |
A basic math question | iconized | Prime Sierpinski Project | 2 | 2012-02-03 00:01 |
Basic optimisation question | fivemack | Puzzles | 6 | 2008-04-08 13:50 |
Basic Question about ECM factoring? | drake2 | Math | 1 | 2006-01-12 07:40 |