On Thu, Mar 17, 2022 at 12:23 PM GUSTAVO TERRA BASTOS <gtbas...@ufsj.edu.br> wrote: > > Hi ! > > Given square matrices M, N over large finite fields, is there an easy way to > compute the positive integer so that M^i = N ? > this is known as a discrete logarithm problem, and no fast algorithms are known. https://en.wikipedia.org/wiki/Discrete_logarithm
There is however a necessary condition, that M and N commute, i.e. MN=NM, which is certainly fast to check. > Best regards, > Gustavo > > -- > 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 view this discussion on the web visit > https://groups.google.com/d/msgid/sage-support/2816c390-86d3-40e3-8d93-574f6fe090ban%40googlegroups.com. -- 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 view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/CAAWYfq0LVxmkTxC%2BGkqAMaqZadQkFk7w0WOBE-6yDcwiqCQ-Kg%40mail.gmail.com.
