- **Math**
(*https://www.mersenneforum.org/forumdisplay.php?f=8*)

- - **Very basic question about Wiedemann methods**
(*https://www.mersenneforum.org/showthread.php?t=10400*)

Very basic question about Wiedemann methodsI 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. |

All times are UTC. The time now is 07:22. |

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.